Integer programming formulations for the shared multicast tree problem

  • Marika Ivanova
  • Dag HauglandEmail author


We study the shared multicast tree (SMT) problem in wireless networks. To support a multicast session between a set of network nodes, SMT aims to establish a wireless connection between them, such that the total energy consumption is minimized. All destinations of the multicast message must be connected, while non-destinations are optional nodes that can be used to relay messages. The objective function reflecting power consumption distinguishes SMT clearly from the traditional minimum Steiner tree problem. We develop two integer programming formulations for SMT. Both models are subsequently extended and strengthened. Theorems on relations between the LP bounds corresponding to the models are stated and proved. As the number of variables in the strongest formulations is a polynomial of degree four in the number of network nodes, the models are impractical for computing lower bounds in instances beyond a fairly small size, and therefore a constraint generation scheme is developed. Results from computational experiments with the models demonstrate good promise of the approaches taken.


Wireless communication Multicast tree Steiner tree LP bound Valid inequalities 



  1. Althaus E, Călinescu G, Măndoiu II, Prasad S, Tchervenski N, Zelikovsky A (2003) Power efficient range assignment in ad-hoc wireless networks. In: Proceedings IEEE WCNC03, pp 1889–1894Google Scholar
  2. Altinkemer K, Salman FS, Bellur P (2005) Solving the minimum energy broadcasting problem in ad hoc wireless networks by integer programming. In: Proceedings INOC 2005, pp B2.635–B2.642Google Scholar
  3. Bauer J, Haugland D, Yuan D (2008) Analysis and computational study of several integer programming formulations for minimum-energy multicasting in wireless ad hoc networks. Networks 52(2):57–68MathSciNetCrossRefzbMATHGoogle Scholar
  4. Bein D, Zheng SQ (2010) Energy efficient all-to-all broadcast in all-wireless networks. Inf Sci 180(10):1781–1792MathSciNetCrossRefGoogle Scholar
  5. Bhukya WN, Singh A (2014) p-shrink: a Heuristic for improving minimum all-to-all power broadcast trees in wireless networks. In: Proceedings of ninth international conference on wireless communication and sensor networks 2014 vol 299, pp 61–69Google Scholar
  6. Čagalj M, Hubaux J-P, Enz C (2002) Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues. In: Proceedings ACM MOBICOM 2002 pp 172–182Google Scholar
  7. Clementi A, Penna P, Silvestri R (1999) Hardness results for the power range assignment problem in packet radio networks. In: Hochbaum D et al. (eds) RANDOM-APPROX99, LNCS, vol 1671, pp 197–208Google Scholar
  8. Das AK, Marks RJ, El-Sharkawi M, Arabshani P, Gray A (2003) Minimum power broadcast trees for wireless networks: integer programming formulations. In: Proceedings IEEE INFOCOM 2003, vol 2, pp 1001–1010Google Scholar
  9. Das AK, Marks RJ, El-Sharkawi E, Arabshahi P, Gray A (2005) Optimization methods for minimum power bidirectional topology construction in wireless networks with sectored antennas. In: Proceedings IEEE GLOBECOM 05, pp 3962–3968Google Scholar
  10. Goemans MX, Myung Y-S (1993) A catalog of Steiner tree formulations. Networks 23(1):19–28MathSciNetCrossRefzbMATHGoogle Scholar
  11. Guo S, Yang O (2004) Minimum energy multicast routing for wireless ad-hoc networks with adaptive antennas. In: Proceedings of the 12th IEEE international conference on network protocols ICNP 2004, pp 151–160Google Scholar
  12. Halgamuge MN, Zukerman M, Ramamohanarao K, Vu HL (2009) An estimation of sensor energy consumption. Prog Electromagn Res B 12:259–295CrossRefGoogle Scholar
  13. Haugland D, Yuan D (2011) Compact integer programming models for power-optimal trees in ad hoc wireless networks. In: Kennington J, Olinick E, Rajan D (eds) Wireless network design: optimization models and solution procedure. International series in operations research and management science. Springer, New York, pp 219–246CrossRefGoogle Scholar
  14. Hsiao P-C, Chiang T-C, Fu L-C (2013) Static and dynamic minimum energy broadcast problem in wireless ad-hoc networks: a PSO-based approach and analysis. Appl Soft Comput 13:786–4801Google Scholar
  15. Ivanova M (2016) Shared multicast trees in ad hoc wireless networks. In: Cerulli R, Fujishige S, Mahjoub A (eds) Combinatorial optimization ISCO 2016, LNCS, vol 9849. Springer, Cham, pp 273–284Google Scholar
  16. Kirousis LM, Kranakis E, Krizanc D, Pelc A (1997) Power consumption in packet radio networks. In: Reischuk M (ed) STACS’97 Proceedings, LNCS, vol 1200, pp 363–374Google Scholar
  17. Leggieri V, Nobili P, Triki C (2008) Minimum power multicasting problem in wireless networks. Math Methods Oper Res 68:295–311MathSciNetCrossRefzbMATHGoogle Scholar
  18. Montemanni R, Gambardella LM (2004) Exact algorithms for the minimum power symmetric connectivity problem in wireless networks. Comput Oper Res 31(10):1667–1680MathSciNetCrossRefzbMATHGoogle Scholar
  19. Montemanni R, Leggieri V (2011) A branch and price algorithm for the minimum power multicasting problem in wireless sensor networks. Math Methods Oper Res 74:327–342MathSciNetCrossRefzbMATHGoogle Scholar
  20. Pajor T, Uchoa E, Werneck RF (2018) A robust and scalable algorithm for the Steiner problem in graphs. Math Program Comput 10:69–118MathSciNetCrossRefzbMATHGoogle Scholar
  21. Papadimitriou I, Georgiadis L (2006) Minimum-energy broadcasting in multi-hop wireless networks using a single broadcast tree. Mobile Netw Appl 11(3):361–375CrossRefGoogle Scholar
  22. Polzin T, Daneshmand SV (2001) A comparison of Steiner tree relaxations. Discrete Appl Math 112(1–3):241–261MathSciNetCrossRefzbMATHGoogle Scholar
  23. Wieselthier JE, Nguyen GD, Ephremides A (2000) On the construction of energy-efficient broadcast and multicast trees in wireless networks. In: Proceedings IEEE INFOCOM 2000, vol 2, pp 585–594Google Scholar
  24. Yuan D (2005) An integer programming approach for the minimum-energy broadcast problem in wireless networks. In: Proceedings INOC 2005, pp B2.643–B2.650Google Scholar
  25. Yuan D, Haugland D (2012) Dual decomposition for computational optimization of minimum-power shared broadcast tree in wireless networks. IEEE Trans Mob Comput 12(11):2008–2019CrossRefGoogle Scholar
  26. Yuan D, Bauer J, Haugland D (2008) Minimum-energy broadcast and multicast in wireless networks: an integer programming approach and improved Heuristic algorithms. Ad Hoc Netw 6(5):696–717CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2019

Authors and Affiliations

  1. 1.Department of InformaticsUniversity of BergenBergenNorway

Personalised recommendations