Affiliation:
1. Jilin Teachers’ Institute of Engineering and Technology
Abstract
By studying multicast routing algorithm for MANET, this paper proposes a new heuristic algorithm to improve MAODV performance. Algorithm calculate the cost function under the delay constraint conditions, dynamically adjust the leader node, thus reducing crowded areas produce, for MAODV provide Qos. Simulation results show that when the expansion of the network, this algorithm has less routing overhead, high efficiency.
Publisher
Trans Tech Publications, Ltd.
Reference9 articles.
1. Elizabeth M. Royer and Charles E. Perkins. Multieast Ad hoc On-Demand Distance Vector (MAODV) Routing. IETF Internet Draft, draft-ietf-manet-maodv-00. txt, July (2000).
2. Corson S, Macker J. Mobile ad hoc networking(MANET): Routingprotocol performance issues and evaluation considerations[R]. gniversity of Maryland: Naval Research Laboratory, (1999).
3. Hongyi Yu. Wireless Mobile Self-organizing Network [M]. Beijing: People's Post and Communicaticaion Press, 2005: 328-338.
4. Stefano Basagni, Marco Conti, Silvia Glordano, Ivan Stojmenovic. Mobile Ad Hoc Networking[M]. Xian: xi'an jiao tong university press, (2012).
5. Zhang Pin, Li Le-min, Wang Sheng. A Branch Optimization Algorithm for the Delay Constrained Multicast Routing Problem[J]. ACTA ELECTRONICA SINICA, 2006. 34(6): 1115-1118.