Download now Free registration required
A wireless sensor network is a set of multiple connected components. Sometimes due to the failure of some of its nodes, the sensor network communication fails. So that the authors consider this problem of node(s) failure termed as "Cut" from the remaining nodes of a wireless sensor network. They propose an algorithm that allows every node to detect when the connectivity to a specially designated node has been lost, and one or more nodes (that are connected to the special node after the cut) to detect the occurrence of the cut. The algorithm they proposed is distributed and asynchronous i.e., every node needs to communicate with only those nodes that are within its communication range.
- Format: PDF
- Size: 493.24 KB