Distributed code assignments for CDMA Packet Radio Network
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Multicast operation of the ad-hoc on-demand distance vector routing protocol
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
AMRoute: ad hoc multicast routing protocol
Mobile Networks and Applications
RoMR: A Robust Multicast Routing Protocol for Ad-Hoc Networks
LCN '01 Proceedings of the 26th Annual IEEE Conference on Local Computer Networks
SoMR: A scalable distributed QoS multicast routing protocol
Journal of Parallel and Distributed Computing
WSEAS Transactions on Computers
QoS routing with traffic distribution in mobile ad hoc networks
Computer Communications
Quality of Service in mobile ad hoc networks: a survey
International Journal of Ad Hoc and Ubiquitous Computing
Survey Paper: Routing protocols in ad hoc networks: A survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
A multi-path QoS multicast routing protocol with slot assignment for mobile ad hoc networks
Information Sciences: an International Journal
QoS multicast routing in cognitive radio ad hoc networks
International Journal of Communication Systems
Hi-index | 0.00 |
In this paper, we investigate the issues of QoS multicast routing in wireless ad hoc networks. Due to limited bandwidth of a wireless node, a QoS multicast call could often 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. In this paper, we propose a new multicast routing scheme by using multiple paths or multiple trees to meet the bandwidth requirement of a call. Three multicast routing strategies are studied, SPT (shortest path tree) based multiple-paths (SPTM), least cost tree based multiple-paths (LCTM) and multiple least cost trees (MLCT). The final routing tree(s) can meet the user's QoS requirements such that the delay from the source to any destination node shall not exceed the required bound and the aggregate bandwidth of the paths or trees shall meet the bandwidth requirement of the call. Extensive simulations have been conducted to evaluate the performance of our three multicast routing strategies. The simulation results show that the new scheme improves the call success ratio and makes a better use of network resources.