Research On The Improvement Of Multicast Routing Algorithm Ad Hoc Network

People's demand for mobile communication technology is growing each day as information technology develops. The mobile communication technologies we often refer to are generally centralized control, based on pre-setup network infrastructure. But for some special applications, these centralized control technologies are not suitable. For example, troops on the battlefield to initiate and advance, a large earthquake or floods, disaster rescue, wilderness expedition, as well as large-scale meetings. As an important branch of mobile communications, Ad Hoc networking technology can meet the needs of these special occasions.Multicast service is to support multi-party communication efficiently. Multicast in multi-communication can not only to reduce the source system's processing load, but also reduces the network bandwidth usage, especially in the mobile Ad Hoc networks, which the communication bandwidth is constrained.Tree-based multicast routing provides fast and most efficient way of routing establishment for the communications of mobile nodes in wireless Ad Hoc networks. MAODV (Multicast Ad Hoc On-demand Distance Vector) is one commonly known tree-based multicast routing protocol, which has minimal control overhead and route acquisition latency. The main task of this paper is to analyze several pros and cons of multicast routing algorithms, and propose one new routing algorithm to be more adapted to the bandwidth-constrained mobile Ad Hoc network. This paper presents a way to improve the throughput of the system and reduce the number of mobile nodes participating in multicast routing algorithms, which will significantly reduce the routing-related control overhead. A systematic performance evaluation is done by performing certain simulations under NS-2.The applicability of these protocols to diverse situation are also studied and discussed.