Constructing k-Connected k-Cover set in wireless sensor networks based on self-pruning

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-cover age (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. © IFIP International Federation for Information Processing 2006.