Maximum Lifetime Routing In Wireless Sensor Networks ∗

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 develop also 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]  Sartaj Sahni,et al.  Data Structures, Algorithms and Applications in Java , 1998 .

[2]  Leandros Tassiulas,et al.  Routing for Maximum System Lifetime in Wireless Ad-hoc Networks , 1999 .

[3]  Leandros Tassiulas,et al.  Energy conserving routing in wireless ad-hoc networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[4]  Ivan Stojmenovic,et al.  Power-aware localized routing in wireless networks , 2000, Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000.

[5]  Leandros Tassiulas,et al.  Fast Approximate Algorithms for Maximum Lifetime Routing in Wireless Ad-hoc Networks , 2000, NETWORKING.

[6]  Wendi Heinzelman,et al.  Energy-efficient communication protocol for wireless microsensor networks , 2000, Proceedings of the 33rd Annual Hawaii International Conference on System Sciences.

[7]  S. M. Heemstra de Groot,et al.  Power-aware routing in mobile ad hoc networks , 1998, MobiCom '98.

[8]  I. Stojmenovic,et al.  On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks , 2001, Journal of Communications and Networks.

[9]  Archan Misra,et al.  MRPC: maximizing network lifetime for reliable routing in wireless environments , 2002, 2002 IEEE Wireless Communications and Networking Conference Record. WCNC 2002 (Cat. No.02TH8609).

[10]  Karthik Dantu,et al.  Power-aware source routing protocol for mobile ad hoc networks , 2002, ISLPED '02.

[11]  Cauligi S. Raghavendra,et al.  Energy efficient communications in ad hoc networks using directional antennas , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[12]  Robert J. McEliece,et al.  Scheduling algorithms for wireless ad-hoc sensor networks , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[13]  Leandros Tassiulas,et al.  Routing for network capacity maximization in energy-constrained ad-hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[14]  Gil Zussman,et al.  Energy efficient routing in ad hoc disaster recovery networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[15]  Qun Li,et al.  Three power-aware routing algorithms for sensor networks , 2003, Wirel. Commun. Mob. Comput..

[16]  S. Sitharama Iyengar,et al.  Game-theoretic models for reliable path-length and energy-constrained routing with data aggregation in wireless sensor networks , 2004, IEEE Journal on Selected Areas in Communications.

[17]  Dario Pompili,et al.  Optimal local topology knowledge for energy efficient geographical routing in sensor networks , 2004, IEEE INFOCOM 2004.