Bandwidth guaranteed multi-tree multicast routing in wireless ad hoc networks

Authors:
Huayi Wu;Xiaohua Jia;Yanxiang He;Chuanhe Huang
Affiliations:
Computer School of Wuhan University;Computer School of Wuhan University;Computer School of Wuhan University;Computer School of Wuhan University
Venue:
APWeb'06 Proceedings of the 2006 international conference on Advanced Web and Network Technologies, and Applications
Year:
2006

Citing 6
Cited 0

Distributed code assignments for CDMA Packet Radio Network

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
Forwarding Group Multicast Protocol (FGMP) for multihop, mobile wireless networks

Cluster Computing
AMRoute: ad hoc multicast routing protocol

Mobile Networks and Applications
On-demand multicast routing protocol in multihop wireless mobile networks

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 bandwidth 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.