Constructing k-Connected k-Cover Set in Wireless Sensor Networks Based on Self-pruning

Density control is a promising approach to conserving system energy and extending lifetime of wireless sensor networks. Most of previous work in this field has focused on selecting a minimal subset of active sensor nodes for high efficiency while guaranteeing only 1-coverage (or plus 1-connectivity of the network). In this paper, we address the issue of constructing a k-connected k-cover set of a wireless sensor network for fault tolerance and balance efficiency. We propose a distributed, localized algorithm based on self-pruning for selecting active sensor nodes to form a k-connected k-cover set for the target region. The performance of the proposed algorithm is evaluated through numerical experiments.

[1]  Guoliang Xing,et al.  Integrated coverage and connectivity configuration in wireless sensor networks , 2003, SenSys '03.

[2]  Hongyi Wu,et al.  Grid-based approach for working node selection in wireless sensor networks , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[3]  Himanshu Gupta,et al.  Connected sensor cover: self-organization of sensor networks for efficient query execution , 2003, IEEE/ACM Transactions on Networking.

[4]  Jan Vitek,et al.  Coverage preserving redundancy elimination in sensor networks , 2004, 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004..

[5]  Tian He,et al.  Differentiated surveillance for sensor networks , 2003, SenSys '03.

[6]  Miodrag Potkonjak,et al.  Power efficient organization of wireless sensor networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[7]  Di Tian,et al.  A coverage-preserving node scheduling scheme for large wireless sensor networks , 2002, WSNA '02.

[8]  John A. Stankovic,et al.  Di erentiated Surveillance Service for Sensor Networks , 2003 .

[9]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[10]  Jennifer C. Hou,et al.  Maintaining Sensing Coverage and Connectivity in Large Sensor Networks , 2005, Ad Hoc Sens. Wirel. Networks.

[11]  John Anderson,et al.  Wireless sensor networks for habitat monitoring , 2002, WSNA '02.

[12]  Deborah Estrin,et al.  Sensor networks: a bridge to the physical world , 2004 .

[13]  Atsuyuki Okabe,et al.  Spatial Tessellations: Concepts and Applications of Voronoi Diagrams , 1992, Wiley Series in Probability and Mathematical Statistics.

[14]  Jie Wu,et al.  On constructing k-connected k-dominating set in wireless networks , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[15]  Songwu Lu,et al.  PEAS: a robust energy conserving protocol for long-lived sensor networks , 2002, 10th IEEE International Conference on Network Protocols, 2002. Proceedings..

[16]  Ian F. Akyildiz,et al.  Wireless sensor networks , 2007 .