Issue No. 03 - March (2012 vol. 23)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2011.178
Tamás Kalmár-Nagy , Texas A&M University, College Station
Radu Stoleru , Texas A&M University, College Station
Harshavardhan Chenji , Texas A&M University, College Station
Prabir Barooah , University of Florida, Gainesville
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, we consider the problem of detecting cuts by the remaining nodes of a wireless sensor network. We propose an algorithm that allows 1) every node to detect when the connectivity to a specially designated node has been lost, and 2) 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. 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.
Wireless networks, sensor networks, network separation, detection and estimation, iterative computation.
Tamás Kalmár-Nagy, Radu Stoleru, Harshavardhan Chenji, Prabir Barooah, "Cut Detection in Wireless Sensor Networks", IEEE Transactions on Parallel & Distributed Systems, vol. 23, no. , pp. 483-490, March 2012, doi:10.1109/TPDS.2011.178