Distributed Fault Tolerant Algorithm for Identifying Node Failures in Wireless Sensor Networks

A Wireless Sensor Network is a set of multiple connected components. Sometimes due to the failure of some of its nodes, the sensor network communication fails. So that we consider this problem of node(s) failure termed as “cut” from the remaining nodes of a wireless sensor network. We propose an algorithm that allows (i) every node to detect when the connectivity to a specially designated node has been lost, and (ii) one or more nodes (that are connected to the special node after the cut) to detect the occurrence of the cut. The algorithm we proposed is distributed and asynchronous i.e. every node needs to communicate with only those nodes that are within its communication range. The algorithm is based on the iterative computation of the nodes. The convergence rate of the underlying iterative scheme is independent of the size and structure of the network. In this algorithm we devised a way to solve the problem of redundant information at the destination which arises due to availability of information at every node that is initially sent from the source node. We demonstrate the effectiveness of the proposed algorithm through simulation.