Energy conservation in wireless sensor networks and connectivity of graphs

In wireless sensor networks (WSNs), the energy source is usually a battery cell, which is impossible to recharge while WSNs are working. Therefore, one of the main issues in wireless sensor networks is how to prolong the network lifetime of WSNs with certain energy sources as well as how to maintain coverage and connectivity. In this paper, we consider wireless sensor networks satisfying the case that each node either monitors one target or is just for connection. Assume that the wireless sensor network has l targets, and that each is monitored by k sensor nodes. If k=2 and the graph G corresponding to the wireless sensor network is (l+max{1,l-4})-connected, or k>=3 and G is (l(k-1)+1)-connected, then we can find k (the maximum number) disjoint sets, each of which completely covers all the targets and remains connected to one of the central processing nodes. The disjoint sets are activated successively, and only the sensor nodes from the active set are responsible for monitoring the targets and connectivity; all other nodes are in a sleep mode. In addition, we also give the related algorithms to find the k disjoint sets.

[1]  Ding-Zhu Du,et al.  Improving Wireless Sensor Network Lifetime through Power Aware Organization , 2005, Wirel. Networks.

[2]  Jie Wu,et al.  Energy-efficient coverage problems in wireless ad-hoc sensor networks , 2006, Comput. Commun..

[3]  Robert Tappan Morris,et al.  Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks , 2002, Wirel. Networks.

[4]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[5]  Mani Srivastava,et al.  Overview of sensor networks , 2004 .

[6]  Kay Römer,et al.  The design space of wireless sensor networks , 2004, IEEE Wireless Communications.

[7]  Imrich Chlamtac,et al.  Energy-conserving access protocols for identification networks , 1999, TNET.

[8]  Deborah Estrin,et al.  Proceedings of the 1st international conference on Embedded networked sensor systems , 2003 .

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

[10]  Jie Wu,et al.  On Connected Multiple Point Coverage in Wireless Sensor Networks , 2006, Int. J. Wirel. Inf. Networks.

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

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

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

[14]  Chai-Keong Toh,et al.  Special issue on innovations in ad hoc mobile pervasive networks , 2002, Journal of Communications and Networks.

[15]  Jie Wu,et al.  An extended localized algorithm for connected dominating set formation in ad hoc wireless networks , 2004, IEEE Transactions on Parallel and Distributed Systems.

[16]  Deying Li,et al.  Wireless Sensor Networks with Energy Efficient Organization , 2002, J. Interconnect. Networks.

[17]  Himanshu Gupta,et al.  Connected K-coverage problem in sensor networks , 2004, Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969).

[18]  Ivan Stojmenovic,et al.  On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks , 2002, J. Commun. Networks.

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