Deploying Sensor Networks With Guaranteed Fault Tolerance
Name
Bredin-2010-Deploying Sensor Networks With Guaranteed Fault Tolerance.pdf
Size
848.91 KB
Format
Adobe PDF
Checksum (MD5)
680e2f32f2c0b1c57f0dd453f52b17ba
Author(s)
Hajiaghayi, Mohammad Taghi
Bredin, Jonathan L.
Demaine, Erik D.
Rus, Daniela L.
Date Issued
February 2010
Journal
IEEE/ACM Transactions on Networking
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Bredin, J.L. et al. “Deploying Sensor Networks With Guaranteed Fault Tolerance.” IEEE/ACM Transactions on Networking 18.1 (2010): 216–228. Web. 4 Apr. 2012. © 2010 Institute of Electrical and Electronics Engineers
Version
Final published version
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.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/tnet.2009.2024941
