Adaptive Broadcast Consumption (ABC), a New Heuristic and New Bounds for the Minimum Energy Broadcast Routing Problem

  • Ralf Klasing
  • Alfredo Navarra
  • Aris Papadopoulos
  • Stéphane Pérennes
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3042)


In this paper we present a new heuristic called Adaptive Broadcast Consumption (ABC for short) for the Minimum-Energy Broadcast Routing (MEBR) problem. We first investigate the problem trying to understand which are the main properties not taken into account by the classic and well-studied MST and BIP heuristics, then we propose a new algorithm proving that it computes the MEBR with an approximation ratio less than or equal to MST, for which we prove an approximation ratio of at most 12.15 instead of the well-known 12 [10]. Finally we present experimental results supporting our intuitive ideas, comparing ABC with other heuristics presented in the literature and showing its good performance on random instances even compared to the optimum.


Mobile Node Approximation Ratio Minimum Span Tree Multicast Tree Random Instance 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Banerjee, S., Misra, A., Yeo, J., and Agrawala, A. Energy-efficient broadcast and multicast trees for reliable wireless communication. In Proceedings of the 19th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM) (2000), IEEE Computer Society.Google Scholar
  2. 2.
    Cagalj, M., Hubaux, J. P., and Enz, C. Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues. In Proceedings of MOBICOM (2002), pp. 172–182.Google Scholar
  3. 3.
    Clementi, A., Crescenzi, P., Penna, P., Rossi, G., and Vocca, P. On the complexity of computing minimum energy consumption broadcast subgraph. In Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science (2001), vol. 2010, Lecture Notes in Computer Science, Springer-Verlag, pp. 121–131.Google Scholar
  4. 4.
    Clementi, A., Huiban, G., Penna, P., Rossi, G., and Verhoeven, Y. C On the approximation ratio of the mst-based heuristic for the energy-efficient broadcast problem in static ad-hoc radio networks. In Proceedings of the 3rd IEEE IP DP S Workshop on Wireless, Mobile and Ad Hoc Networks (WMAN) (2003), p. 222.Google Scholar
  5. 5.
    Clementi, A., Penna, P., and Silvestri, R. On the power assignment problem in radio networks. Mobile Networks and Applications (ACM MONET), Special Issue on Discrete Algorithms and Methods for Mobile Computing and Communications9 (2004), 125–140.CrossRefGoogle Scholar
  6. 6.
    Das, A. K., Markas, R. J., El-Sharkawai, M., Arabshahi, P., and Gray, A. Minimum energy broadcast trees for wireless networks: Integer programming formulations. In Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM) (2003), IEEE Computer Society.Google Scholar
  7. 7.
    Kashyap, A., Nishar, H., and Agarwal, P. Survey on unicast routing in mobile ad hoc networks,, 2003.Google Scholar
  8. 8.
    Rappaport, T. Wireless communications: principles and practice. Prentice-Hall, Englewood Cliffs, NY, 1996.Google Scholar
  9. 9.
    Rossi, G. The Range Assignment Problem in Static Ad-Hod Wireless Networks. PhD thesis, Université degli Studi di Siena, 2002.Google Scholar
  10. 10.
    Wan, P. J., Calinescu, G., Li, X., and Frieder, O. Minimum energy broadcast routing in static ad hoc wireless networks. Wireless Networks8 (2002), 607–617.CrossRefzbMATHGoogle Scholar
  11. 11.
    Wieselthier, J. E., Nguyen, G. D., and Ephremides, A. On the construction of energy-efficient broadcast and multicast trees in wireless networks. In Proceedings of the 19th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM) (2000), IEEE Computer Society, pp. 585–594.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Ralf Klasing
    • 1
  • Alfredo Navarra
    • 1
    • 2
  • Aris Papadopoulos
    • 1
    • 3
  • Stéphane Pérennes
    • 1
  1. 1.MASCOTTE projectI3S-CNRS/INRIA/Univ. NiceSophia AntipolisFrance
  2. 2.Computer Science DepartmentUniversity of L’AquilaItaly
  3. 3.Department of ComputingImperial College LondonUK

Personalised recommendations