Skip to main content

Advertisement

Log in

Approximation algorithms for multicast routing in ad hoc wireless networks

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

Energy efficient multicast problem is one of important issues in ad hoc networks. In this paper, we address the energy efficient multicast problem for discrete power levels in ad hoc wireless networks. The problem of our concern is: given n nodes deployed over 2-D plane and each node v has l(v) transmission power levels and a multicast request (s,D) (clearly, when D is V∖{s}, the multicast request is a broadcast request), how to find a multicast tree rooted at s and spanning all destinations in D such that the total energy cost of the multicast tree is minimized. We first prove that this problem is NP-hard and it is unlikely to have an approximation algorithm with performance ratio ρlnn(ρ<1). Then, we propose a general algorithm for the multicast/broadcast tree problem. And based on the general algorithm, we propose an approximation algorithm and a heuristics for multicast tree problem. Especially, we also propose an efficient heuristic for broadcast tree problem. Simulations ensure our algorithms are efficient.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Ar M, Chekuri C, Cheung T, Dai Z, Goel A, Guha S, Li M (1998) Approximation algorithms for directed Steiner problems. In: Proc of the 9th annual ACM-SIAM symposium on discrete algorithms, pp 192–200

  • Cagalj M, Hubaux JP, C. Enz C (2002) Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues. In: Proc of the 8th annual international conference on mobile computing and networking

  • Cheng XY, Sun JH, Min M, Du DZ (2003) Energy efficient broadcast and multicast routing in ad hoc wireless networks. In: Proc of the 22nd IEEE international performance, computing, and communications conference

  • Du HW, Jia XH, Hu XD (2005) Energy efficient multicast routing in ad hoc wireless networks with discrete levels of transmission power. In: Proc of the international conference on communications, circuits and systems, pp 319–323

  • Egecioglu O, Gonzalez TF (2001) Minimum-energy broadcast in simple graphs with limited node power. In: Proc of the IASED international conference on parallel and distributed computing and systems, pp 334–338

  • Guo S, Yang O (2007) Energy-aware multicasting in wireless ad hoc networks: a survey and discussion. Comput Commun 30(4):2129–2148

    Article  Google Scholar 

  • Li DY, Jia XH, Liu H (2004) Energy efficient broadcast routing in ad hoc wireless networks. IEEE Trans Mob Comput 3(2):144–151

    Article  Google Scholar 

  • Liang DY, Liu Q, Hu XD, Jia XH (2006) Energy efficient multicast routing in ad hoc wireless networks. Comput Commun 18(30):3746–3756

    Google Scholar 

  • Li DY, Zhu QH, Li Z (2008) Energy efficient multicast routing for discrete power levels in ad hoc sensor wireless networks. In: Proc of the IEEE WiCOM

  • Li XY, Song WZ, Wang Y (2006) Localized topology control for heterogeneous wireless ad hoc networks. ACM Trans Sens Netw 2(1):129–153

    Article  MathSciNet  Google Scholar 

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

  • Liang W (2006) Approximate minimum-energy multicasting in wireless ad hoc networks. IEEE Trans Mob Comput 5(4):377–387

    Article  Google Scholar 

  • Liang W, Guo XX (2006) Online multicasting for network capacity maximization in energy-constrained ad hoc networks. IEEE Trans Mob Comput 9(5):1215–1227

    Article  Google Scholar 

  • Tang CM, Raghavendra CS (2004) Energy efficient adaptation of multicast protocols in power controlled wireless ad hoc networks. Mob Netw Appl 9(8):311–317

    Article  Google Scholar 

  • Wan PJ, Calinescu G, Li XY, Frieder O (2001) Minimum-energy broadcast routing in static ad hoc wireless networks. In: Proc of the IEEE INFOCOM, Alaska USA, 2001

  • Wan PJ, Calinescu G, Frieder C (2004) Minimum-power multicast routing in static ad hoc wireless networks. IEEE/ACM Trans Netw 12(3):507–514

    Article  Google Scholar 

  • Wieselthier JE, Nguyen GD, Ephremides A (2001) Algorithm for energy-efficient multicasting in static ad hoc wireless networks. Mob Netw Appl 6(3):251–263

    Article  MATH  Google Scholar 

  • Wieselthier JE, Nguyen GD, Ephremides A (2002a) On the construction of energy-efficient broadcast and multicast trees in wireless networks. In: Proc of the IEEE INFOCOM, New York, June, 2002

  • Wieselthier JE, Nguyen GD, Ephremides A (2002b) Energy-efficient broadcast and multicast trees in wireless networks. Mob Netw Appl 7(6):481–492

    Article  MathSciNet  Google Scholar 

  • Zosin L, Khuller S (2002) On directed Steiner trees. In: Proc of the 13th annual ACM-SIAM symposium on discrete algorithms, pp 59–63

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Deying Li.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, D., Zhu, Q. Approximation algorithms for multicast routing in ad hoc wireless networks. J Comb Optim 21, 293–305 (2011). https://doi.org/10.1007/s10878-009-9245-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-009-9245-6

Keywords

Navigation