Adaptive Distributed Multicast Routing Protocol for MANET Based on Greedy Set Cover

These special characteristics such as distributed, multi-hop, self-organizing, dynamic topology, time-variant channels, and limited resources etc make the traditional routing algorithms or protocols for wired networks and centered wireless networks canpsilat be used in mobile ad hoc networks directly. So the appropriative multicast routing algorithms or protocols for mobile ad hoc networks must be designed. In the paper, Combining merits between the mesh-based and the tree-based MANET multicast protocol, we proposed ADMRP (adaptive distributed multicast routing protocol), whose node can computes forward list dynamically and distributed. This mechanics can save the limited bandwidth, decrease the channel collision and reduce the total overhead of the MANET. At last, the ADMRP is validated by OPNET.