Power balanced coverage-time optimization for clustered wireless sensor networks

  • Authors:

  • Tao Shu;Marwan Krunz;Sarma Vrudhula

  • Affiliations:

  • University of Arizona, Tucson, AZ;University of Arizona, Tucson, AZ;University of Arizona, Tucson, AZ

  • Venue:
  • Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider a wireless sensor network in which sensors are grouped into clusters, each with its own cluster head (CH). Each CH collects data from sensors in its cluster and relays them to a sink node directly or through other CHs. The coverage time of the network is defined as the time until one of the CHs runs out of battery, resulting in an incomplete coverage of the sensing region. We study the maximization of coverage time by balancing the power consumption of different CHs. Using a Rayleigh fading channel model for inter-cluster communications, we provide optimal power allocation strategies that guarantee (in a probabilistic sense) an upper bound on the end-to-end (inter-CH) path reliability. Our allocation strategies account for the interaction between routing and clustering by considering the impacts of intra- and inter-cluster traffic at each CH. Two mechanisms are proposed for achieving balanced power consumption: the routing-aware optimal cluster planning and the clustering-aware optimal random relay. For both mechanisms, the problem is formulated as a signomial optimization, which can be efficiently solved using generalized geometric programming. Numerical examples and simulations are used to validate our analysis and study the performance of the proposed schemes.