TY - GEN
T1 - Link Rate Allocation under Bandwidth and Energy Constraints in Sensor Networks
AU - Cheng, Maggie
AU - Gong, Xuan
AU - Cai, Lin
PY - 2008
Y1 - 2008
N2 - In sensor networks, both energy and band width are scarce resources. In the past, the energy efficient routing problem has been vastly studied in order to maximize network lifetime, but link bandwidth has been optimistically assumed to be abundant. As energy con straint affects how data should be routed, link bandwidth also affects not just the routing topology but also the allowed data rate on each link, which in turn affects lifetime. Previous works that focus on energy efficient operations in sensor networks with the sole objective of maximizing network lifetime only consider the energy constraint and ignore the bandwidth constraint. This article shows how infeasible these solutions could be if bandwidth does become a constraint, then provides a new mathematical model to tackle both energy and bandwidth constraints. Two efficient heuristics are proposed based on this model; Simulation results show these heuristics provide more feasible routing solutions than previous works, and provide significant improvement on throughput.
AB - In sensor networks, both energy and band width are scarce resources. In the past, the energy efficient routing problem has been vastly studied in order to maximize network lifetime, but link bandwidth has been optimistically assumed to be abundant. As energy con straint affects how data should be routed, link bandwidth also affects not just the routing topology but also the allowed data rate on each link, which in turn affects lifetime. Previous works that focus on energy efficient operations in sensor networks with the sole objective of maximizing network lifetime only consider the energy constraint and ignore the bandwidth constraint. This article shows how infeasible these solutions could be if bandwidth does become a constraint, then provides a new mathematical model to tackle both energy and bandwidth constraints. Two efficient heuristics are proposed based on this model; Simulation results show these heuristics provide more feasible routing solutions than previous works, and provide significant improvement on throughput.
UR - http://www.scopus.com/inward/record.url?scp=67249152821&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=67249152821&partnerID=8YFLogxK
U2 - 10.1109/GLOCOM.2008.ECP.979
DO - 10.1109/GLOCOM.2008.ECP.979
M3 - Conference contribution
AN - SCOPUS:67249152821
SN - 9781424423248
T3 - GLOBECOM - IEEE Global Telecommunications Conference
SP - 5123
EP - 5127
BT - 2008 IEEE Global Telecommunications Conference, GLOBECOM 2008
T2 - 2008 IEEE Global Telecommunications Conference, GLOBECOM 2008
Y2 - 30 November 2008 through 4 December 2008
ER -