Vector method based coverage hole recovery in Wireless Sensor Networks

In Wireless Sensor Networks (WSN), sensors form the network dynamically without help of any infrastructure. The accidental death of the nodes due to technical failures or death due to power exhaustion may disturb the existing coverage and connectivity of the network. In this paper, distributed coverage hole recovery algorithms for the wireless sensor networks are designed that use the vector methods to decide the magnitude and direction of the mobile nodes. In the post deployment scenario, coverage holes of the network are repaired by moving the nodes in a self organized manner. To minimize the energy consumption of the nodes due to mobility, algorithms are designed in such a way that the mobility is limited within only one-hop of the nodes and highest coverage (k-coverage) of a node is not increased after its mobility. Performance evaluation of the proposed algorithms show that cent percent of coverage recovery could be possible by moving the nodes within their communication range. Besides, the average mobility distance of the nodes is very small to recover the coverage holes by our algorithms.

[1]  Jan Vitek,et al.  Redundancy and coverage detection in sensor networks , 2006, TOSN.

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

[3]  Brian J. d'Auriol,et al.  Mobility-Assisted Relocation for Self-Deployment in Wireless Sensor Networks , 2007, IEICE Trans. Commun..

[4]  Bill Goodwine,et al.  MICAbot: a robotic platform for large-scale distributed robotics , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

[5]  Thomas F. La Porta,et al.  Movement-assisted sensor deployment , 2004, IEEE INFOCOM 2004.

[6]  Songwu Lu,et al.  PEAS: a robust energy conserving protocol for long-lived sensor networks , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

[7]  C. Siva Ram Murthy,et al.  Dynamic Coverage Maintenance Algorithms for Sensor Networks with Limited Mobility , 2005, Third IEEE International Conference on Pervasive Computing and Communications.

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

[9]  Sajal K. Das,et al.  Integrated Coverage and Connectivity in Wireless Sensor Networks: A Two-Dimensional Percolation Problem , 2008, IEEE Transactions on Computers.

[10]  Brad Karp,et al.  Greedy Perimeter Stateless Routing for Wireless Networks , 2000 .

[11]  Dharma P. Agrawal,et al.  Coverage and Lifetime Optimization of Wireless Sensor Networks with Gaussian Distribution , 2008, IEEE Transactions on Mobile Computing.

[12]  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.

[13]  Gaurav S. Sukhatme,et al.  Mobile Sensor Network Deployment using Potential Fields : A Distributed , Scalable Solution to the Area Coverage Problem , 2002 .

[14]  Anne-Marie Kermarrec,et al.  Connectivity-Guaranteed and Obstacle-Adaptive Deployment Schemes for Mobile Sensor Networks , 2008, IEEE Transactions on Mobile Computing.

[15]  Jang-Ping Sheu,et al.  Dynamic Coverage and Connectivity Maintenance Algorithms for Wireless Sensor Networks , 2007, 2007 2nd International Conference on Communication Systems Software and Middleware.

[16]  Stéphane Lafortune,et al.  An algorithm for maximising covered area , 2008, Int. J. Control.

[17]  Yeh-Ching Chung,et al.  A Delaunay Triangulation based method for wireless sensor network deployment , 2007, Comput. Commun..

[18]  Gaurav S. Sukhatme,et al.  Robomote: a tiny mobile robot platform for large-scale ad-hoc sensor networks , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[19]  Brad Karp,et al.  GPSR: greedy perimeter stateless routing for wireless networks , 2000, MobiCom '00.