Deploying Sensor Networks With Guaranteed Fault Tolerance
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 th...
Main Authors: | Hajiaghayi, Mohammad Taghi, Bredin, Jonathan L., Demaine, Erik D., Rus, Daniela L. |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | en_US |
Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2012
|
Online Access: | http://hdl.handle.net/1721.1/69942 https://orcid.org/0000-0003-3803-5703 https://orcid.org/0000-0001-5473-3566 |
Similar Items
-
Fixed Parameter Algorithms for Minor-Closed Graphs (of Locally Bounded Treewidth)
by: Demaine, Erik D., et al.
Published: (2023) -
Equivalence of Local Treewidth and Linear Local Treewidth and its Algorithmic Applications
by: Demaine, Erik D., et al.
Published: (2023) -
Basic Network Creation Games
by: Alon, Noga, et al.
Published: (2012) -
Guaranteeing spoof-resilient multi-robot networks
by: Kumar, Swarun, et al.
Published: (2017) -
Lossless fault-tolerant data structures with additive overhead
by: Christiano, Paul F., et al.
Published: (2012)