Linear Programming Approaches to Optimization Problems of Energy Efficiency inWireless Ad Hoc Networks

Abstract. The chapter introduces the applications of linear programming to optimization problems of energy efficiency in wireless ad hoc networks. According to the nature of applications, we classify them into four major categories: energy efficiency routing problems, broadcast/multicast routing problems, data extraction and gathering problems and QoS topology control problems. We focus on how linear programming techniques are used to solve these problems. We also discuss some of the experimental results.

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

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

[3]  Frank Thomson Leighton,et al.  Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms , 1999, JACM.

[4]  Chai-Keong Toh.  Maximum battery life routing to support ubiquitous mobile computing in wireless ad hoc networks , 2001 .

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

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

[7]  D. Griffel.  Linear programming 2: Theory and extensions , by G. B. Dantzig and M. N. Thapa. Pp. 408. £50.00. 2003 ISBN 0 387 00834 9 (Springer). , 2004, The Mathematical Gazette.

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

[9]  Bhaskar Krishnamachari,et al.  Maximizing Data Extraction in Energy-Limited Sensor Networks , 2005, Int. J. Distributed Sens. Networks.

[10]  Li Li,et al.  Distributed topology control for power efficient operation in multihop wireless ad hoc networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[11]  Chenxi Zhu,et al.  QoS routing for mobile ad hoc networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[12]  Baruch Awerbuch,et al.  Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks , 1994, STOC '94.

[13]  Lui Sha,et al.  Design and analysis of an MST-based topology control algorithm , 2003, IEEE Transactions on Wireless Communications.

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

[15]  Lui Sha,et al.  Design and analysis of an MST-based topology control algorithm , 2005, IEEE Trans. Wirel. Commun..

[16]  Archan Misra,et al.  Minimum energy paths for reliable communication in multi-hop wireless networks , 2002, MobiHoc '02.

[17]  Yuval Rabani,et al.  Linear Programming , 2007, Handbook of Approximation Algorithms and Metaheuristics.

[18]  Deying Li,et al.  QoS topology control in ad hoc wireless networks , 2004, IEEE INFOCOM 2004.

[19]  Anantha Chandrakasan,et al.  Bounding the lifetime of sensor networks via optimal role assignments , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[20]  Klara Nahrstedt,et al.  Distributed quality-of-service routing in ad hoc networks , 1999, IEEE J. Sel. Areas Commun..

[21]  Zhen Liu,et al.  Maximum lifetime routing in wireless ad-hoc networks , 2004, IEEE INFOCOM 2004.

[22]  Mahmoud Naghshineh,et al.  Conserving transmission power in wireless ad hoc networks , 2001, Proceedings Ninth International Conference on Network Protocols. ICNP 2001.

[23]  Mahtab Seddigh,et al.  Internal nodes based broadcasting in wireless networks , 2001, Proceedings of the 34th Annual Hawaii International Conference on System Sciences.

[24]  Sandeep K. S. Gupta,et al.  G-REMiT: An algorithm for building energy efficient multicast trees in wireless ad hoc networks , 2003, Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003..

[25]  Hai Liu,et al.  Energy Efficient Broadcast Routing in Static Ad Hoc Wireless Networks , 2004, IEEE Trans. Mob. Comput..

[26]  Oktay Günlük.  A New Min-Cut Max-Flow Ratio for Multicommodity Flows , 2007, SIAM J. Discret. Math..

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