Adaptive Multicast Routing for MANET Based on Greedy Cover Set
These special characteristics such as distributed,multi-hop,self-organizing,dynamic topology,time-variant channels,and limited resources etc make the traditional routing algorithms and protocols for wired networks and centered wireless networks can't be used in mobile ad hoc networks directly.So the appropriative multicast routing algorithms and 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 ADMMR protocol(Adaptive Distributed Multicast Route based on Greedy Set Cover),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 ADMMR is validated by OPNET.