Issue No. 06 - June (2008 vol. 7)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TMC.2008.38
Previous quality-of-service (QoS) routing/multicasting protocols in mobile ad-hoc networks determined bandwidth-satisfied routes for QoS applications. However, they suffer from two bandwidth-violation problems, named the hidden route problem (HRP) and the hidden multicast route problem (HMRP). HRP may arise when a new flow is permitted and only the bandwidth consumption of the hosts in the neighborhood of the route is computed. Similarly, HMRP may arise when multiple flows are permitted concurrently. Without considering the bandwidth consumption of two-hop neighbors is the reason why the two problems are introduced. In this paper, a novel algorithm that can avoid the two problems is proposed to construct bandwidth-satisfied multicast trees for QoS applications. Further, it also aims to minimize the number of forwarders so as to reduce bandwidth and power consumption. Simulation results show that the proposed algorithm can improve the network throughput.
Wireless communication, Applications, Algorithm/protocol design and analysis
Gen-Huey Chen, Eric Hsiao-Kuang Wu, Chia-Cheng Hu, "Bandwidth-Satisfied Multicast Trees in MANETs", IEEE Transactions on Mobile Computing, vol. 7, no. , pp. 712-723, June 2008, doi:10.1109/TMC.2008.38