Cut detection and secure routing in wireless sensor networks

Wireless sensor network will become isolated in various associated segments because of the disappointment of some of its hubs, which is known as a “cut”. In this paper, authors acknowledge the issue of distinguishing cuts by the remaining hubs of a wireless sensor network. System proposes an estimation which grants every hub to identify at the time of accessibility to an extremely assigned hub has been lost, and one or more hubs (that are connected with the unique hub after the cut) to recognize the cut's event. The calculation is passed on and strange: every hub needs to relate with simply those hubs that are within its correspondence range. The estimation relies on upon the iterative calculation of an invented “electrical potential” of the hubs. The combining rate of the concealed iterative arrangement is self-governing of the size as well as network structure. Also this system implements a lightweight encryption algorithm to rout data securely in the network and enhance the system performance.