Skip to main content

Advertisement

SpringerLink
Log in

A novel optimization-based bandwidth-aware minimum power multicast routing algorithm in green wireless networks

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

Multicast routing in wireless networks that possess the wireless multicast advantage could significantly reduce the power and energy consumption. However, this kind of multicast routing that only addresses the transmission radius coverage might not be able to meet the bandwidth requirement of the users. As a result, additional transmissions are required to incur more energy consumption and carbon dioxide emissions that make existing algorithms not applicable to bandwidth constrained applications. In this paper, for the first time, we address the bandwidth aware minimum power multicast routing problem in wireless networks where the objective function is to minimize the total power consumption subject to the users’ bandwidth requirements. This problem is a challenging cross-layer design problem that requires seamless and sophisticated integrated design in the network layer (multicast routing) and physical layer (bandwidth-aware wireless transmission and power control). We first formulate this problem as a mixed integer linear programming problem and then propose a Lagrangian relaxation based algorithm to solve this problem. Numerical results demonstrate that the proposed approach is a sound green networking algorithm that outperforms the existing power efficient multicast routing approaches under all tested cases, especially in large bandwidth request, fine radius granularity, large group size and sparse network.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Wieselthier JE, Nguyen GD, Ephremides A (2000) On the construction of energy-efficient broadcast and multicast trees in wireless networks. In: Proc IEEE INFOCOM, pp 585–594

    Google Scholar 

  2. Liang W (2002) Constructing minimum-energy broadcast trees in wireless ad hoc networks. In: Proc ACM MobiHoc, pp 112–122

    Google Scholar 

  3. Wan P-J, Călinescu G, Li X-Y, Frieder O (2001) Minimum-energy broadcast routing in static ad hoc wireless networks. In: Proc IEEE INFOCOM, pp 1162–1171

    Google Scholar 

  4. Mavinkurve P, Ngo HQ, Mensa H (2003) MIP3S: Algorithms for power-conserving multicasting in wireless ad hoc networks. In: Proc of the IEEE international conference on networks (ICON), pp 143–148

    Google Scholar 

  5. Goldsmith A (2005) Wireless communications. Cambridge University Press, Cambridge

    Google Scholar 

  6. Cagalj M, Hubaux J, Enz C (2002) Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues. In: Proc ACM MobiCom, pp 172–182

    Google Scholar 

  7. Das AK, Marks RJ, El-Sharkawi M, Arabshahi P, Gray A (2003) Minimum power broadcast trees for wireless networks: integer programming formulations. In: Proc IEEE INFOCOM, pp 1001–1010

    Google Scholar 

  8. Guo SG, Yang O (2004) QoS-aware minimum energy multicast tree construction in wireless ad hoc networks. Ad Hoc Netw 2:217–229

    Article  Google Scholar 

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

    Article  MATH  Google Scholar 

  10. Wan P-J, Călinescu G, Chih-Wei (2004) Minimum-power multicast routing in static ad hoc wireless networks. IEEE/ACM Trans Netw 12:507–514

    Article  Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Article  Google Scholar 

  13. Das AK, Marks RJ, El-Sharkawi M, Arabshahi P, Gray A (2003) r-Shrink: a heuristic for improving minimum power broadcast trees in wireless networks. In: Proc IEEE GLOBECOM’03, December 2003, pp 523–527

    Google Scholar 

  14. Nguyen GD (2005) General algorithms for construction of broadcast and multicast trees with applications to wireless networks. J Commun Netw 7:263–277

    Google Scholar 

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

    Article  Google Scholar 

  16. Yuan D (2005) Computing optimal or near-optimal trees for minimum-energy broadcast in wireless networks. In: Proc WiOpt

    Google Scholar 

  17. Kang I, Poovendran R (2005) Iterated local optimization of minimum energy broadcast. In: Proc WiOpt

    Google Scholar 

  18. 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:696–717

    Article  Google Scholar 

  19. Yen HH, Lee SSW, Yap FGH (2011) A novel optimization-based approach for minimum power multicast in wireless networks. J Commun Netw 13(1):26–31

    Google Scholar 

  20. Dai F, Dai Q, Wu J (2005) Power efficient routing trees for ad hoc wireless networks using directional antenna. Ad Hoc Netw 3:621–628

    Article  Google Scholar 

  21. Guo SG, Yang O (2006) Minimum-energy multicast in wireless ad hoc networks with adaptive antennas: MILP formulations and heuristic algorithms. IEEE Trans Mob Comput 5:333–346

    Article  Google Scholar 

  22. Khandani AE, Modiano E, Abounadi J, Zheng L (2004) Cooperative routing in wireless networks. In: Advances in pervasive computing and network. Kluwer Academic, Dordrecht

    Google Scholar 

  23. Raghunathan V, Schurgers C, Park S, Srivastava MB (2002) Energy-aware wireless microsensor networks. IEEE Signal Process Mag 19:40–50

    Article  Google Scholar 

  24. Ahuja RK, Magnanti TL, Orlin JB (1993) Networks flows: theory, algorithms, and applications. Prentice Hall, New York

    Google Scholar 

  25. http://www.wimaxforum.org/technology/downloads/WiMAXNLOSgeneral-versionaug04.pdf (2011)

  26. Basagni S, Chlamtac I, Syrotivk VR, Woodward BA (1998) A distance effect algorithm for mobility (DREAM). In: Proc ACM/IEEE international conference on mobile computing and networking (Mobicom)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Management, Shih-Hsin University, Taipei, Taiwan

    Hong-Hsu Yen

  2. Department of Communications Engineering, National Chung Cheng University, Minhsiung township, Taiwan

    Steven S. W. Lee

  3. English Division, Center for General Education, Chang Gung University, Taoyuan, Taiwan

    Florence G. H. Yap

Authors
  1. Hong-Hsu Yen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Steven S. W. Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Florence G. H. Yap
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hong-Hsu Yen.

Additional information

Earlier version of this paper appears in Proc. of IEEE International Symposium on Pervasive Systems, Algorithms, and Networks (ISPAN), pp. 321–325, Dec. 2009.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yen, HH., Lee, S.S.W. & Yap, F.G.H. A novel optimization-based bandwidth-aware minimum power multicast routing algorithm in green wireless networks. J Supercomput 62, 1119–1138 (2012). https://doi.org/10.1007/s11227-011-0629-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-011-0629-x

Keywords

Search

Navigation