Extending k-Coverage Lifetime of Wireless Sensor Networks with Surplus Nodes

In the wireless sensor network (WSN) for periodically sensing and gathering environmental information uniformly in a vast sensing field, reducing the system operating cost taking into account sensor node installation and WSN lifetime is essential. In this paper, we propose a method to prolong the lifetime of such a data gathering WSN, by randomly scattering “surplus” sensor nodes over the target field. In our method, we assume that each sensor node has three operation modes: sensing, relaying, and sleeping. Each sensing node senses environmental data and sends/relays the data to the sink node via multi-hop wireless communication. Each relaying node just forwards the data received from its uplink node to its downlink nodes. Each sleeping node does nothing and keeps its battery. We propose an algorithm that dynamically changes mode of each sensor node so that the WSN lifetime becomes as long as possible by switching the least number of nodes for achievingk-coverage of the field to sensing mode. Through computer simulations, we confirmed that our method can prolong the WSN lifetime almost proportionally to the number of deployed sensor nodes.

[1]  Thomas F. La Porta,et al.  Sensor relocation in mobile sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[2]  M. Murata,et al.  Energy-Efficient Clustering Method for Data Gathering in Sensor Networks , 2004 .

[3]  Wei Wang,et al.  Trade-offs between mobility and density for coverage in wireless sensor networks , 2007, MobiCom '07.

[4]  Tarek F. Abdelzaher,et al.  Towards optimal sleep scheduling in sensor networks for rare-event detection , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[5]  Gaurav S. Sukhatme,et al.  Constrained coverage for mobile sensor networks , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[6]  Jianliang Xu,et al.  Extending Network Lifetime for Precision-Constrained Data Aggregation in Wireless Sensor Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[7]  Ai Chen,et al.  Designing localized algorithms for barrier coverage , 2007, MobiCom '07.

[8]  Mani B. Srivastava,et al.  Self aware actuation for fault repair in sensor networks , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

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

[10]  Ashish Goel,et al.  Set k-cover algorithms for energy efficient monitoring in wireless sensor networks , 2003, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[11]  Prasun Sinha,et al.  Dynamic Sleep Scheduling using Online Experimentation for Wireless Sensor Networks , 2005 .

[12]  Wendi Heinzelman,et al.  Energy-efficient communication protocol for wireless microsensor networks , 2000, Proceedings of the 33rd Annual Hawaii International Conference on System Sciences.

[13]  Keiichi Yasumoto,et al.  Extending k-Coverage Lifetime of Wireless Sensor Networks Using Mobile Sensor Nodes , 2009, 2009 IEEE International Conference on Wireless and Mobile Computing, Networking and Communications.

[14]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.