Deploying sensor networks with guaranteed capacity and fault tolerance

Authors:
Jonathan L. Bredin;Erik D. Demaine;MohammadTaghi Hajiaghayi;Daniela Rus
Affiliations:
Colorado College, Colorado Springs, CO;Massachusetts Institute of Technology, Cambridge, MA;Massachusetts Institute of Technology, Cambridge, MA;Massachusetts Institute of Technology, Cambridge, MA
Venue:
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Year:
2005

Citing 17
Cited 35

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
Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems

SIAM Journal on Computing
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
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
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
Efficient topology control for ad-hoc wireless networks with non-uniform transmission ranges

Wireless Networks

Low power light-weight embedded systems

Proceedings of the 2006 international symposium on Low power electronics and design
Algorithms for minimum m-connected k-tuple dominating set problem

Theoretical Computer Science
Minimizing movement

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Strategies and techniques for node placement in wireless sensor networks: A survey

Ad Hoc Networks
iMST: A bandwidth-guaranteed topology control algorithm for TDMA-based ad hoc networks with sectorized antennas

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
Improved Approximation Algorithms for Relay Placement

ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Fault tolerance measures for large-scale wireless sensor networks

ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Minimizing movement

ACM Transactions on Algorithms (TALG)
Measuring and guaranteeing quality of barrier coverage for general belts with wireless sensors

ACM Transactions on Sensor Networks (TOSN)
On the construction of 2-connected virtual backbone in wireless networks

IEEE Transactions on Wireless Communications
Traffic-aware relay node deployment for data collection in wireless sensor networks

SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
Energy-aware post settings: a study on performance gain by adding relaying nodes in wireless ad-hoc networks

WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
On Performance of Node Placement Approaches for Hierarchical Heterogeneous Sensor Networks

Mobile Networks and Applications
Near optimal sensor selection in the Columbia river (CORIE) observation network for data assimilation using genetic algorithms

DCOSS'07 Proceedings of the 3rd IEEE international conference on Distributed computing in sensor systems
Algorithms for minimum m-connected k-dominating set problem

COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Constrained relay node placement in wireless sensor networks: formulation and approximations

IEEE/ACM Transactions on Networking (TON)
On the minimum k-connectivity repair in wireless sensor networks

ICC'09 Proceedings of the 2009 IEEE international conference on Communications
On improved relay nodes placement in two-tiered wireless sensor networks

MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Relay placement for fault tolerance in wireless networks in higher dimensions

Computational Geometry: Theory and Applications
Constrained low-interference relay node deployment for underwater acoustic wireless sensor networks

COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Approximating survivable networks with minimum number of Steiner points

WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Minimizing movement in mobile facility location problems

ACM Transactions on Algorithms (TALG)
Poster: Node placement adviser for sensor network deployment

Proceedings of the 9th ACM Conference on Embedded Networked Sensor Systems
Research on the fault tolerance deployment in sensor networks

GCC'05 Proceedings of the 4th international conference on Grid and Cooperative Computing
On the problem of k-coverage in mission-oriented mobile wireless sensor networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Fault-Tolerant relay deployment based on length-constrained connectivity and rerouting centrality in wireless sensor networks

EWSN'12 Proceedings of the 9th European conference on Wireless Sensor Networks
Survey: A survey on relay placement with runtime and approximation guarantees

Computer Science Review
Constrained surface-level gateway placement for underwater acoustic wireless sensor networks

Theoretical Computer Science
Approximating survivable networks with minimum number of steiner points

Networks
An incremental deployment algorithm for wireless sensor networks using one or multiple autonomous agents

Ad Hoc Networks
On optimal connectivity restoration in segmented sensor networks

EWSN'13 Proceedings of the 10th European conference on Wireless Sensor Networks
Scalable redundancy for sensors-to-sink communication

IEEE/ACM Transactions on Networking (TON)
Survey Topology management techniques for tolerating node failures in wireless sensor networks: A survey

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.01

Visualization

Abstract

We consider the problem of deploying or repairing a sensor network to guarantee a specified level of multi-path connectivity (k-connectivity) between all nodes. Such a guarantee simultaneously provides fault tolerance against node failures and high capacity through multi-path routing. 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. We are also in the process of using our algorithms to deploy nodes in a physical sensor network using a mobile robot.