Date Added: Jan 2012
A wireless sensor network can get separated into multiple connected components due to the failure of some of its nodes, which is called a "Cut." In this paper, the authors consider the problem of detecting cuts by the remaining nodes of a wireless sensor network. They propose an algorithm that allows every node to detect when the connectivity to a specially designated node has been lost, and one or more nodes (that are connected to the special node after the cut) to detect the occurrence of the cut. The algorithm is distributed and asynchronous: every node needs to communicate with only those nodes that are within its communication range.