Skip to main content
Springer Nature Link
Log in

Nested Partitioning for the Minimum Energy Broadcast Problem

  • Conference paper
Learning and Intelligent Optimization (LION 2007)

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

Included in the following conference series:

  • 851 Accesses

Abstract

The problem of finding the broadcast scheme with minimum power consumption in a wireless ad-hoc network is NP-hard. This work presents a new hybrid algorithm to solve this problem by combining Nested Partitioning with Local Search and Linear Programming. The algorithm is benchmarked by solving instances with 20 and 50 nodes where results are compared to either optimum or best results found by an IP solver. In these instances, the proposed algorithm was able to find optimal and near optimal solutions.

Work was done while visiting the Distributed Algorithms Group at the University of Kaiserslautern.

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

Access this chapter

Log in via an institution

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. Haas, Z.J., Tabrizi, S.: On some challenges and design choices in ad-hoc communications. In: IEEE MILCOM 1998, Bedford, USA, pp. 187–192 (1998)

    Google Scholar 

  2. Rappaport, T.S.: Wireless Communications: Principles and Practices. Prentice Hall, Englewood Cliffs (1996)

    Google Scholar 

  3. 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 IEEE INFOCOM 2000., pp. 585–594 (2000)

    Google Scholar 

  4. Shi, L., Ólafsson, S.: Nested partitions method for global optimization. Operations Research 48(3), 390–407 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  5. Shi, L., Ólafsson, S.: Nested partitions method for stochastic optimization. Methodology and Computing in Applied Probability 2(3), 271–291 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  6. Shi, L., Ólafsson, S., Chen, Q.: An optimization framework for product design. Management Science 47(12), 1681–1692 (2001)

    Article  MATH  Google Scholar 

  7. Ólafsson, S., Shi, L.: A method for scheduling in parallel manufacturing systems with flexible resources. IIE Transactions 32(2), 135–146 (2000)

    Google Scholar 

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

  9. Čagalj, M., Hubaux, J.P., 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)

    Google Scholar 

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

  11. Wan, P.J., Călinescu, G., Li, X.Y., Frieder, O.: Minimum-energy broadcasting in static ad hoc wireless networks. Wireless Networks 8(6), 607–617 (2002)

    Article  MATH  Google Scholar 

  12. Das, A.K., Marks, R.J., El-Sharkawi, M., Arabshahi, P., Gray, A.: r-shrink: A heuristic for improving minimum power broadcast trees in wireless networks. In: Global Telecommunications Conference, GLOBECOM 2003, pp. 523–527. IEEE, Los Alamitos (2003)

    Google Scholar 

  13. Kang, I., Poovendran, R.: Iterated local optimization for minimum energy broadcast. In: 3rd International Symposium on Modeling and Optimization in Mobile, Ad-Hoc and Wireless Networks (WiOpt), pp. 332–341. IEEE Computer Society, Los Alamitos (2005)

    Chapter  Google Scholar 

  14. Kang, I., Poovendran, R.: Broadcast with heterogeneous node capability. In: Global Telecommunications Conference, GLOBECOM 2004, pp. 4114–4119. IEEE, Los Alamitos (2004)

    Chapter  Google Scholar 

  15. Das, A.K., Marks, R.J., El-Sharkawi, M., Arabshahi, P., Gray, A.: Minimum power broadcast trees for wireless networks: Integer programming formulations. In: Proceedings of the 22nd IEEE INFOCOM 2003, pp. 1001–1010 (2003)

    Google Scholar 

  16. Montemanni, R., Gambardella, L.M., Das, A.: The minimum power broadcast problem in wireless networks: a simulated annealing approach. Wireless Communications and Networking Conference (WCNC) 4, 2057–2062 (2005)

    Google Scholar 

  17. Shi, L., Ólafsson, S., Sun, N.: New parallel randomized algorithms for the traveling salesman problem. Computers and Operations Research 26(4), 371–394 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  18. Al-Shihabi, S.: Ants for sampling in the nested partition algorithm. In: Hybrid Metaheuristics, pp. 11–18 (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Industrial Engineering Department, University of Jordan, Amman, 11942, Jordan

    Sameh Al-Shihabi

  2. Distributed Algorithms Group, University of Kaiserslautern, Germany

    Peter Merz & Steffen Wolf

Authors
  1. Sameh Al-Shihabi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Peter Merz
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Steffen Wolf
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. Computer Science, University of Bologna, Bologna, Italy

    Vittorio Maniezzo

  2. Università degli Studi di Trento, Trento, Italy

    Roberto Battiti

  3. Discrete Math and Complex Systems Department, Sandia National Laboratories, Albuquerque, New Mexico, USA

    Jean-Paul Watson

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Al-Shihabi, S., Merz, P., Wolf, S. (2008). Nested Partitioning for the Minimum Energy Broadcast Problem . In: Maniezzo, V., Battiti, R., Watson, JP. (eds) Learning and Intelligent Optimization. LION 2007. Lecture Notes in Computer Science, vol 5313. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92695-5_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-92695-5_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-92694-8

  • Online ISBN: 978-3-540-92695-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics