A new Approach on Survey of Cut Detection in Wireless Sensor Networks

Abstract

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 article we consider the problem of detecting cuts by the remaining nodes of a wireless senso r network. We propose an algorithm that a llows (i) every node to detect when the connectivity to a specially designated node has been lost, and (ii) 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 base d on the iterative computation of a fictitious "electrical potential" of the nodes. The convergence rate of the underlying iter ativ e scheme is independent of the size and structure of the network. Wireless Sensor Networks (WSNs) consist of thousands of tiny nodes having the capability of sensing, computation, and wireless communications. Wireless sensor network can suffer partition problem in the network which is called a cut. So a single topology of the network breaks into two or more parts. Here we discuss several cut detecti on techniques to detect the cuts in WSN.