Distributed and Asynchronously Detection of Cut in Wireless Sensor Networks

Wireless sensor networks consist of multiple connected components, Due to multiple connected components, wireless sensor network gets break , which is called a cut. In this article we can detect this potential cuts, by consideration of  remaining nodes ,We have implemented an algorithm which 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 used is distributed and asynchronous: every node communicates with only those nodes that are within its communication range. The algorithm is based on the iterative computation of a fictitious “electrical potential” of the nodes. The convergence rate of the underlying iterative scheme is independent of the size and structure of the network. We demonstrate the effectiveness of the proposed algorithm through simulations and a real hardware implementation.