Optimal multiple-coverage of sensor networks

—In wireless sensor networks, multiple-coverage, in which each point is covered by more than one sensor, is often required to improve detection quality and achieve high fault tolerance. However, finding optimal patterns that achieve multiplecoverage in a plane remains a long-lasting open problem. In this paper, we first derive the optimal deployment density bound for two-coverage deployment patterns where Voronoi polygons generated by sensor nodes are congruent. We then propose optimal two-coverage patterns based on the optimal bound. We further extend these patterns by considering the connectivity requirement and design a set of optimal patterns that achieve two-coverage and one-, two-, and three-connectivity. We also study optimal patterns under practical considerations. To our knowledge, our work is the very first that proves the optimality of multiplecoverage deployment patterns.

• Type: Journal
• Year: 2011
• Where: INFOCOM
• Authors: Xiaole Bai, Ziqiu Yun, Dong Xuan, Biao Chen, Wei Zhao
• Keywords: Communications, Coverage Patterns, INFOCOM 2011, Optimal Deployment, Wireless Sensor Networks