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
Tree multicast strategies in mobile, multishop wireless networks
Mobile Networks and Applications
Adaptive demand-driven multicast routing in multi-hop wireless ad hoc networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Neighbor supporting ad hoc multicast routing protocol
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Adaptive core multicast routing protocol
Wireless Networks
A Scenario-Based Performance Evaluation of Multicast Routing Protocols for Ad Hoc Networks
WOWMOM '05 Proceedings of the Sixth IEEE International Symposium on World of Wireless Mobile and Multimedia Networks
Multicast Scaling Properties in Massively Dense Ad Hoc Networks
ICPADS '05 Proceedings of the 11th International Conference on Parallel and Distributed Systems - Workshops - Volume 02
Exploring Mesh and Tree-Based Multicast Routing Protocols for MANETs
IEEE Transactions on Mobile Computing
Ad Hoc Networking
IEEE Communications Magazine
The core-assisted mesh protocol
IEEE Journal on Selected Areas in Communications
Review: Review of multicast routing mechanisms in mobile ad hoc networks
Journal of Network and Computer Applications
Hi-index | 0.00 |
Multicasting has been extensively studied for mobile ad hoc networks (MANETs) because it is fundamental to many ad hoc network applications requiring close collaboration of multiple nodes in a group. A general approach is to construct an overlay structure such as multicast tree or mesh and to deliver a multicast packet to multiple receivers over the overlay structure. However, it either incurs a lot of overhead (multicast mesh) or performs poorly in terms of delivery ratio (multicast tree). This paper proposes an adaptive multicast scheme, called tree-based mesh with k-hop redundant paths (TBM k ), which constructs a multicast tree and adds some additional links/nodes to the multicast structure as needed to support redundancy. It is designed to make a prudent tradeoff between the overhead and the delivery efficiency by adaptively controlling the path redundancy depending on network traffic and mobility. In other words, when the network is unstable with high traffic and high mobility, a large k is chosen to provide more robust delivery of multicast packets. On the other hand, when the network traffic and the mobility are low, a small k is chosen to reduce the overhead. It is observed via simulation that TBM k improves the packet delivery ratio as much as 35% compared to the multicast tree approach. On the other hand, it reduces control overhead by 23---87% depending on the value of k compared to the multicast mesh approach. In general, TBM k with the small value of k offers more robust delivery mechanism but demands less overhead than multicast trees and multicast meshes, respectively.