A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
In this paper; we consider the problem of detecting cuts by the remaining nodes of a wireless sensor network. Network partitioning is a form of network failure. A single connected network topology breaks apart into two or more network topologies separated from each other. An algorithm which enables each node in the network to detect whether a cut has occurred anywhere in the network is demonstrated. The algorithm is based on the iterative computation of a fictitious "electrical potential" ofdoi:10.9790/3021-03921316 fatcat:li3lgmx5x5htdg2yduj2phpo2i