Skip to main content

Advertisement

SpringerLink
Log in

A framework for the multicast lifetime maximization problem in energy-constrained wireless ad-hoc networks

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

We consider the problem of maximizing the lifetime of a given multicast connection in wireless networks that use directional antennas and have limited energy resources. We provide a globally optimal solution to this problem for a special case of using omni-directional antennas. This graph theoretic approach provides us insights into more general case of using directional antennas, and inspires us to produce a group of heuristic algorithms. Experimental results show that our algorithms outperform other energy-aware multicast algorithms significantly in terms of multicast lifetime.

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

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

Notes

  1. The cost of a link between Node v and Node u is defined as \(c_{vu} = p_{vu} \cdot (E_v (0)/E_v (t))^\beta\), where p vu is the transmission power needed for the link from node v to node u, E v (t) is the residual energy at Node v at time t, and β is a parameter that reflects the importance we assign to the impact of residual energy. Experimental results in [16] show the beneficial effects of using β in the range [0.5, 2].

  2. The symbol R + denotes the positive real number set.

  3. The “wireless multicast advantage” property, originally introduced in [11], means that all nodes within communication range of a transmitting node can receive a multicast message with only one transmission if they all use omni-directional antennas.

  4. In the following, we use T to indicate an undirected tree in an undirected graph, while T S a directed tree rooted at node s in a directed graph.

  5. A pruned spanning tree is obtained by deleting all arcs that are not needed to reach the multicast nodes.

  6. In the case of using omni-directional antennas, the value of θ v (T s ) is 360.

  7. In the case of unicast, the value of θ v (T s ) is θ min.

  8. CPLEX is a linear, integer and quadratic programming package using simplex method and written in C language.

Reference

  1. S. Bandyopadhyay, K. Hasuike, S. Horisawa and S. Tawara, An adaptive MAC protocol for wireless ad hoc community network (WACNet) using electronically steerable passive array radiator antenna, in: Proceedings of the GLOBECOM (November 25–29, 2001) San Antonio, Texas, USA, pp. 2896–2900.

  2. S. Bandyopadhyay, K. Hasuike, S. Horisawa and S. Tawara, An adaptive MAC and directional routing protocol for ad hoc wireless network using directional ESPAR antenna, in: Proceedings of the ACM MobiHoc 2001, Long Beach, California, USA (October 4–5, 2001) pp. 243–246.

  3. R.R. Choudhury, X. Yang, N.H. Vaidya and R. Ramanathan, Media access control for ad hoc networks: Using directional antennas for medium access control in ad hoc networks, in: Proceedings of the Eighth Annual International Conference on Mobile Computing and Networking (September 2002) pp. 59–70.

  4. Y. B. Ko, V. Shankarkumar and N. H. Vaidya, Medium access control protocols using directional antennas in ad-hoc networks, in: Proceedings of IEEE INFOCOM (March 2000) pp. 13–21.

  5. A. Nasipuri, S. Ye, J. You and R. E. Hiromoto, A MAC protocol for mobile ad hoc networks using directional antennas, in: Proceedings of IEEE WCNC (2000) pp. 1214–1219.

  6. A. Nasipuri, J. Mandava, H. Manchala and R. E. Hiromoto, On-demand routing using directional antennas in mobile ad hoc networks, in: Proceedings of IEEE Computer Communications and Networks (2000) pp. 535–541.

  7. I. Kang and R. Poovendran, Maximizing static network lifetime of wireless broadcast adhoc networks, in: Proceedings of IEEE ICC, Alaska (May 11–15, 2003) pp. 2256–2261.

  8. M.X. Cheng, J. Sun, et al. Energy-efficient broadcast and multicast routing in ad hoc wireless networks, in: Proceedings of IEEE IPCCC, Phoenix, Arizona (April 2003) pp. 87–94.

  9. B. Wang and S.K.S. Gupta, On maximizing lifetime of multicast trees in wireless ad hoc networks, in: Proceedings of International Conference on Parallel Processing, Kaohsiung, Taiwan (October 2003) pp. 333–340.

  10. B. Floréen, P. Kaski, et al. Multicast time maximization in energy constrained wireless networks, in: Proceedings of Workshop on Foundations of Mobile Computing, New York, NY (2003 pp. 50–58.

  11. J.E. Wieselthier, G.D. Nguyen, et al. On the construction of energy-efficient broadcast and multicast trees in wireless networks, in: Proceedings of IEEE INFOCOM (March 2000) pp.585–594.

  12. J.E. Wieselthier, G.D. Nguyen and A. Ephremides, Energy-efficient broadcast and multicast trees in wireless networks, Mobile Networks and Applications (MONET) 7(6) (December 2002) 481–492.

    Google Scholar 

  13. F. Li and I. Nikolaidis, On minimum-energy broadcasting in all-wireless networks, in: Proceedings of the 26th Annual IEEE LCN, Tampa, Florida (November 2001) pp. 14–16.

  14. J. Cartigny, D. Simplot and I. Stojmenovic, Localized minimum-energy broadcasting in ad-hoc networks, in: Proceedings of IEEE INFOCOM (April 2003) pp. 2210–2217.

  15. J. E. Wieselthier, G. D. Nguyen, et al., Energy-limited wireless networking with directional antennas: The case of session-based multicasting, in: Proceedings of IEEE INFOCOM (March 2002) pp. 190–199.

  16. J. E. Wieselthier, G. D. Nguyen and A. Ephremides, Energy-aware wireless networking with directional antennas: The case of session-based broadcasting and multicasting, IEEE Transactions on Mobile Computing 1(3) (July–September 2002) 176–191.

    Google Scholar 

  17. D. Cheriton and R.E. Tarjan, Finding minimum spanning trees, SIAM Journal on Computing 5 (1976) 419–429.

    Google Scholar 

  18. H.N. Gabow, Two algorithms for generating weighted spanning trees in order, SIAM Journal on Computing 6 (1977) 139–150.

    Google Scholar 

  19. R.C. Prim, Shortest connection networks and some generalizations, The Bell System Technical Journal 26 (1957) 1389–1401.

  20. R.K. Ahuja, T.L. Magnanti and J.B. Orlin, Network Flows (Prentice Hall, 1993).

  21. J.B. Kruskal, On the shortest spanning subtree of a graph and the traveling salesman problem, in: Proceedings of the American Mathematical Society, Vol. 7 (1956) pp. 48–50.

  22. P.J. Wan, G. Calinescu, et al. Minimum-energy broadcast routing in static ad hoc wireless networks, in: Proceedings of IEEE INFOCOM 2001, Anchorage, Alaska (April 2001) pp. 1162–1171.

  23. M. Cagalj, J.-P. Hubaux and C. Enz, Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues, in: Proceedings of international conference on Mobile computing and networking (MOBICOM), Atlanta, Georgia, USA (2002) pp. 172–182.

  24. J.E. Wieselthier, G.D. Nguyen and A. Ephremides, Algorithms for energy-efficient multicasting in static ad hoc wireless networks, ACM Mobile Networks and Applications 6(3) (June 2001) 251–263.

    Google Scholar 

  25. J.E. Wieselthier, G.D. Nguyen and A. Ephremides, Resource management in energy-limited, bandwidth-limited, transceiver-limited wireless networks for session-based multicasting, Elsevier Computer Networks 39 (2002) 113–131.

    Google Scholar 

  26. I. Kang and R. Poovendran, S-GPBE: A power-efficient broadcast routing algorithm using sectored antenna, in: Proceedings of the 3rd IASTED International Conference on Wireless and Optical Communications (WOC) (July 14–16, 2003) Alberta, Canada, Session CSA-1.

  27. I. Kang and R. Poovendran, A novel power-efficient broadcast routing algorithm exploiting broadcast efficiency with omni-directional and directional antenna, in: Proceedings of the IEEE Vehicular Technology Conference (VTC) (Oct 6–9, 2003) Orlando, USA, Session 8F-1.

  28. A. Spyropoulos and C.S. Raghavendra, Energy efficient communications in ad hoc networks using directional antennas, in: Proceedings of IEEE INFOCOM (March 2002) pp. 220–228.

  29. J.-H. Chang and L. Tassiulas, Energy conserving routing in wireless ad-hoc networks, in: Proceedings IEEE INFOCOM, New York NY (2000) pp. 22–31.

  30. I. Kang and R. Poovendran, On the lifetime extension of energy-efficient multihop broadcast networks, the World Congress on Computational Intelligence, Honolulu, 2002.

  31. R. Gallager, P.A. Humblet and P.M. Spira, A distributed algorithm for minimum-weight spanning trees, ACM Transactions on Programming Language Systems 5 (1983) 66–77.

    Google Scholar 

  32. S. Guo and O. Yang, Optimal tree construction for maximum lifetime multicasting in wireless ad-hoc networks with adaptive antennas, in: IEEE ICC, Seoul, Korea (May 2005) pp. 3370–3374.

  33. A.K. Das, R.J. Marks, M. El-Sharkawi, P. Arabshahi and A. Gray, Minimum power broadcast trees for wireless networks: Integer programming formulations, in: Proceedings of IEEE INFOCOM, San Francisco (April 2003) pp. 2210–2217.

  34. CPLEX, http://www.cplex.com.

Download references

Author information

Authors and Affiliations

  1. Computer Science, University of Northern British Columbia, Prince George, ON, Canada, V2N 4Z9

    Song Guo

  2. School of Information Technology and Engineering, University of Ottawa, Ottawa, Ontario, Canada, K1N 6N5

    Oliver Yang

Authors
  1. Song Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Oliver Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Song Guo.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Guo, S., Yang, O. A framework for the multicast lifetime maximization problem in energy-constrained wireless ad-hoc networks. Wireless Netw 15, 313–329 (2009). https://doi.org/10.1007/s11276-007-0041-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-007-0041-x

Keywords

Search

Navigation