Distributed Cut Detection in Wireless Sensor Networks

A wireless sensor network consists of spatially distributed autonomous sensors to physical or environmental conditions, such as temperature, sound, pressure, etc. and to cooperatively pass their data through the network to main location. When the data transmission between one node to another, there is some of the nodes in the network are failed, because of above mentioned issues. So, the data will not be transferred to the destination. Because of these failures of nodes the network is divided into multiple parts. The ability to detect the cuts by using the source node and disconnected node of a wireless sensor network will lead to the increase in the lifetime of network. The Distributed Cut Detection (DCD) algorithm proposed here enables every node of wireless sensor network to detect Disconnected from Source events if they occur. Second, it enables a subset of nodes that experience CCOS events to detect them and find the approximate location of the cut in the form of a list of active nodes that lie at the boundary of the cut. The advantage of DCD algorithm is that convergence rate of the iterative scheme is quite fast and independent of the size and structure of network.