Multicast routing algorithm of multiple QoS based on widest-bandwidth
暂无分享,去创建一个
Abstract A multicast routing algorithm of multiple QoS constraints based on widest-bandwidth (MRQW) which takes available bandwidth as the prime metric, considering the constraints of the surplus energy of the node, delay and delay jitter, is presented. The process of routing based on MRQW is provided for as well. Correctness proof and the complexity analysis of the MRQW are also given in the paper. Simulation results show that the MRQW has a good performance in creating multicast trees. It not only satisfys multiple QoS constraints but also makes multicast links have larger available bandwidth
[1] Li La. A Multicast Routing Protocol with Multiple QoS Constraints , 2004 .
[2] Sun Bao. A QoS Based Multicast Routing Protocol in Ad Hoc Networks , 2004 .
[3] Pierre A. Humblet,et al. A Distributed Algorithm for Minimum-Weight Spanning Trees , 1983, TOPL.
[4] Klara Nahrstedt,et al. Distributed quality-of-service routing in ad hoc networks , 1999, IEEE J. Sel. Areas Commun..
[5] Zou Ling. A QoS based distributed multicast routing algorithm in Ad Hoc networks , 2003 .