Lifetime maximization for multicasting in energy-constrained wireless networks

We consider the problem of maximizing the lifetime of a given multicast connection in a wireless network of energy-constrained (e.g., battery-operated) nodes, by choosing ideal transmission power levels for the nodes relaying the connection. We distinguish between two basic operating modes: In a static power assignment, the power levels of the nodes are set at the beginning and remain unchanged until the nodes are depleted of energy. In a dynamic power schedule, the powers can be adjusted during operation. We show that while lifetime-maximizing static power assignments can be found in polynomial time, for dynamic schedules the problem becomes NP-hard. We introduce two approximation heuristics for the dynamic case, and experimentally verify that the lifetime of a dynamically adjusted multicast connection can be made several times longer than what can be achieved by the best possible static assignment.

[1]  Anthony Ephremides,et al.  Resource management in energy-limited, bandwidth-limited, transceiver-limited wireless networks for session-based multicasting , 2002, Comput. Networks.

[2]  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).

[3]  Charles E. Perkins,et al.  Ad Hoc Networking , 2001 .

[4]  Jean-Pierre Hubaux,et al.  Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues , 2002, MobiCom '02.

[5]  Madhav V. Marathe,et al.  Algorithmic Aspects of Topology Control Problems for Ad Hoc Networks , 2002, MobiHoc '02.

[6]  Radha Poovendran,et al.  Maximizing static network lifetime of wireless broadcast ad hoc networks , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[7]  Andrea E. F. Clementi,et al.  On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs , 2001, STACS.

[8]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[9]  Theodore S. Rappaport,et al.  Wireless communications - principles and practice , 1996 .

[10]  Anthony Ephremides,et al.  Algorithms for Energy-Efficient Multicasting in Static Ad Hoc Wireless Networks , 2001, Mob. Networks Appl..

[11]  Mohammad R. Salavatipour,et al.  Packing Steiner trees , 2003, SODA '03.

[12]  Giorgio Gambosi,et al.  Complexity and approximation: combinatorial optimization problems and their approximability properties , 1999 .

[13]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[14]  Teresa H. Y. Meng,et al.  Minimum energy mobile wireless networks , 1999, IEEE J. Sel. Areas Commun..

[15]  Weifa Liang,et al.  Constructing minimum-energy broadcast trees in wireless ad hoc networks , 2002, MobiHoc '02.

[16]  Qun Li,et al.  Online power-aware routing in wireless Ad-hoc networks , 2001, MobiCom '01.

[17]  Robert Krauthgamer,et al.  Polylogarithmic inapproximability , 2003, STOC '03.

[18]  Mohammad R. Salavatipour,et al.  Hardness and Approximation Results for Packing Steiner Trees , 2004, ESA.

[19]  Ram Ramanathan,et al.  Topology control of multihop wireless networks using transmit power adjustment , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[20]  R. Dorf,et al.  The handbook of ad hoc wireless networks , 2003 .

[21]  Jochen Könemann,et al.  Faster and simpler algorithms for multicommodity flow and other fractional packing problems , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[22]  Sudipto Guha,et al.  Approximation algorithms for directed Steiner problems , 1999, SODA '98.

[23]  Andrzej Pelc,et al.  Power consumption in packet radio networks , 2000, Theor. Comput. Sci..

[24]  Anthony Ephremides,et al.  Energy-Efficient Broadcast and Multicast Trees in Wireless Networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[25]  R.J. Marks,et al.  Maximizing lifetime in an energy constrained wireless sensor array using team optimization of cooperating systems , 2002, Proceedings of the 2002 International Joint Conference on Neural Networks. IJCNN'02 (Cat. No.02CH37290).

[26]  Ioannis Caragiannis,et al.  A logarithmic approximation algorithm for the minimum energy consumption broadcast subgraph problem , 2003, Inf. Process. Lett..

[27]  Xiang-Yang Li,et al.  Minimum-Energy Broadcasting in Static Ad Hoc Wireless Networks , 2002, Wirel. Networks.

[28]  Arindam Kumar Das,et al.  Minimum power broadcast trees for wireless networks: integer programming formulations , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[29]  Robert J. Marks,et al.  Minimum power broadcast trees for wireless networks: optimizing using the viability lemma , 2002, 2002 IEEE International Symposium on Circuits and Systems. Proceedings (Cat. No.02CH37353).

[30]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

[31]  Ivan Stojmenovic,et al.  Handbook of Wireless Networks and Mobile Computing , 2002 .

[32]  Leonidas Georgiadis,et al.  Energy-aware Broadcasting in Wireless Networks , 2003 .

[33]  Gruia Calinescu,et al.  Network Lifetime and Power Assignment in ad hoc Wireless Networks , 2003, ESA.

[34]  Sandeep K. S. Gupta,et al.  Extending the Lifetime of Multicast Trees in WANETs , 2004, J. Inf. Sci. Eng..

[35]  Rajmohan Rajaraman,et al.  Topology control and routing in ad hoc networks: a survey , 2002, SIGA.

[36]  Pekka Orponen,et al.  Multicast time maximization in energy constrained wireless networks , 2003, DIALM-POMC '03.