Improved approximation algorithms for uniform connectivity problems
Journal of Algorithms
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Journal of the ACM (JACM)
Steiner tree problem with minimum number of Steiner points and bounded edge-length
Information Processing Letters
A representation for crossing set families with applications to submodular flow problems
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
On k-connectivity for a geometric random graph
Random Structures & Algorithms
Power consumption in packet radio networks
Theoretical Computer Science
Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Algorithmic aspects of topology control problems for ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Approximations for Steiner Trees with Minimum Number of Steiner Points
Journal of Global Optimization
A Polynomial Time Approximation Scheme for Euclidean Minimum Cost k-Connectivity
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Hardness of Approximation for Vertex-Connectivity Network-Design Problems
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
On the Symmetric Range Assignment Problem in Wireless Ad Hoc Networks
TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
Symmetric Connectivity with Minimum Power Consumption in Radio Networks
TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
Fault tolerant deployment and topology control in wireless networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
The K-Neigh Protocol for Symmetric Topology Control in Ad Hoc Networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks
Proceedings of the 9th annual international conference on Mobile computing and networking
FLSS: a fault-tolerant topology control algorithm for wireless networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Robust distributed network localization with noisy range measurements
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Algorithms for minimum m-connected k-tuple dominating set problem
Theoretical Computer Science
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Optimal Cluster-Cluster Design for Sensor Network with Guaranteed Capacity and Fault Tolerance
SNPD '07 Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01
Fault-Tolerant Sensor Coverage for Achieving Wanted Coverage Lifetime with Minimum Cost
WASA '07 Proceedings of the International Conference on Wireless Algorithms,Systems and Applications
Revising Quorum Systems for Energy Conservation in Sensor Networks
WASA '07 Proceedings of the International Conference on Wireless Algorithms,Systems and Applications
Elections in a Distributed Computing System
IEEE Transactions on Computers
FT-CoWiseNets: A Fault Tolerance Framework for Wireless Sensor Networks
SENSORCOMM '07 Proceedings of the 2007 International Conference on Sensor Technologies and Applications
Computer Networks: The International Journal of Computer and Telecommunications Networking
Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks
IEEE/ACM Transactions on Networking (TON)
Measuring and guaranteeing quality of barrier-coverage in wireless sensor networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Analysis and implementation of distributed algorithms for multi-robot systems
Analysis and implementation of distributed algorithms for multi-robot systems
On the construction of 2-connected virtual backbone in wireless networks
IEEE Transactions on Wireless Communications
DCOSS'07 Proceedings of the 3rd IEEE international conference on Distributed computing in sensor systems
Research on the fault tolerance deployment in sensor networks
GCC'05 Proceedings of the 4th international conference on Grid and Cooperative Computing
Relay placement for two-connectivity
IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part II
Collaborative localization in visual sensor networks
ACM Transactions on Sensor Networks (TOSN)
Surviving sensor node failures by MMU-less incremental checkpointing
Journal of Systems and Software
Energy aware based fault tolerance approach for topology control in distributed sensor networks
Journal of High Speed Networks
| Hi-index | 0.00 |
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.