research-article

An Online Heuristic for Maximum Lifetime Routing in Wireless Sensor Networks

Authors:

Joongseok Park,

Sartaj SahniAuthors Info & Claims

IEEE Transactions on Computers, Volume 55, Issue 8

Pages 1048 - 1056

https://doi.org/10.1109/TC.2006.116

Published: 01 August 2006 Publication History

Abstract

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.

References

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

Digital Library

[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]

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.

Digital Library

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

Digital Library

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

Digital Library

[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]

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.

Digital Library

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

Digital Library

[17]

S. Singh, M. Woo, and C. Raghavendra, “Power-Aware Routing in Mobile Ad Hoc Networks,” Proc. ACM/IEEE MOBICOM, 1998.

Digital Library

[18]

A. Spyropoulos and C. Raghavendra, “Energy Efficient Communications in Ad Hoc Networks Using Directional Antenna,” Proc. IEEE INFOCOM, 2002.

[19]

IEEE Trans. Parallel and Distributed Systems, vol. 12, no. 11, pp. 1122-1133, Nov. 2001.

Digital Library

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

Cited By

Sowmya GKiran M(2022)Improved Harmony Search Algorithm for Multihop Routing in Wireless Sensor NetworksJournal of Computer and Systems Sciences International10.1134/S106423072206016861:6(1058-1075)Online publication date: 1-Dec-2022
https://dl.acm.org/doi/10.1134/S1064230722060168
Lin CChin HLin WLu K(2022)Dynamic energy-efficient surveillance routing in uncertain group-based industrial wireless sensor networksWireless Networks10.1007/s11276-022-02984-028:6(2597-2608)Online publication date: 1-Aug-2022
https://dl.acm.org/doi/10.1007/s11276-022-02984-0
Jain AKhari MVerdú EOmatsu SCrespo R(2020)A route selection approach for variable data transmission in wireless sensor networksCluster Computing10.1007/s10586-020-03115-023:3(1697-1709)Online publication date: 1-Sep-2020
https://dl.acm.org/doi/10.1007/s10586-020-03115-0
Show More Cited By

Index Terms

An Online Heuristic for Maximum Lifetime Routing in Wireless Sensor Networks
1. Networks
  1. Network protocols
    1. Network layer protocols
      1. Routing protocols
  2. Network types
    1. Mobile networks
    2. Wireless access networks
2. Theory of computation

Recommendations

Maximizing the wireless sensor networks lifetime through energy efficient connected coverage

Wireless Sensor Network (WSN) is an emerging technology that is gaining much importance owing to its immense contribution in various day-to-day applications. A sensor is battery-operated, unattended low-cost device with limited computing, communication ...
Maximum lifetime continuous query processing in wireless sensor networks

Monitoring applications emerge as one of the most important applications of wireless sensor networks (WSNs). Such applications typically have long-running complex queries that are continuously evaluated over the sensor measurement streams. Due to the ...
Revisiting non-tree routing for maximum lifetime data gathering in wireless sensor networks
Abstract
Wireless sensor networks usually adopt a tree structure for routing, where each node sends and forwards messages to its parent. However, lifetime maximization with tree routing structure is NP-hard, and all algorithms attempting to find the ...

Comments

Information & Contributors

Information

Published In

cover image IEEE Transactions on Computers

IEEE Transactions on Computers Volume 55, Issue 8

August 2006

141 pages

ISSN:0018-9340

Issue’s Table of Contents

Copyright © 2006.

Publisher

IEEE Computer Society

United States

Publication History

Published: 01 August 2006

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

25
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 13 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Sowmya GKiran M(2022)Improved Harmony Search Algorithm for Multihop Routing in Wireless Sensor NetworksJournal of Computer and Systems Sciences International10.1134/S106423072206016861:6(1058-1075)Online publication date: 1-Dec-2022
https://dl.acm.org/doi/10.1134/S1064230722060168
Lin CChin HLin WLu K(2022)Dynamic energy-efficient surveillance routing in uncertain group-based industrial wireless sensor networksWireless Networks10.1007/s11276-022-02984-028:6(2597-2608)Online publication date: 1-Aug-2022
https://dl.acm.org/doi/10.1007/s11276-022-02984-0
Jain AKhari MVerdú EOmatsu SCrespo R(2020)A route selection approach for variable data transmission in wireless sensor networksCluster Computing10.1007/s10586-020-03115-023:3(1697-1709)Online publication date: 1-Sep-2020
https://dl.acm.org/doi/10.1007/s10586-020-03115-0
(2018)Novel lifetime routing metric for IEEE 802.11 wireless mesh networksInternational Journal of Ad Hoc and Ubiquitous Computing10.5555/3233110.323311128:1(1-12)Online publication date: 1-Jan-2018
https://dl.acm.org/doi/10.5555/3233110.3233111
S. KT. RK. M(2017)Multi-constraint multi-objective QoS aware routing heuristics for query driven sensor networks using fuzzy soft setsApplied Soft Computing10.1016/j.asoc.2016.10.01552:C(532-548)Online publication date: 1-Mar-2017
https://dl.acm.org/doi/10.1016/j.asoc.2016.10.015
Curry RSmith J(2016)A survey of optimization algorithms for wireless sensor network lifetime maximizationComputers and Industrial Engineering10.1016/j.cie.2016.08.028101:C(145-166)Online publication date: 1-Nov-2016
https://dl.acm.org/doi/10.1016/j.cie.2016.08.028
Zeng BDong Y(2016)An improved harmony search based energy-efficient routing algorithm for wireless sensor networksApplied Soft Computing10.1016/j.asoc.2015.12.02841:C(135-147)Online publication date: 1-Apr-2016
https://dl.acm.org/doi/10.1016/j.asoc.2015.12.028
Jain A(2016)Betweenness centrality based connectivity aware routing algorithm for prolonging network lifetime in wireless sensor networksWireless Networks10.1007/s11276-015-1054-522:5(1605-1624)Online publication date: 1-Jul-2016
https://dl.acm.org/doi/10.1007/s11276-015-1054-5
Kariman-Khorasani MPourmina M(2015)Maximum lifetime routing problem in asynchronous duty-cycled wireless sensor networksWireless Networks10.1007/s11276-015-0931-221:8(2501-2517)Online publication date: 1-Nov-2015
https://dl.acm.org/doi/10.1007/s11276-015-0931-2
Ghiyasvand MKeshtkar I(2015)Upper bounds for the min---max and min---sum cost online problems in wireless ad hoc networksWireless Networks10.1007/s11276-014-0811-121:3(757-768)Online publication date: 1-Apr-2015
https://dl.acm.org/doi/10.1007/s11276-014-0811-1
Show More Cited By

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents