Delaunay-Triangulation Based Complete Coverage in Wireless Sensor Networks

—One of the major issues in a wireless sensor network (WSN) is how to cover an interested area. In this paper, we consider the area coverage problem for variable sensing radii WSN. With variable sensing range, the difficulties to cover a continuous space in the area coverage problem becomes exceptionally harder than covering discrete points in the target (or point) coverage problem. Very few papers have paid effort for the former problem. Wang and Medidi have solved the area coverage problem based on Delaunay triangulation structure [2]. However, due to the boundary effect their proposed algorithms cannot always provide complete surveillance for the whole network. In this work, we improve the work in [2] so that the monitored area can be completely covered. A theorem confirms that our improved algorithm provides complete coverage for all the cases. In addition, the simulation further shows that our energy-efficient algorithm has an obvious improvement on coverage status with very ...

• Type: Conference
• Year: 2009
• Where: PERCOM
• Authors: Chinh T. Vu, Yingshu Li
• Keywords: Area Coverage Problem, PERCOM 2009, Variable Sensing, Variable Sensing Radii, Wireless Networks