DocumentCode :
1335798
Title :
Deploying Sensor Networks With Guaranteed Fault Tolerance
Author :
Bredin, Jonathan L. ; Demaine, Erik D. ; Hajiaghayi, Mohammad Taghi ; Rus, Daniela
Author_Institution :
Dept. of Math. & Comput. Sci., Colorado Coll., Colorado Springs, CO, USA
Volume :
18
Issue :
1
fYear :
2010
Firstpage :
216
Lastpage :
228
Abstract :
We consider the problem of deploying or repairing a sensor network to guarantee a specified level of multipath connectivity (k-connectivity) between all nodes. Such a guarantee simultaneously provides fault tolerance against node failures and high overall network capacity (by the max-flow min-cut theorem). We design and analyze the first algorithms that place an almost-minimum number of additional sensors to augment an existing network into a k -connected network, for any desired parameter k . Our algorithms have provable guarantees on the quality of the solution. Specifically, we prove that the number of additional sensors is within a constant factor of the absolute minimum, for any fixed k . We have implemented greedy and distributed versions of this algorithm, and demonstrate in simulation that they produce high-quality placements for the additional sensors.
Keywords :
fault tolerance; multipath channels; sensor placement; wireless sensor networks; deploying sensor networks; guaranteed fault tolerance; high-quality placements; multipath connectivity; Approximation algorithms; augmentation; graph algorithms; sensor networks;
fLanguage :
English
Journal_Title :
Networking, IEEE/ACM Transactions on
Publisher :
ieee
ISSN :
1063-6692
Type :
jour
DOI :
10.1109/TNET.2009.2024941
Filename :
5337926
Link To Document :
بازگشت