Experimental Comparison of Algorithms for Energy-Efficient Multicasting in Ad Hoc Networks

Energy is a scarce resource in ad hoc wireless networks and it is of paramount importance to use it efficiently when establishing communication patterns. In this work we study algorithms for computing energy-efficient multicast trees in ad hoc wireless networks. Such algorithms either start with an empty solution which is gradually augmented to a multicast tree (augmentation algorithms) or take as input an initial multicast tree and ’walk’ on different multicast trees for a finite number of steps until some acceptable decrease in energy consumption is achieved (local search algorithms).

[1]  R. Ravi,et al.  A nearly best-possible approximation algorithm for node-weighted Steiner trees , 1993, IPCO.

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

[3]  Ivan Stojmenovic,et al.  Localized minimum-energy broadcasting in ad-hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[4]  Anthony Ephremides,et al.  On the construction of 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).

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

[6]  Vikas P. Verma,et al.  Dip3s: a Distributed Routing Algorithm for Power-conserving Broadcasting in Wireless Ad Hoc Networks , 2003, MWCN.

[7]  Andrea E. F. Clementi,et al.  The minimum broadcast range assignment problem on linear multi-hop wireless networks , 2003, Theor. Comput. Sci..

[8]  Andrzej Pelc,et al.  Deterministic Rendezvous in Graphs , 2003 .

[9]  Samir Khuller,et al.  Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets , 1998, FSTTCS.

[10]  Ioannis Caragiannis,et al.  Energy-Efficient Wireless Network Design , 2005, Theory of Computing Systems.

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

[12]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

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

[14]  Hung Q. Ngo,et al.  MIP3S: algorithms for power-conserving multicasting in static wireless ad hoc networks , 2003, The 11th IEEE International Conference on Networks, 2003. ICON2003..

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

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

[17]  Ioannis Caragiannis,et al.  New Results for Energy-Efficient Broadcasting in Wireless Networks , 2002, ISAAC.