Wireless Networks

, Volume 14, Issue 5, pp 659–669 | Cite as

Tightening the upper bound for the minimum energy broadcasting

  • Michele Flammini
  • Ralf Klasing
  • Alfredo Navarra
  • Stephane Perennes
Article

Abstract

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). 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 [4], almost closing the gap with the lower bound of 6 [12].

Keywords

Minimums panning tree Approximation factor Multi-hop Ad hoc networks 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    A. Clementi, P. Crescenzi, P. Penna, G. Rossi and P. Vocca, On the complexity of computing minimum energy consumption broadcast subgraph, in: Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS), vol. 2010 of Lecture Notes in Computer Science, Springer-Verlag, (2001) pp. 121–131.Google Scholar
  2. 2.
    A. Clementi, G. Huiban, P. Penna, G. Rossi and Y.C. Verhoeven, 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 IPDPS Workshop on Wireless, Mobile and Ad Hoc Networks (WMAN) (2003).Google Scholar
  3. 3.
    A.K. Das, R.J. Markas, M. El-Sharkawai, P. Arabshahi and A. Gray, 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), vol. 2, IEEE Computer Society, (2003) pp. 1001–1010.Google Scholar
  4. 4.
    M. Flammini, R. Klasing, A. Navarra and S. Perennes, Improved approximation results for the minimum energy broadcasting problem, in: Proceedings of ACM Joint Workshop on Foundations of Mobile Computing (DIALM-POMC) (2004) pp. 85–91.Google Scholar
  5. 5.
    M. Flammini, A. Navarra and S. Perennes, The “Real” approximation factor of the MST heuristic for the minimum energy broadcasting, in: Proceedings of the 4th International Workshop on Efficient and Experimental Algorithms (WEA), vol. 3503 of Lecture Notes in Computer Science, Springer Verlag, (2005) pp. 22–31.Google Scholar
  6. 6.
    I. Kang and R. Poovendran Iterated local optimization for minimum energy broadcast, in: Proceedings of the 3rd International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt) (2005) pp. 332–341.Google Scholar
  7. 7.
    R. Klasing, A. Navarra, A. Papadopoulos and S. Perennes, Adaptive broadcast consumption (ABC), a new heuristic and new bounds for the minimum energy broadcast routing problem, in: Proceedings of the 3rd IFIP-TC6 International Networking Conference, Vol. 3042 of Lecture Notes in Computer Science, Springer Verlag, (2004) pp. 866–877.Google Scholar
  8. 8.
    F. Li and I. Nikolaidis, On minimum-energy broadcasting in all-wireless networks, in: Proceedings of the 26th Annual IEEE Conference on Local Computer Networks (LCN) (2001), IEEE Computer Society, (2001) p. 193.Google Scholar
  9. 9.
    A. Navarra, Tighter bounds for the minimum energy broadcasting problem, in: Proceedings of the 3rd International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt) (2005), pp. 313–322.Google Scholar
  10. 10.
    T. Rappaport, Wireless Communications: Principles and Practice (Prentice-Hall, Englewood Cliffs, NY, 1996).Google Scholar
  11. 11.
    P.J. Wan, G. Calinescu, X. Li, and O. Frieder, Minimum energy broadcast routing in static ad hoc wireless networks, Wireless Networks 8 6 (2002), 607–617.Google Scholar
  12. 12.
    J.E. Wieselthier, G.D. Nguyen and A. Ephremides, 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), IEEE Computer Society, (2000), pp. 585–594.Google Scholar
  13. 13.
    D. Yuan, Computing optimal or near-optimal trees for minimum-energy broadcasting in wireless networks, in: Proceedings of the 3rd International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt) (2005), pp. 323–331.Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2006

Authors and Affiliations

  • Michele Flammini
    • 1
  • Ralf Klasing
    • 2
  • Alfredo Navarra
    • 1
  • Stephane Perennes
    • 3
  1. 1.Computer Science DepartmentUniversity of L’AquilaL’AquilaItaly
  2. 2.LaBRI - Université Bordeaux 1- CNRS, 351 cours de la LibérationTalence CedexFrance
  3. 3.MASCOTTE project I3S-CNRS/INRIA/University of Nice–Sophia AntipolisTalence CedexFrance

Personalised recommendations