Power balanced coverage-time optimization for clustered wireless sensor networks

Tao Shu, Marwan M Krunz, Sarma Vrudhula

Research output: Chapter in Book/Report/Conference proceedingConference contribution

79 Citations (Scopus)

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.

Original languageEnglish (US)
Title of host publicationProceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)
Pages111-120
Number of pages10
StatePublished - 2005
EventMOBIHOC 2005: 6th ACM International Symposium on Mobile Ad Hoc Networking and Computing - Urbana-Champaign, IL, United States
Duration: May 25 2005May 28 2005

Other

OtherMOBIHOC 2005: 6th ACM International Symposium on Mobile Ad Hoc Networking and Computing
CountryUnited States
CityUrbana-Champaign, IL
Period5/25/055/28/05

Fingerprint

Wireless sensor networks
Electric power utilization
Sensors
Rayleigh fading
Fading channels
Planning
Communication

Keywords

  • Clustering
  • Coverage time
  • Generalized geometric programming
  • Sensor networks
  • Signomial optimization
  • Topology control

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Shu, T., Krunz, M. M., & Vrudhula, S. (2005). Power balanced coverage-time optimization for clustered wireless sensor networks. In Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) (pp. 111-120)

Power balanced coverage-time optimization for clustered wireless sensor networks. / Shu, Tao; Krunz, Marwan M; Vrudhula, Sarma.

Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). 2005. p. 111-120.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Shu, T, Krunz, MM & Vrudhula, S 2005, Power balanced coverage-time optimization for clustered wireless sensor networks. in Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). pp. 111-120, MOBIHOC 2005: 6th ACM International Symposium on Mobile Ad Hoc Networking and Computing, Urbana-Champaign, IL, United States, 5/25/05.
Shu T, Krunz MM, Vrudhula S. Power balanced coverage-time optimization for clustered wireless sensor networks. In Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). 2005. p. 111-120
Shu, Tao ; Krunz, Marwan M ; Vrudhula, Sarma. / Power balanced coverage-time optimization for clustered wireless sensor networks. Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). 2005. pp. 111-120
@inproceedings{7c0a86e0ff9c40dc812fb2d550a0386c,
title = "Power balanced coverage-time optimization for clustered wireless sensor networks",
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.",
keywords = "Clustering, Coverage time, Generalized geometric programming, Sensor networks, Signomial optimization, Topology control",
author = "Tao Shu and Krunz, {Marwan M} and Sarma Vrudhula",
year = "2005",
language = "English (US)",
pages = "111--120",
booktitle = "Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)",

}

TY - GEN

T1 - Power balanced coverage-time optimization for clustered wireless sensor networks

AU - Shu, Tao

AU - Krunz, Marwan M

AU - Vrudhula, Sarma

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

KW - Clustering

KW - Coverage time

KW - Generalized geometric programming

KW - Sensor networks

KW - Signomial optimization

KW - Topology control

UR - http://www.scopus.com/inward/record.url?scp=29844445783&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=29844445783&partnerID=8YFLogxK

M3 - Conference contribution

SP - 111

EP - 120

BT - Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)

ER -