Title: Cut Detection in Wireless Sensor Networks

Author(s): M Manasa Ravali, Vemula K Harika, M Chaithanya Kishore Reddy

Department Of  Computer Science And Engineering



A wireless sensor network (WSN’s) can be separated into multiple connected components due to the failure of some of its nodes, which is called a “cut.” In this paper, here the considered problem of detecting cuts by the remaining nodes of a wireless sensor network. By the proposal an algorithm that allows

1) Each and every node to detect when the connectivity to a specially designated node has been lost.

2) 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 nodes which are within its communication range. The algorithm is based on the iterative computation of a fictitious “Electrical Potential” of the nodes. The convergence rate of the underlying iterative scheme is independent of the size and structure of the network. We demonstrate the effectiveness of the proposed algorithm through simulations and a real hardware implementation.

License: This work is licensed under a Creative Commons Attribution 4.0 International License.


Website: http://www.ijecs.in

e-ISSN:  2319-724



About Us

The“International Journal of Engineering  and computer science”(IJECS™) is an international online journal in English published monthly. The aim of IJECS is to publish peer reviewed research and review articles in rapidly developing field of engineering science and technology


Address : LIG 73 megdoot Nagar Mandsaur

State : Madhya Pradesh

Country : INDIA

Phone :+91 (822) 260 24 694

Email: editor@ijecs.in

Go to top