This paper investigates the issues of QoS multicast routing in wireless ad hoc networks. Due to limited bandwidth of wireless nodes, a QoS multicast call will be blocked if there does not exist a single multicast tree that has the requested bandwidth, even though there is enough bandwidth in the system to support the call. We propose a new QoS multicast routing scheme that uses multiple trees. The aggregate bandwidth of multiple trees can meet the band-width requirement and the delay from the source to the farthest destination node shall not exceed a pre-specified bound. Two strategies for constructing multiple trees are studied. The simulation results show that the new scheme significantly improves the request success rate and makes a better use of network resources. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Wu, H., Jia, X., He, Y., & Huang, C. (2006). Bandwidth guaranteed multi-tree multicast routing in wireless ad hoc networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3842 LNCS, pp. 157–166). Springer Verlag. https://doi.org/10.1007/11610496_21
Mendeley helps you to discover research relevant for your work.