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.
Moh, Sangman; Lee, Sang Jun; and Yu, Chansu, "Adaptive Multicast on Mobile Ad Hoc Networks Using Tree-Based Meshes With Variable Density of Redundant Paths" (2009). Electrical Engineering and Computer Science Faculty Publications. 44.
Moh, S., Lee, S. J., , & Yu, C. (2009). Adaptive multicast on mobile ad hoc networks using tree-based meshes with variable density of redundant paths. Wireless Networks, 15(8), 1029 - 1041. doi:10.1007/s11276-008-0100-y
The final publication is available at Springer via http://dx.doi.org/10.1007/s11276-008-0100-y