Cut Detection and Recovery in Wireless Sensor Networks

Abstract

In WSN(wireless sensor network) will get partition into multiple number connected elements due to the failure of a number of its nodes, that is termed has cut. We tend to contemplate the drop back of detective work cut by the remaining nodes of a wireless sensor network. We tend to propose associate degree algorithmic rule that enables. Each node to notice once the property to a specially selected node has been lost. One or a lot of nodes that are connected to the special node when the cut. The rule of algorithmic is distributed and not synchronized: Each node has to communicate with solely those nodes that are among its communication limit. The algorithmic rule relies on the repetitious computation of a untrue electrical pulse of nodes. The meeting time of the underlying repetitious theme is freelance of the dimensions and structure of the network. We tend to demonstrate the effectiveness of the planned algorithmic rule through simulations and real implementation.