Abstract
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.
Work supported by the European projects RTN ARACNE and 1ST FET CRESCCO, by the French MASCOTTE project I3S-CNRS/INRIA/University of Nice, Sophia Antipolis and by the Italian project RE AL-WINE.
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
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.
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.
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.
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.
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.
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.
Kashyap, A., Nishar, H., and Agarwal, P. Survey on unicast routing in mobile ad hoc networks, http://citeseer.nj.nec.com/481660.html, 2003.
Rappaport, T. Wireless communications: principles and practice. Prentice-Hall, Englewood Cliffs, NY, 1996.
Rossi, G. The Range Assignment Problem in Static Ad-Hod Wireless Networks. PhD thesis, Université degli Studi di Siena, 2002.
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.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Klasing, R., Navarra, A., Papadopoulos, A., Pérennes, S. (2004). Adaptive Broadcast Consumption (ABC), a New Heuristic and New Bounds for the Minimum Energy Broadcast Routing Problem. In: Mitrou, N., Kontovasilis, K., Rouskas, G.N., Iliadis, I., Merakos, L. (eds) Networking 2004. NETWORKING 2004. Lecture Notes in Computer Science, vol 3042. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24693-0_71
Download citation
DOI: https://doi.org/10.1007/978-3-540-24693-0_71
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21959-0
Online ISBN: 978-3-540-24693-0
eBook Packages: Springer Book Archive