Literature survey of cut detection in wireless sensor networks
Posts: 14,118
Threads: 61
Joined: Oct 2014
A network of wireless sensors can be separated into multiple connected components due to the failure of some of its nodes, which is called "cut". In this paper, we consider the problem of detecting cuts by the remaining nodes of a wireless sensor network. We propose an algorithm that allows 1) each node to detect when it has lost connectivity to a specially designated node, and 2) one or more nodes (which are connected to the special node after the cut) to detect the occurrence of the cut. The algorithm is distributed and asynchronous: each node needs to communicate with only those nodes that are within its range of communication. The algorithm is based on the iterative calculation of a dummy "electric 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 algorithm proposed through simulations and a real hardware implementation.
It can be understood in the following video: