Renovation of Node Connectivity in Wireless Sensor Networks

Abstract

In Wireless Sensor Networks, communications between sensor nodes are mandatory. Nodes of these network monitors different region of area and present overview about the monitored activities. In this network, nodes have mobility characteristic in which Connectivity and Coverage are important factors. Due to failure of sensor node, interactions among the nodes get affected and may partition the network into disjoint segments. Number of approaches has been proposed, however these approach ignore possible loss of coverage in some areas and overcome the coverage and connectivity problem. Connectivity Renovation Algorithm is presented to overcome coverage and connectivity problem. When a failure node is detected, the neighbour nodes involve for recover from the failure. A schedule is maintained based on the distance value and the neighbour nodes are replaced, one at a time, in the position of failed node and serve for a period of time and return back to its original position. This paper also present Energy-Centric optimized Recovery algorithm, which is geared for energy efficiency. These approaches fill the gap by addressing coverage and connectivity between the nodes in an integrated manner. Both approaches are distributed and localized algorithms that impose little messaging overhead and can thus scale for large networks.