INTERNATIONAL JOURNAL OF MERGING TECHNOLOGY AND ADVANCED RESEARCH IN COMPUTING CUT DETECTION IN WIRELESS SENSOR NETWORKS

Kashaiah, Mtech
unpublished
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 article we consider the problem of detecting cuts by 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
more » ... 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.
fatcat:v2c6j5bn2ffwtl5hvmxm3larqq