DMCA
Maximum Lifetime Routing In Wireless Sensor Networks (2000)
| Venue: | IEEE/ACM TRANSACTIONS ON NETWORKING |
| Citations: | 282 - 0 self |
BibTeX
@ARTICLE{Chang00maximumlifetime,
author = {Jae-hwan Chang and Leandros Tassiulas},
title = {Maximum Lifetime Routing In Wireless Sensor Networks},
journal = {IEEE/ACM TRANSACTIONS ON NETWORKING},
year = {2000},
volume = {12},
pages = {609--619}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Routing in power-controlled wireless sensor networks is formulated as an optimization problem with the goal of maximizing the system lifetime. Considering that the information is delivered in the form of packets, we identified the problem as an integer programming problem. It is known that the system lifetime can be significantly extended by using a link metric that utilizes the information about the residual energy of the sensor nodes as well as the energy expenditure in transmission of a unit information over the wireless links. In this paper, some of the routing algorithms are proposed and examined in order to find the best link cost function and the method of shortest path calculation. The performance comparison is made through simulation in a typical battlefield scenario where sensors detecting a moving target vehicle periodically send a reporting packet to one of the gateway nodes. The results are also compared with the optimal solution obtained by the linear programming relaxation of the problem, which showed close-to-optimal performance.
Keyphrases
maximum lifetime routing wireless sensor network system lifetime optimal solution linear programming relaxation residual energy gateway node integer programming problem unit information shortest path calculation performance comparison reporting packet energy expenditure sensor node optimization problem routing algorithm wireless link target vehicle close-to-optimal performance link cost function power-controlled wireless sensor network typical battlefield scenario
