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

Authors:
Juhua Pu;Zhang Xiong;Xiaofeng Lu
Affiliations:
School of Computer Science and Engineering, Beijing University of Aeronautics and Astronautics, Beijing 100083 China;School of Computer Science and Engineering, Beijing University of Aeronautics and Astronautics, Beijing 100083 China;School of Computer Science and Engineering, Beijing University of Aeronautics and Astronautics, Beijing 100083 China
Venue:
Wireless Communications & Mobile Computing
Year:
2009

Citing 0
Cited 3

On the minimum k-connectivity repair in wireless sensor networks

ICC'09 Proceedings of the 2009 IEEE international conference on Communications
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
Collaborative localization in visual sensor networks

ACM Transactions on Sensor Networks (TOSN)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Wireless sensor networks are prone to failure, so prolonging their lifetime and preventing loss of connectivity are significant. A simple but efficient strategy is to place redundant sensor nodes to establish multi-connectivity. This paper explores how to add as few as possible nodes (called Steiner nodes) to a sensor network such that the resulting network is k-connected or partially k-connected. k-connectivity means that each pair of the nodes, whether Steiner or original, is connected by at least k node-disjoint paths, while partial k-connectivity only requires such connectivity among original nodes. The contribution lies in two aspects. First, the approximation ratio of an existing k-connectivity repair algorithm is decreased from O(k4α) to O(k3α), where α is the approximation ratio of any algorithm that finds a minimum-weight k-connected spanning subgraph of a weighted complete graph. This is the best result ever obtained. Second, the first generic partial k-connectivity repair algorithm is proposed. It is proved that the approximation ratio of this algorithm is at most O(k3α). Copyright © 2008 John Wiley & Sons, Ltd.