Analysis And Improvement Of Mobile Ad Hoc Network Routing Protocol

Mobile Ad hoc Network is a kind of slef-organized communication network without center. Because of its high-performance self-organization, supporting dynamic topo structure change, multi-hop forwarding technology and ability of robustness and anti-destroying, it is widely applied in the fileds of military, accident environments and civil wireless data communication.But because of transmission characteristics of wireless channel, and uncertainty of node position, network topo structure is in unstable status, so traditional route protocols can not be fit for the characteristics of mobile ad hoc network. Existing ad hoc network protocols also have their limits, and are still in research. So how to modify existing route protocols in order to improve the robustness, so that the network can be more stable and reliable under bad circumstances. Improving the network service is the pupose of this paper.In this paper, we firstly introduce the history and development of ad hoc network, its structure and architecture, discuss and compare series of ad hoc route protocols.Then we introduce Ad hoc On - demand Distance Vector Routing (AOD V) in detail, including its components, characteristics, problems and disadvantages.Through analyzing and comparing, we put forward our modified algorithm improving the performance based on retreat algorithm, route discovery and slef route reparing. In our algorithm, with the link state information of mobile wireless nodes, we use paramers such as the route failure time, the route freshness during the route discovery procedure, in order to assure the quality of routes and provide backup nodes. While monitor that the link will fail, the algorithm starts a local repair in a small scope to reduce the delay and packet lost. The algorithm is consist of 3 components: link state analyse, route discovery, route repaire.In the end, we design a simulation experiment to prove our conclusion. The simulation result shows that: with the modified route protocol, we get less route information and higher input and output performance, under varius node densities, speeds and load.