Constructing k-connected k-cover set in wireless sensor networks based on self-pruning

Authors:
Jie Jiang;Minghua Han;Guofu Wu;Wenhua Dou
Affiliations:
School of Computer Science, National University of Defense Technology, Changsha, China;School of Computer Science, National University of Defense Technology, Changsha, China;School of Computer Science, National University of Defense Technology, Changsha, China;School of Computer Science, National University of Defense Technology, Changsha, China
Venue:
NPC'05 Proceedings of the 2005 IFIP international conference on Network and Parallel Computing
Year:
2005

Citing 10
Cited 0

Spatial tessellations: concepts and applications of Voronoi diagrams

Spatial tessellations: concepts and applications of Voronoi diagrams
A coverage-preserving node scheduling scheme for large wireless sensor networks

WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Wireless sensor networks for habitat monitoring

WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Wireless sensor networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
Connected sensor cover: self-organization of sensor networks for efficient query execution

Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
PEAS: A Robust Energy Conserving Protocol for Long-lived Sensor Networks

ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Integrated coverage and connectivity configuration in wireless sensor networks

Proceedings of the 1st international conference on Embedded networked sensor systems
Differentiated surveillance for sensor networks

Proceedings of the 1st international conference on Embedded networked sensor systems
Sensor networks: a bridge to the physical world

Wireless sensor networks
On Constructing k-Connected k-Dominating Set in Wireless Networks

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01

Quantified Score

Hi-index	0.00

Visualization

Abstract

Density control is a promising approach to conserving system energy and extending lifetime of wireless sensor networks. Most of previous work in this field has focused on selecting a minimal subset of active sensor nodes for high efficiency while guaranteeing only 1-coverage (or plus 1-connectivity of the network). In this paper, we address the issue of constructing a k-connected k-cover set of a wireless sensor network for fault tolerance and balance efficiency. We propose a distributed, localized algorithm based on self-pruning for selecting active sensor nodes to form a k-connected k-cover set for the target region. The performance of the proposed algorithm is evaluated through numerical experiments.