This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Online Heuristic for Maximum Lifetime Routing in Wireless Sensor Networks
August 2006 (vol. 55 no. 8)
pp. 1048-1056
ASCII Text
x 
 
Joongseok Park, Sartaj Sahni, "An Online Heuristic for Maximum Lifetime Routing in Wireless Sensor Networks," IEEE Transactions on Computers, vol. 55, no. 8, pp. 1048-1056, August, 2006.
 
 
BibTex
x
 
@article{ 10.1109/TC.2006.116,
author = {Joongseok Park and Sartaj Sahni},
title = {An Online Heuristic for Maximum Lifetime Routing in Wireless Sensor Networks},
journal ={IEEE Transactions on Computers},
volume = {55},
number = {8},
issn = {0018-9340},
year = {2006},
pages = {1048-1056},
doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2006.116},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Computers
TI - An Online Heuristic for Maximum Lifetime Routing in Wireless Sensor Networks
IS - 8
SN - 0018-9340
SP1048
EP1056
EPD - 1048-1056
A1 - Joongseok Park,
A1 - Sartaj Sahni,
PY - 2006
KW - Wireless sensor networks
KW - lifetime maximization
KW - online power-aware routing.
VL - 55
JA - IEEE Transactions on Computers
ER -
 
We show that the problem of routing messages in a wireless sensor network so as to maximize network lifetime is NP-hard. In our model, the online model, each message has to be routed without knowledge of future route requests. We also develop an online heuristic to maximize network lifetime. Our heuristic, which performs two shortest path computations to route each message, is superior to previously published heuristics for lifetime maximization—our heuristic results in greater lifetime and its performance is less sensitive to the selection of heuristic parameters. Additionally, our heuristic is superior on the capacity metric.

[1] G. Li, J. Aslam, and D. Rus, “On-Line Power-Aware Routing in Wireless Ad Hoc Networks,” Proc. Mobicom, pp. 97-107, July 2001.
[2] K. Kar, M. Kodialam, T.V. Lakshman, and L. Tassiulas, “Routing for Network Capacity Maximization in Energy-Constrained Ad-Hoc Networks,” Proc. Infocom, pp. 673-681, 2003.
[3] J. Aslam, Q. Li, and R. Rus, “Three Power-Aware Routing Algorithms for Sensor Network,” Wireless Comm. and Mobile Computing, vol. 3, pp. 187-208, 2003.
[4] J. Chang and L. Tassiulas, “Routing for Maximum System Lifetime in Wireless Ad-Hoc Networks,” Proc. 37th Ann. Allerton Conf. Comm., Control, and Computing, Sept. 1999.
[5] J. Chang and L. Tassiluas, “Energy Conserving Routing in Wireless Ad-Hoc Networks,” Proc. IEEE INFOCOM, 2000.
[6] J. Chang and L. Tassiulas, “Fast Approximate Algorithms for Maximum Lifetime Routing in Wireless Ad-Hoc Networks,” Proc. IFIP-TC6 Networking 2000, pp. 702-713, 2000.
[7] C. Florens and R. McEliece, “Scheduling Algorithms for Wireless Ad-Hoc Sensor Networks,” Proc. IEEE GLOBECOM, pp. 6-10, 2002.
[8] M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, 1979.
[9] W. Heinzelman, A. Chandrakasan, and H. Balakrishnan, “Energy-Efficient Communication Protocol for Wireless Microsensor Networks,” Proc. IEEE Hawaii Int'l Conf. System Sciences (HICSS), 2000.
[10] R. Kannan, L. Ray, R. Kalidindi, and S. Iyengar, “Energy Threshold Constrained Geographic Routing Protocol for Wireless Sensor Networks,” Signal Processing Letters, vol. 1, no. 1, pp. 79-84, 2003.
[11] R. Kannan and S. Iyengar, “Game Theoretic Models for Reliable Path-Length and Energy Constrained Routing with Data Aggregation in Wireless Sensor Networks,” IEEE J. Selected Areas in Comm., vol. 22, no. 6, pp. 1141-1150, 2004.
[12] K. Kar, M. Kodialam, T. Lakshman, and L. Tassiulas, “Routing for Network Capacity Maximization in Energy-Constrained Ad-Hoc Networks,” Proc. IEEE INFOCOM 2003.
[13] M. Maleki, K. Dantu, and M. Pedram, “Power-Aware Source Routing Protocol for Mobile Ad Hoc Networks,” Proc. Int'l Symp. Low Power Electronics and Design (ISLPED '02), pp. 72-75, 2002.
[14] T. Melodia, D. Pompili, and I. Akyildiz, “Optimal Local Topology Knowledge for Energy Efficient Geographical Routing in Sensor Networks,” Proc. IEEE INFOCOM, 2004.
[15] A. Misra and S. Banerjee, “MRPC: Maximizing Network Lifetime for Reliable Routing in Wireless Environments,” Proc. IEEE Wireless Comm. and Networking Conf. (WCNC), 2002.
[16] S. Sahni, Data Structures, Algorithms, and Applications in Java, second ed. Silicon Press, 2005.
[17] S. Singh, M. Woo, and C. Raghavendra, “Power-Aware Routing in Mobile Ad Hoc Networks,” Proc. ACM/IEEE MOBICOM, 1998.
[18] A. Spyropoulos and C. Raghavendra, “Energy Efficient Communications in Ad Hoc Networks Using Directional Antenna,” Proc. IEEE INFOCOM, 2002.
[19] I. Stojmenovic and X. Lin, “Power-Aware Localized Routing in Wireless Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 12, no. 11, pp. 1122-1133, Nov. 2001.
[20] C. Toh, H. Cobb, and D. Scott, “Performance Evaluation of Battery-Life-Aware Routing Optimization Schemes for Wireless Ad Hoc Networks,” Proc. IEEE Int'l Computing Conf. (ICC '01), 2001.
[21] J. Wu, M. Gao, and I. Stojmenovic, “On Calculating Power-Aware Connected Dominating Sets for Efficient Routing in Ad Hoc Wireless Networks,” J. Comm. Networks, vol. 4, no. 1, pp. 59-70, 2002.
[22] G. Zussman and A. Segall, “Energy Efficient Routing in Ad Hoc Disaster Recovery Networks,” Proc. IEEE INFOCOM, 2003.

Index Terms:
Wireless sensor networks, lifetime maximization, online power-aware routing.
Citation:
Joongseok Park, Sartaj Sahni, "An Online Heuristic for Maximum Lifetime Routing in Wireless Sensor Networks," IEEE Transactions on Computers, vol. 55, no. 8, pp. 1048-1056, Aug. 2006, doi:10.1109/TC.2006.116
Usage of this product signifies your acceptance of the Terms of Use.