Worst and Best-Case Coverage in Sensor Networks
IEEE Transactions on Mobile Computing
Handbook On Theoretical And Algorithmic Aspects Of Sensor, Ad Hoc Wireless, and Peer-to-Peer Networks
A Delaunay Triangulation based method for wireless sensor network deployment
Computer Communications
Efficient Placement and Dispatch of Sensors in a Wireless Sensor Network
IEEE Transactions on Mobile Computing
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
| Hi-index | 0.01 |
Coverage is critical for wireless sensor networks to monitor a region of interest and to provide a good quality of service. In many application scenarios, full coverage is required, which means every point inside the region (excluding the obstacles) must be covered by at least one sensor. The problem of using the minimum number of sensors to achieve full coverage for an arbitrary region with obstacles is NP-hard. Most existing coverage methods, such as contour-based ones, simply place sensors along the boundaries to cover the holes that are near the obstacles and the region boundary. These methods are inefficient especially when the obstacles or the region are irregular. In this paper, based on computational geometry, we design a full coverage method, which accurately finds the uncovered holes and places sensors efficiently for both the regular and irregular obstacles and regions. Specifically, we show that the more irregular the obstacles and the region are, the more sensors our method can save.