Research Area:  Wireless Sensor Networks
In wireless sensor networks, random deployment of nodes may cause serious coverage overlapping among the nodes and the original network may suffer severe coverage problems due to death of the nodes after deployment. In this paper, efficient distributed coverage hole repair algorithms are proposed taking density of the nodes in the post deployment scenario. The proposed algorithms consider limited mobility of the nodes and can select the mobile nodes based on their degree of coverage overlapping. In order to repair coverage holes of the network, nodes with higher degree of density are moved to maintain uniform network density without increasing the coverage degree of the neighbors of a mobile node. Simulation results show that the energy consumption due to mobility of nodes is least as compared to other similar protocols of the Wireless Sensor Networks. Besides, it is observed that substantial amount of coverage overlapping can be minimized and percentage of coverage of the holes can be maximized.
Author(s) Name:  Prasan Kumar Sahoo and Wei-Cheng Liao
Journal name:   IEEE Transactions on Mobile Computing
Publisher name:  IEEE
Volume Information:  Volume: 14, Issue: 7, July 1 2015,Page(s): 1397 - 1410
Paper Link:   https://ieeexplore.ieee.org/document/6906272