On the minimum k-connectivity repair in wireless sensor networks

Authors:
Hisham M. Almasaeid;Ahmed E. Kamal
Affiliations:
Dept. of Electrical and Computer Engineering, Iowa State University, Ames, IA;Dept. of Electrical and Computer Engineering, Iowa State University, Ames, IA
Venue:
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Year:
2009

Citing 4
Cited 0

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Deploying sensor networks with guaranteed capacity and fault tolerance

Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Strategies and techniques for node placement in wireless sensor networks: A survey

Ad Hoc Networks
Fault-tolerant deployment with k-connectivity and partial k-connectivity in sensor networks

Wireless Communications & Mobile Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Repairing connectivity and achieving a certain level of fault tolerance are two important research challenges in wireless sensor networks that have, in many papers in the literature, been jointly studied. Most of the proposals that aim at restoring network connectivity deal with the network as a general graph of N nodes with the edge cost being the number of nodes needed to establish connectivity between the two ends of the edge. This assumption ignores the topological properties of the network, especially the overlap between sensors' communication ranges, and the node-failure pattern that caused the disconnection. In this paper, we try to exploit these properties to minimize the number of additional nodes needed to repair the connectivity.