Skip to main content
SpringerLink
Log in

Tightening the upper bound for the minimum energy broadcasting

  • Published:
Wireless Networks Aims and scope Submit manuscript

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].

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  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.

  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).

  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.

  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.

  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.

  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.

  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.

  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.

  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.

  10. T. Rappaport, Wireless Communications: Principles and Practice (Prentice-Hall, Englewood Cliffs, NY, 1996).

    Google Scholar 

  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. 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.

  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.

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, University of L’Aquila, L’Aquila, Italy

    Michele Flammini & Alfredo Navarra

  2. LaBRI - Université Bordeaux 1- CNRS, 351 cours de la Libération, 33405, Talence Cedex, France

    Ralf Klasing

  3. MASCOTTE project I3S-CNRS/INRIA/University of Nice–Sophia Antipolis, Talence Cedex, France

    Stephane Perennes

Authors
  1. Michele Flammini
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ralf Klasing
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Alfredo Navarra
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Stephane Perennes
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alfredo Navarra.

Additional information

Preliminary results concerning this paper appeared in [9].

Michele Flammini received the degree in Computer Science at the University of L’Aquila in 1990 and the Ph.D. degree in Computer Science at the University of Rome “La Sapienza” in 1995. He is full professor at the Computer Science Department of the University of L’Aquila since March 2005. His research interests include algorithms and computational complexity, game theory, communication problems in interconnection networks and routing. He has authored and co-authored more than 70 papers in his fields of interest published in the most reputed international conferences and journals.

Ralf Klasing received the PhD degree from the University of Paderborn in 1995. From 1995 to 1997, he was an Assistant Professor at the University of Kiel. From 1997 to 1998, he was a Research Fellow at the University of Warwick. From 1998 to 2000, he was an Assistant Professor at RWTH Aachen. From 2000 to 2002, he was a Lecturer at King’s College London. In 2002, he joined the CNRS as a permanent researcher. From 2002 to 2005, he was affiliated to the laboratory I3S in Sophia Antipolis. Currently, he is affiliated to the laboratory LaBRI in Bordeaux. He has co-authored a Springer Monograph, a book chapter, and has published more than 40 papers in refereed international periodicals. His research interests include Communication Algorithms in Networks, Approximation Algorithms for Combinatorially Hard Problems, Web Graphs and Web Algorithms, and Optimization Problems in Ad-Hoc Wireless Networks.

Alfredo Navarra received the degree in Computer Science at the University of L’Aquila in 2000 and the Ph.D. degree in Computer Science at the University of Rome “La Sapienza” in 2004. From 2003 to 2004, he joined the MASCOTTE project team at the INRIA institute of Sophia Antipolis as PhD student and PostDoc for almost two years. In 2005, he was a temporary researcher at the University of L’Aquila. In 2006, he joined the laboratory LaBRI in Bordeaux as PostDoc. His research interests include, algorithms and computational complexity, communication, modelling as well as analysis and experimentation problems on protocols and routing algorithms for interconnaction networks such as Ad Hoc, Wireless, Mobile and Sensor Networks. He has authored and co-authored more than 25 papers in his fields of interest published in the most reputed international conferences and journals.

Stéphane Pérennes is a permanent researcher of the French Centre National de la Recherche Scientifique (CNRS). He is affiliated to the MASCOTTE project team at the Institut National de Recherche en Informatique et Automatique (INRIA) of Sophia Antipolis. He has authored and co-authored more than 70 papers in his fields of interest that vary from pure theoretical to applied issues on algorithms and complexity, networking and routing.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Flammini, M., Klasing, R., Navarra, A. et al. Tightening the upper bound for the minimum energy broadcasting. Wireless Netw 14, 659–669 (2008). https://doi.org/10.1007/s11276-006-0007-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-006-0007-4

Keywords

Search

Navigation