DocumentCode :
2239800
Title :
Distributed cut detection in sensor networks
Author :
Barooah, Prabir
Author_Institution :
Dept. of Mech. & Aerosp. Eng., Univ. of Florida, Gainesville, FL, USA
fYear :
2008
fDate :
9-11 Dec. 2008
Firstpage :
1097
Lastpage :
1102
Abstract :
We propose a distributed algorithm to detect ¿cuts¿ in sensor networks, i.e., the failure of a set of nodes that separates the networks into two or more components. The algorithm consists of a simple iterative scheme in which every node updates a scalar state by communicating with its nearest neighbors. In the absence of cuts, the states converge to values that are equal to potentials in a fictitious electrical network. When a set of nodes gets separated from a special node, that we call a ¿source node¿, their states converge to 0 because ¿current is extracted¿ from the component but none is injected. These trends are used by every node to detect if a cut has occurred that has rendered it disconnected from the source. Although the algorithm is iterative and involves only local communication, its convergence rate is quite fast and is independent of the size of the network.
Keywords :
convergence of numerical methods; distributed algorithms; iterative methods; telecommunication network topology; wireless sensor networks; convergence rate; distributed cut detection algorithm; fictitious electrical network; iterative algorithm; wireless sensor network; Condition monitoring; Convergence; Degradation; Distributed algorithms; Intelligent networks; Iterative algorithms; Nearest neighbor searches; Network topology; Source separation; Wireless sensor networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Decision and Control, 2008. CDC 2008. 47th IEEE Conference on
Conference_Location :
Cancun
ISSN :
0191-2216
Print_ISBN :
978-1-4244-3123-6
Electronic_ISBN :
0191-2216
Type :
conf
DOI :
10.1109/CDC.2008.4738767
Filename :
4738767
Link To Document :
بازگشت