Tighter bounds for the minimum energy broadcasting problem

In this paper we present a new upper bound on the approximation ratio of the minimum spanning tree heuristic for the basic problem on ad-hoc networks given by the minimum-energy broadcast routing (MEBR) problem. We introduce a new analysis allowing to establish a 6.33-approximation ratio in the 2-dimensional case, thus decreasing the previously known 7.6 upper bound (M. Flammini et al., 2004).

[1]  Andrea E. F. Clementi,et al.  On the approximation ratio of the MST based heuristic for the energy-efficient broadcast problem in static ad-hoc radio networks , 2003, Proceedings International Parallel and Distributed Processing Symposium.

[2]  Xiang-Yang Li,et al.  Minimum-energy broadcast routing in static ad hoc wireless networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

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

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

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

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

[7]  Stéphane Pérennes,et al.  Improved Approximation Results for the Minimum Energy Broadcasting Problem , 2004, DIALM-POMC '04.

[8]  Stéphane Pérennes,et al.  Adaptive Broadcast Consumption (ABC), a New Heuristic and New Bounds for the Minimum Energy Broadcast Routing Problem , 2004, NETWORKING.