Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Automata, Languages, and Programming

ICALP 2007: Automata, Languages and Programming pp 447–458Cite as

An Exponential Improvement on the MST Heuristic for Minimum Energy Broadcasting in Ad Hoc Wireless Networks

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4596))

Abstract

In this paper we present a new approximation algorithm for the Minimum Energy Broadcast Routing (MEBR) problem in ad hoc wireless networks that has exponentially better approximation factor than the well-known Minimum Spanning Tree (MST) heuristic. Namely, for any instance where a minimum spanning tree of the set of stations is guaranteed to cost at most ρ times the cost of an optimal solution for MEBR, we prove that our algorithm achieves an approximation ratio bounded by 2ln ρ − 2 ln 2 + 2. This result is particularly relevant for its consequences on Euclidean instances where we significantly improve previous results.

This work was partially supported by the EU COST Action 293 “Graphs and Algorithms in Communication Networks” (GRAAL) and by the EU IST FET Integrated Project 015964 AEOLUS.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ambühl, C.: An optimal bound for the MST algorithm to compute energy efficient broadcast trees in wireless networks. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1139–1150. Springer, Heidelberg (2005)

    Google Scholar 

  2. Athanassopoulos, S., Caragiannis, I., Kaklamanis, C., Kanellopoulos, P.: Experimental comparison of algorithms for energy-efficient multicasting in ad hoc networks. In: Nikolaidis, I., Barbeau, M., Kranakis, E. (eds.) ADHOC-NOW 2004. LNCS, vol. 3158, pp. 183–196. Springer, Heidelberg (2004)

    Google Scholar 

  3. Čagalj, M., Hubaux, J., Enz, C.: Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues. In: MobiCom 2002. Proceedings of the 8th Annual International Conference on Mobile Computing and Networking, pp. 172–182. ACM Press, New York (2002)

    Chapter  Google Scholar 

  4. Calinescu, G., Kapoor, S., Olshevsky, A., Zelikovsky, A.: Network lifetime and power assignment in ad-hoc wireless networks. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 114–126. Springer, Heidelberg (2003)

    Google Scholar 

  5. Calinescu, G., Mandoiu, I., Zelikovsky, A.: Symmetric connectivity with minimum power consumption in radio networks. In: Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science, pp. 119–130. Kluwer, BV, Dordrecht (2002)

    Google Scholar 

  6. Caragiannis, I., Kaklamanis, C., Kanellopoulos, P.: New results for energy-efficient broadcasting in wireless networks. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol. 2518, pp. 332–343. Springer, Heidelberg (2002)

    Google Scholar 

  7. Caragiannis, I., Kaklamanis, C., Kanellopoulos, P.: Energy-efficient wireless network design. Theory of Computing Systems 39(5), 593–617 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  8. Cartigny, J., Simplot, D., Stojmenovic, I.: Localized minimum-energy broadcasting in ad-hoc networks. In: INFOCOM 2003. Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 3, pp. 2210–2217. IEEE Computer Society Press, Los Alamitos (2003)

    Google Scholar 

  9. Clementi, A., Crescenzi, P., Penna, P., Rossi, G., Vocca, P.: On the complexity of computing minimum energy consumption broadcast subgraphs. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol. 2010, pp. 121–131. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  10. Conway, J.H., Sloane, N.J.A.: The kissing number proble and Bounds on kissing numbers (Ch. 2.1 and Ch. 13). In: Sphere Packings, Lattices, and Groups, 3rd edn. Springer, New York (1998)

    Google Scholar 

  11. Dong, Q., Banerjee, S., Adler, M., Misra, A.: Minimum energy reliable paths using unreliable wireless links. In: MobiHoc 2005. Proceedings of the 6th ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp. 449–459. ACM Press, New York (2005)

    Chapter  Google Scholar 

  12. Doshi, S., Bhandare, S., Brown, T.X.: An on-demand minimum energy routing protocol for a wireless ad hoc network. SIGMOBILE Mobile Computing and Communication Review 6(3), 50–66 (2002)

    Article  Google Scholar 

  13. Flammini, M., Klasing, R., Navarra, A., Perennes, S.: Improved approximation results for the minimum energy broadcasting problem. In: Proceedings of ACM Joint Workshop on Foundations of Mobile Computing (DIALM-POMC), pp. 85–91. ACM Press, New York (2004)

    Chapter  Google Scholar 

  14. Flammini, M., Navarra, A., Perennes, S.: The ‘real’ approximation factor of the MST heuristic for the minimum energy broadcasting. ACM Journal of Experimental Algorithmics 11(Article no.2.10), 1–13 (2006)

    MathSciNet  Google Scholar 

  15. Gilbert, E., Pollak, H.: Steiner minimal trees. SIAM Journal on Applied Mathematics 16, 1–29 (1968)

    Article  MATH  MathSciNet  Google Scholar 

  16. Hac, A.: Wireless sensor network designs. John Wiley & Sons, Ltd, West Sussex, England (2004)

    Google Scholar 

  17. Kirousis, L., Kranakis, E., Krizanc, D., Pelc, A.: Power consumption in packet radio networks. Theoretical Computer Science 243(1-2), 289–305 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  18. Klasing, R., Navarra, A., Papadopoulos, A., Perennes, S.: Adaptive broadcast consumption (ABC), a new heuristic and new bounds for the minimum energy broadcast routing problem. In: Mitrou, N.M., Kontovasilis, K., Rouskas, G.N., Iliadis, I., Merakos, L. (eds.) NETWORKING 2004. LNCS, vol. 3042, pp. 866–877. Springer, Heidelberg (2004)

    Google Scholar 

  19. Li, X., Wan, P.: Constructing minimum energy mobile wireless networks. SIGMOBILE Mobile Computing and Communication Review 5(4), 55–67 (2001)

    Article  Google Scholar 

  20. Liang, W.: Constructing minimum-energy broadcast trees in wireless ad hoc networks. In: MobiHoc 2002. Proceedings of the 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp. 112–122. ACM Press, New York (2002)

    Chapter  Google Scholar 

  21. Navarra, A.: 3-d minimum energy broadcasting. In: Flocchini, P., Gąsieniec, L. (eds.) SIROCCO 2006. LNCS, vol. 4056, pp. 240–252. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  22. Rappaport, T.: Wireless communications: principles and practice. Prentice-Hall, Englewood Cliffs (1996)

    Google Scholar 

  23. Wan, P.-J., Calinescu, G., Li, X., Frieder, O.: Minimum energy broadcast routing in static ad hoc wireless networks. Wireless Networks 8(6), 607–617 (2002)

    Article  MATH  Google Scholar 

  24. Wieselthier, J.-E., Nguyen, G.D., Ephremides, A.: On the construction of energy-efficient broadcast and multicast trees in wireless networks. In: INFOCOM 2000. Proceedings of the 19th Annual Joint Conference of the IEEE Computer and Communications Societies, pp. 585–594. IEEE Computer Society Press, Los Alamitos (2000)

    Google Scholar 

  25. Zhao, F., Guibas, L.: Wireless sensor networks: an information processing approach. Morgan Kaufmann, San Francisco (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Research Academic Computer Technology Institute and, Dept. of Computer Engineering and Informatics, University of Patras, 26500 Rio, Greece

    Ioannis Caragiannis

  2. Dipartimento di Informatica, Università di L’Aquila, Via Vetoio, Coppito 67100, L’Aquila, Italy

    Michele Flammini & Luca Moscardelli

Authors
  1. Ioannis Caragiannis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michele Flammini
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Luca Moscardelli
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Lars Arge Christian Cachin Tomasz Jurdziński Andrzej Tarlecki

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Caragiannis, I., Flammini, M., Moscardelli, L. (2007). An Exponential Improvement on the MST Heuristic for Minimum Energy Broadcasting in Ad Hoc Wireless Networks. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds) Automata, Languages and Programming. ICALP 2007. Lecture Notes in Computer Science, vol 4596. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73420-8_40

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-73420-8_40

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-73419-2

  • Online ISBN: 978-3-540-73420-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation