Improved Hole Detection Healing and Replacing Algorithm for Optimal Coverage in Wireless Sensor Networks
D. Jewel, P. Brundha, D.C. Joy Winnie Wise, G. Aravind Swaminathan · Zenodo (CERN European Organization for Nuclear Research) · 2017
In wireless sensor network, random deployment of nodes may cause serious coverage overlapping and the death of the nodes may also cause severe coverage problems in original network. There are several hole repair algorithms which take density of the nodes in the post deployment scenario. These algorithms consider limited mobility of the nodes and nodes with higher degree of coverage overlapping is selected. Coverage holes of the network are repaired by moving nodes which has high degree of density. This maintains uniform network density without increasing the coverage degree of the neighbor node. Single and multiple node failure is considered. Due to continuous node failure, the network may not be healed after certain healing process. The node cannot move when the energy goes below the critical level. To avoid this type of problem, the failure detection based on the energy loss is proposed. Nodes with low energy level are identified and are completely replaced by actor nodes.Actors are usually resource-rich devices equipped with better processing capabilities, stronger transmission powers and longer battery life.Here the hole detection and replacing are based on three distinct phases 1) hole identification 2) hole discovery and border detection 3) Node healing and replacement. Distributed and localized holedetection and healing algorithm deals with the holes of various forms and sizes despite node distribution and density. The proposed algorithm consumes less amount of energy when compared to existing algorithm.