TY - GEN
T1 - Maximizing broadcast tree lifetime in wireless ad hoc networks
AU - Deng, Guofeng
AU - Gupta, Sandeep
PY - 2006
Y1 - 2006
N2 - In wireless ad hoc networks (WANETs), e.g. wireless sensor networks, battery-powered devices are constrained by limited amount of energy. Many WANET applications require that the duration (called lifetime) for which the network remains operational - until the first node exhausts its battery energy is maximized. We study the problem of maximizing the lifetime of WANET broadcast trees under two receiver cost models: 1) the constant receiver power (CORP) model, in which a receiver consumes a fixed amount of energy for receiving an information bit; and, 2) the transmitter-receiver power tradeoff (TREPT) model, in which the amount of energy consumed by a receiver is a function of the received signal power and hence the transmitter power. We propose a graph theoretic solution for CORP model to find a maximum lifetime tree and a binary search based solution for TREPT model to determine power assignment which maximizes the lifetime of a given broadcast tree. Both polynomialtime solutions are formally proved to be optimal.
AB - In wireless ad hoc networks (WANETs), e.g. wireless sensor networks, battery-powered devices are constrained by limited amount of energy. Many WANET applications require that the duration (called lifetime) for which the network remains operational - until the first node exhausts its battery energy is maximized. We study the problem of maximizing the lifetime of WANET broadcast trees under two receiver cost models: 1) the constant receiver power (CORP) model, in which a receiver consumes a fixed amount of energy for receiving an information bit; and, 2) the transmitter-receiver power tradeoff (TREPT) model, in which the amount of energy consumed by a receiver is a function of the received signal power and hence the transmitter power. We propose a graph theoretic solution for CORP model to find a maximum lifetime tree and a binary search based solution for TREPT model to determine power assignment which maximizes the lifetime of a given broadcast tree. Both polynomialtime solutions are formally proved to be optimal.
UR - http://www.scopus.com/inward/record.url?scp=50949115518&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=50949115518&partnerID=8YFLogxK
U2 - 10.1109/GLOCOM.2006.1000
DO - 10.1109/GLOCOM.2006.1000
M3 - Conference contribution
AN - SCOPUS:50949115518
SN - 142440357X
SN - 9781424403578
T3 - GLOBECOM - IEEE Global Telecommunications Conference
BT - IEEE GLOBECOM 2006 - 2006 Global Telecommunications Conference
T2 - IEEE GLOBECOM 2006 - 2006 Global Telecommunications Conference
Y2 - 27 November 2006 through 1 December 2006
ER -