An Efficient Connectivity Restoration Technique for Wireless Sensor Network

Firstly, initial nodes are densely deployed and relocation of the network is done after the random deployment. Secondly, in case of single cut-vertex node failure, there is no need of relocation of neighbor node for maintaining inter-node connectivity. Thirdly, in case of end node failure, neighbor nodes measure relative distance thus the node with multiple neighbors and having less relative distance from the failed node, moves towards failed node in half of measured distance to fill coverage hole. Fourthly, in case of simultaneous cut-vertex node failure, each neighbor node relocates permanently in half of measured distance from failed nodes for the restoration of inter-node connectivity. Finally, In case of simultaneous end node failure, neighbor nodes relocate themselves permanently according to the above assumption to fill the coverage gap. The simulation results show that this technique successfully minimize the total distance to travel, the total number of moved nodes, the number of exchanged messages, and reduction in field coverage.