A Multi-constrained Multicast Routing Algorithm Based on Mobile Agent for Ad Hoc Network

A multicast routing algorithm is proposed with multiple constraints based on mobile agents. In this algorithm, source nodes utilize the information in node cache to create multicast trees with constraints on bandwidth and power. The QoS strategy extends the survival time of network. When links fail during data transmission, the algorithm will repair the original path locally rather than reroute the data, which will effectively reduce the probability of data retransmission and rerouting. We conduct experiments with network simulators to evaluate the performance of the algorithm. The experimental results show that our algorithm is more effective and robust than MAODV.