A linear-time algorithm for computing the Voronoi diagram of a convex polygon
Discrete & Computational Geometry
A coverage-preserving node scheduling scheme for large wireless sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
PEAS: A Robust Energy Conserving Protocol for Long-lived Sensor Networks
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
The coverage problem in a wireless sensor network
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
On solving coverage problems in a wireless sensor network using voronoi diagrams
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Coverage in wireless ad hoc sensor networks
IEEE Transactions on Computers
| Hi-index | 0.00 |
The coverage problem is a fundamental issue in the research of sensor network. A novel Voronoi tessellation based rapid coverage decision algorithm is proposed, in which the region of interest is partitioned into some square grids firstly, and then the complex area coverage problem is transformed into simple vertices coverage problem, on the basis of the good characteristics of Voronoi tessellation such as being able to divide the planner area into a set of simple geometric simplexes. Theoretical analysis and simulation results show that, the new algorithm can decrease the computation complexity of networks, especially for sensor networks with n different sensors, it can solve the coverage problem correctly for any given region of interest with time costs of O(nlogn) only.