Skip to main content
Springer Nature Link
Log in

Energy Consumption Minimization in Ad Hoc Wireless and Multi-interface Networks

  • Chapter
  • First Online:
Graphs and Algorithms in Communication Networks

Part of the book series: Texts in Theoretical Computer Science. An EATCS Series ((TTCS))

  • 1477 Accesses

Abstract

This chapter deals with energy consumption issues in wireless networks. In such networks, energy is a scarce resource and, hence, it must be used efficiently. Under these circumstances, we consider two interesting combinatorial optimization problems: Minimum Energy Broadcast Routing and Cost Minimization in Multi-interface Networks. The goal of the first problem is to perform broadcasting from a given source while minimizing the overall energy required for communication. The second problem refers to the choice of activating a set of available communication interfaces at the network nodes in order to satisfy the required connections in a wireless multi-interface network with minimum total cost. While Minimum Energy Broadcast Routing has been studied extensively during recent years, Cost Minimization in Multi-interface Networks is rather new. For both problems we survey recent complexity results and approximation algorithms under different assumptions.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
€32.70 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
EUR 29.95
Price includes VAT (France)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
EUR 117.69
Price includes VAT (France)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
EUR 158.24
Price includes VAT (France)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
EUR 158.24
Price includes VAT (France)
  • Durable hardcover 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.

Similar content being viewed by others

References

  1. Ambühl, C.: An optimal bound for the MST algorithm to compute energy efficient broadcast trees in wireless networks. In: Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP), LNCS 3580, Springer, pp. 1139–1150, 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: Proceedings of the 3rd International Conference on Ad Hoc Networks & Wireless (ADHOC NOW), LNCS 3158, Springer, pp. 183-196, 2004

    Google Scholar 

  3. Ausiello, G., D’Atri, A., Protasi, M.: Structure preserving reductions among convex optimization problems. Journal of Computer and System Sciences, 21(1):136–153, 1980

    Article  MATH  MathSciNet  Google Scholar 

  4. Barsi, F., Navarra, A., Pinotti, M. C.: Cheapest Path in Multi-Interface Networks. In: Proceedings of the 10th International Conference on Distributed Computing and Networking (ICDCN), LNCS, Springer, 2009

    Google Scholar 

  5. Biló, V., Flammini, M., Melideo, G., Moscardelli, L., Navarra, A.: Sharing the cost of multicast transmissions in euclidean and general wireless networks. Theoretical Computer Science, 369(1-3):269–284, 2006

    Article  MATH  MathSciNet  Google Scholar 

  6. Brooks, R. L.: On coloring the nodes of a network. In: Proceedings of Cambridge Philosophical Society, 37:194–197, 1941

    Article  MathSciNet  Google Scholar 

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

    Google Scholar 

  8. Cai, H., Zhao, Y.: On approximation ratios of minimum-energy multicast routing in wireless networks. Journal of Combinatorial Optimization, 9(3):243–262, 2005

    Article  MATH  MathSciNet  Google Scholar 

  9. Calinescu, G., Kapoor, S., Olshevsky, A., Zelikovsky, A.: Network lifetime and power assignment in adhoc wireless networks. In: Proceedings of the 11th Annual European Symposium on Algorithms (ESA), LNCS 2832, Springer, pp. 114–126, 2003

    Google Scholar 

  10. Caporuscio, M., Carzaniga, A., Wolf, A. L.: Design and evaluation of a support service for mobile, wireless publish/subscribe applications. IEEE Transactions on Software Engineering, 29(12):1059–1071, 2003

    Article  Google Scholar 

  11. Caporuscio, M., Charlet, D., Issarny, V., Navarra, A.: Energetic Performance of Service-oriented Multi-radio Networks: Issues and Perspectives. In: Proceedings of the 6th International Workshop on Software and Performance (WOSP), pp. 42–45. ACM Press, 2007

    Google Scholar 

  12. Caragiannis, I., Flammini, M., Moscardelli, L.: An exponential improvement on the mst heuristic for minimum energy broadcasting in ad hoc wireless networks. In: Proceedings of the 34th International Colloquium on Automata, Languages and Programming (ICALP), LNCS 4596, Springer, pp. 447–458, 2007

    Google Scholar 

  13. Caragiannis, I., Kaklamanis, C., Kanellopoulos, P.: New results for energy-efficient broadcasting in wireless networks. In: Proceedings of the 13th International Symposium on Algorithms and Computation (ISAAC), LNCS 2518, Springer, pp. 332–343, 2002

    Google Scholar 

  14. Caragiannis, I., Kaklamanis, C., Kanellopoulos, P.: A logarithmic approximation algorithm for the minimum energy consumption broadcast subgraph problem. Information Processing Letters, 86(3):149–154, 2003

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  17. Chvátal, V.: A greedy heuristic for the set-covering problem. Mathematics of Operations Research, 4(3):233–235, 1979

    Article  MATH  MathSciNet  Google Scholar 

  18. Cilibrasi, R., Lotker, Z., Navarra, A., Perennes, S., Vitanyi, P.: About the lifespan of peer to peer networks. In: Proceedings of the 10th International Conference On Principles Of Distributed Systems (OPODIS), LNCS 4305, Springer, pp. 290–304, 2006

    Google Scholar 

  19. Clementi, A. E. F., Crescenzi, P., Penna, P., Rossi, G., 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 (STACS), LNCS 2010, Springer, pp. 121–131, 2001

    Google Scholar 

  20. Clementi, A. E. F., Di Ianni, M., 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 

  21. Conway, J. H., Sloane, N. J. A.: “The Kissing Number Problem” and “Bounds on Kissing Numbers”. Ch. 2.1 and Ch. 13 in: Sphere Packings, Lattices, and Groups. Springer-Verlag, New York, 3rd edition, 1998

    Google Scholar 

  22. Das, A. K., Markas, R. J., El-Sharkawai, M., Arabshahi, P., 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), IEEE Computer Society, Vol. 2, pp. 1001–1010. 2003

    Google Scholar 

  23. Faragó, A., Basagni, S.: The Effect of Multi-Radio Nodes on Network Connectivity—A Graph Theoretic Analysis. In: Proceedings of the 19th International IEEE Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC), 2008

    Google Scholar 

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

    Google Scholar 

  25. Flammini, M., Klasing, R., Navarra, A., Perennes, S.: Tightening the upper bound for the Minimum Energy Broadcasting. Wireless Networks, Vol. 14(5), pp. 959-669, 2008

    Google Scholar 

  26. 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, 2006. Preliminary version in: Proceedings of the 4th International Workshop on Efficient and Experimental Algorithms (WEA), LNCS 3503, Springer, pp. 22–31, 2005

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  28. Guha, S., Khuller, S.: Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets. Information and Computation, 150(1), pp. 57–74, 1999

    Article  MathSciNet  Google Scholar 

  29. Hac, A.: Wireless sensor network designs. John Wiley & Sons, Ltd, 2003

    Google Scholar 

  30. Kang, I., Poovendran, R.: 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), pp. 332–341, 2005

    Google Scholar 

  31. Klasing, R., Flammini, M., Navarra, A., Perennes, S.: Improved approximation results for the Minimum Energy Broadcasting Problem. Algorithmica, 49(4):318–336, 2007

    Article  MATH  MathSciNet  Google Scholar 

  32. Klasing, R., Kosowski, A., Navarra, A.: Cost minimisation in multi-interface networks. In: Proceedings of the 1st EuroFGI International Conference on Network Control and Optimization (NET-COOP), LNCS 4465, Springer, pp. 276–285, 2007

    Google Scholar 

  33. 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: Proceedings of the 3rd IFIP-TC6 International Networking Conference, LNCS 3042, Springer, pp. 866–877, 2004

    Google Scholar 

  34. Kosowski, A., Navarra, A.: Cost minimisation in unbounded multi-interface networks. In: Proceedings of the 2nd PPAM Workshop on Scheduling for Parallel Computing (SPC), Lecture Notes in Computer Science 4967, Springer-Verlag, pp. 1039-1047, 2007

    Google Scholar 

  35. Kosowski, A., Navarra, A., Pinotti, M. C.: Connectivity in Multi-Interface Networks. In: Proceedings of the 4th International Symposium on Trustworthy Global Computing (TGC), LNCS, Springer, 2008

    Google Scholar 

  36. 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), ACM Press, pp. 112–122, 2002

    Google Scholar 

  37. Li, F., Nikolaidis, I.: On minimum-energy broadcasting in all-wireless networks. In: Proceedings of the 26th Annual IEEE Conference on Local Computer Networks (LCN), IEEE Computer Society, p. 193, 2001

    Google Scholar 

  38. Navarra, A.: 3-D Minimum Energy Broadcasting problem. Ad Hoc Networks, Vol. 6(5), pp. 734-743, 2008

    Article  MathSciNet  Google Scholar 

  39. Papadimitriou, C. H., Yannakakis, M.: Optimization, approximation, and complexity classes. Journal of Computer and System Sciences, 43:425–440, 1991

    Article  MATH  MathSciNet  Google Scholar 

  40. Raz, R., Safra, S.: A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In: Proceedings of the 29th Anuual ACM Symposium on Theory of Computing (STOC), pp. 475–484, 1997

    Google Scholar 

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

  42. 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), IEEE Computer Society, pp. 585–594, 2000

    Google Scholar 

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

  44. Zhao, F., Guibas, L.: Wireless sensor networks: an information processing approach. Morgan Kaufmann, 2004

    Google Scholar 

  45. Zosin, L., Khuller, S.: On Directed Steiner Trees. In: Proceedings of the 13th Annual ACM/SIAM Symposium on Discrete Algorithms (SODA), pp. 59-63, 2002

    Google Scholar 

Download references

Acknowledgements

The research was partially funded by the project “CEPAGE” of INRIA (France), by the ANR–project “ALADDIN” (France), by the European Commission under Integrated Project “Algorithmic Principles for Building Efficient Overlay Computers” (AEOLUS), EU COST action 293 – Graphs and Algorithms in Communication Networks (GRAAL) – and EU COST action 295 – Dynamic Communication Networks (DYNAMO), by the Greek General Secretariat for Research and Technology under programme PENED, and by a “Caratheodory” research grant from the University of Patras.

Author information

Authors and Affiliations

  1. Dipartimento di Matematica e Informatica, Università degli Studi di Perugia, Via Vanvitelli 1, 06123, Perugia, Italy

    Alfredo Navarra

  2. Computer Technology Institute & Department of Computer Engineering and Informatics, University of Patras, 26500, Rio, Greece

    Ioannis Caragiannis & Christos Kaklamanis

  3. Dipartimento di Informatica, Università degli Studi dell’Aquila, Via Vetoio, Loc. Coppito, 67100, L’Aquila, Italy

    Michele Flammini

  4. CNRS - LaBRI, Université Bordeaux 1, Talence cedex, France

    Ralf Klasing

Authors
  1. Alfredo Navarra
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ioannis Caragiannis
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Michele Flammini
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Christos Kaklamanis
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Ralf Klasing
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Alfredo Navarra , Ioannis Caragiannis , Michele Flammini , Christos Kaklamanis or Ralf Klasing .

Editor information

Editors and Affiliations

  1. LS II für Mathematik, RWTH Aachen, Templergraben 55, Aachen, 52056, Germany

    Arie Koster

  2. Depto. Matematica Aplicada IV, Universitat Politècnica de Catalunya, C. Jordi Girona 1-3, Barcelona, 08034, Spain

    Xavier Muñoz

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Navarra, A., Caragiannis, I., Flammini, M., Kaklamanis, C., Klasing, R. (2009). Energy Consumption Minimization in Ad Hoc Wireless and Multi-interface Networks. In: Koster, A., Muñoz, X. (eds) Graphs and Algorithms in Communication Networks. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02250-0_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02250-0_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02249-4

  • Online ISBN: 978-3-642-02250-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation