Skip to main content
SpringerLink
Log in

3-D Minimum Energy Broadcasting

  • Conference paper
Structural Information and Communication Complexity (SIROCCO 2006)

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

Abstract

The Minimum Energy Broadcast Routing problem was extensively studied during the last years. Given a sample space where wireless devices are distributed, the aim is to perform the broadcast pattern of communication from a given source while minimizing the total energy consumption. While many papers deal with the 2-dimensional case where the sample space is given by a flat area, few results are known about the more interesting and practical 3-dimensional case. In this paper we study such a case and we present a tighter analysis of the minimum spanning tree heuristic in order to considerably decrease its approximation factor from the known 26 to roughly 18.8. This decreases the gap with the known lower bound of 12 given by the so called kissing number.

Work supported by the European project COST Action 293, “Graphs and Algorithms in Communication Networks” (GRAAL).

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

Access this chapter

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Wieselthier, J.E., Nguyen, G.D., 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), pp. 585–594. IEEE Computer Society Press, Los Alamitos (2000)

    Google Scholar 

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

    Chapter  Google Scholar 

  3. Clementi, A.E.F., Ianni, M.D., Silvestri, R.: The minimum broadcast range assignment problem on linear multi-hop wireless networks. Theoretical Computer Science 299(1-3), 751–761 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  4. Clementi, A.E.F., 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 

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

    Chapter  Google Scholar 

  6. 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 (2004) (to appear on the associated Special Issue of Algorithmica)

    Google Scholar 

  7. Flammini, M., Navarra, A., Perennes, S.: The “Real” approximation factor of the MST heuristic for the Minimum Energy Broadcasting. In: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, vol. 3503, pp. 22–31. Springer, Heidelberg (2005) (to appear on the associated Special Issue of Journal of Experimental Algorithmics)

    Google Scholar 

  8. Klasing, R., Navarra, A., Papadopoulos, A., Pérénnes, 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)

    Chapter  Google Scholar 

  9. Navarra, A.: 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), pp. 313–322 (2005)

    Google Scholar 

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

    Article  MATH  Google Scholar 

  11. Liang, W.: Constructing minimum-energy broadcast trees in wireless ad hoc networks. In: Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking and computing (MOBIHOC), pp. 112–122 (2002)

    Google Scholar 

  12. Conway, J.H., Sloane, N.J.A.: The Kissing Number Problem and Bounds on Kissing Numbers. In: Sphere Packings, Lattices, and Groups, Ch. 2.1 and Ch. 13, 3rd edn., Springer, New York (1998)

    Google Scholar 

  13. Frieze, A.M., McDiarmid, C.J.H.: On Random Minimum Length Spanning Trees. Combinatorica 9, 363–374 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  14. Attali, D., Boissonnat, J.D.: A linear bound on the complexity of the delaunay triangulation of points on polyhedral surfaces. In: Proceedings of the 7th ACM symposium on Solid modeling and applications (SMA), pp. 139–146 (2002)

    Google Scholar 

  15. Fang, T.P., Piegl, L.A.: Delaunay triangulation in three dimensions. IEEE Computer Graphics and Applications 15(5), 62–69 (1995)

    Article  Google Scholar 

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

    Chapter  Google Scholar 

  17. Penna, P., Ventre, C.: Energy-efficient broadcasting in ad-hoc networks: combining msts with shortest-path trees. In: Proceedings of the 1st ACM International Workshop on Performance Evaluation of Wireless, Ad Hoc, Sensor and Ubiquitous Networks (PE-WASUN), pp. 61–68 (2004)

    Google Scholar 

  18. Yuan, D.: 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), pp. 323–331 (2005)

    Google Scholar 

  19. Clementi, A., Huiban, G., Penna, P., Rossi, G., 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 IPDPS Workshop on Wireless, Mobile and Ad Hoc Networks (WMAN), p. 222 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, University of L’Aquila, Via Vetoio, I-67100, L’Aquila, Italy

    Alfredo Navarra

Authors
  1. Alfredo Navarra
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. SITE, University of Ottawa, Canada

    Paola Flocchini

  2. Department of Computer Science, University of Liverpool, L69 3BX, Liverpool, UK

    Leszek Gąsieniec

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Navarra, A. (2006). 3-D Minimum Energy Broadcasting. In: Flocchini, P., Gąsieniec, L. (eds) Structural Information and Communication Complexity. SIROCCO 2006. Lecture Notes in Computer Science, vol 4056. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11780823_19

Download citation

  • DOI: https://doi.org/10.1007/11780823_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-35474-1

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation