Journal of Communications and Networks

The Korean Institute of Commucations and Information Sciences (한국통신학회)
권호 표지

General Algorithms for Construction of Broadcast and Multicast Trees with Applications to Wireless Networks

  • Nguyen Gam D.
  • Published : 2005.09.01
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper, we introduce algorithms for constructing broadcasting and multicasting trees. These algorithms are general because they may be used for tree cost functions that are of arbitrary form. Thus, essentially the same algorithmic procedures are used for different tree cost functions. We evaluate the effectiveness of the general algorithms by applying them to different cost functions that are often used to model wired and wireless net­works. Besides providing a unifying framework for dealing with many present and future tree-construction applications, these algorithms typically outperform some existing algorithms that are specifically designed for energy-aware wireless networks. These general algorithms perform well at the expense of higher computational complexity. They are centralized algorithms, requiring the full network information for tree construction. Thus, we also present variations of these general algorithms to yield other algorithms that have lower complexity and distributed implementation.

Keywords

References

  1. 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 Trans. Mobile Computing, vol. 1, no. 3, pp. 176-191, July-Sept. 2002 https://doi.org/10.1109/TMC.2002.1081754
  2. G. D. Nguyen, 'Construction of broadcast and multicast trees with arbitrary cost functions,' in Proc. Conf. Inform. Sci. Syst., Mar. 2002, pp.1046-1051
  3. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications, Englewood Cliffs, NJ: Prentice Hall, 1993
  4. D. Bertsekas and R. Gallager, Data Networks, 2nd ed., Englewood Cliffs, NJ: Prentice Hall, 1992
  5. D. S. Hochbaum, Approximation Algorithms for NP-Hard Problems, Boston, MA: PWS Publishing Company, 1997
  6. A. Ahluwalia, E. Modiano, and L. Shu, 'On the complexity and distributed construction of energy-efficient broadcast trees in static ad hoc wireless networks,' in Proc. Conf. Inform. Sci. Syst., Mar. 2002, pp. 807-813
  7. F. Bian, A. Goel, C. S. Raghavendra, and X. Li, 'Energy-efficient broadcasting in wireless ad hoc networks: Lower bounds and algorithms,' J. Interconnection Networks, vol. 3, no. 3/4, pp. 149-166, Sept./Dec. 2002 https://doi.org/10.1142/S0219265902000604
  8. M. Cagalj, J.-P. Hubaux, and C. Enz, 'Minimum-energy broadcast in all-wireless networks: NP-completeness, and distribution issues,' in Proc. MOBICOM 2002, Sept. 2002, pp. 172-182
  9. A. E. F. Clementi, P. Crescenzi, P. Penna, P. Rossi, and P. Vocca, 'On the complexity of computing minimum energy consumption broadcast subgraphs,' in Proc. Symp. Theoretical Aspects Computer Sci., 2001, pp. 121-132
  10. F. Li and I. Nikolaidis, 'On minimum-energy broadcasting in all-wireless networks,' in Proc. IEEE Local Computer Networks, Nov. 2001, pp. 193-202
  11. W. Liang, 'Constructing minimum-energy broadcast trees in wireless ad-hoc networks,' in Proc. MOBIHOC 2002, June 2002, pp. 112-122
  12. P.-J. Wan, G. Calinescu, and C.-W. Yi, 'Minimum-power multicast routing in static ad hoc wireless networks,' IEEE/ACM Trans. Networking, vol. 12, no. 3, pp. 507-514, June 2004 https://doi.org/10.1109/TNET.2004.828940
  13. P.-J. Wan, G. Calinescu, X.-Y. Li, and O. Frieder, 'Minimum-energy broadcast in static ad hoc wireless networks,' in Proc. IEEE INFOCOM 2001, Apr. 2001, pp. 1162-1171 https://doi.org/10.1109/INFCOM.2001.916310
  14. J. E. Wieselthier, G. D. Nguyen, and A. Ephremides, 'On the construction of energy-efficient broadcast and multicast trees in wireless networks,' in Proc. IEEE INFOCOM 2000, Mar. 2000, pp. 585-594
  15. L. Kou, G. Markowsky, and L. Berman, 'A fast algorithm for Steiner trees,' Acta Informatica, vol. 15, pp. 141-145, 1981 https://doi.org/10.1007/BF00288961
  16. B. M. Waxman, 'Routing of multipoint connections,' IEEE J. Select. Areas Commun., vol. 6, no. 9, pp. 1617-1622, Dec. 1988 https://doi.org/10.1109/49.12889
  17. K. Mehlhorn, 'A faster approximation algorithm for the Steiner problem in graphs,' Inform. Processing Lett., vol. 27, pp. 125-128, Mar. 1988 https://doi.org/10.1016/0020-0190(88)90066-X
  18. A. Ephremides, 'Energy concerns in wireless networks,' IEEE Wireless Commun., vol. 9, no. 4, pp. 48-59, Aug. 2002
  19. A. Ephremides, 'Ad-hoc networks: Not an ad-hoc field any more,' Wiley J. Wireless Commun. Mobile Computing, vol. 2, no. 5, pp. 441-448, Aug. 2002 https://doi.org/10.1002/wcm.69
  20. I. Stojmenovic, Handbook of Wireless Networks and Mobile Computing, New York: John Wiley & Son, Inc., 2002