Cut Detection and Re-routing in wireless sensor networks

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. Wireless Sensor Network (WSN) is made up of few or large number of sensor nodes and one sink node. One of the crucial challenges in WSN is cut generation instead of increase the life sensor node. Sensor node is small device made up of three basic units as sensor unit, processing unit and wireless communication (transceiver) unit equipped with limited power supply through batteries. Since the node has limited energy supply, these nodes are put in sleep mode to conserve energy which helps to prolong network life.. 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.