A remote sensor system can get differentiated into different joined segments because of the disappointment of some of its hubs, which is known as a "cut". In this project we consider the issue of catching cuts by the remaining hubs of a remote sensor system. We propose a calculation that permits (i) each hub to recognize when the integration to an exceptionally assigned hub has been lost, and (ii) one or more hubs (that are associated with the uncommon hub after the cut) to discover the event of the cut. The calculation is circulated and non concurrent: each hub needs to correspond with just those hubs that are inside its correspondence range. The calculation is focused around the iterative processing of an imaginary "electrical potential" of the hubs. The union rate of the hidden iterative plan is autonomous of the size and structure of the system. Remote Sensor Networks (Wsns) comprise of a huge number of small hubs having the ability of sensing, calculation, and remote correspondences. Remote sensor system can endure part issue in the system which is known as a cut. So a solitary topology of the system breaks into two or more parts. Here we examine a few slice recognition systems to discover the cuts in WSN.