Research And Improvement On Low Overhead AODV Routing Algorithm Of Mobile Ad Hoc Networks

Mobile Ad Hoc network(MANET)is a multi-hop temporary self-organized network which is consisted of mobile nodes with wireless transmitters and receivers.Ad hoc on-demand distance vector(AODV)protocol is the most widely used routing protocol in MANET but it also has some shortcomings.AODV protocol is flooding route request to propagate message in routing discovery,if the node density of MANET is high,AODV protocol increases overhead which can cause broadcast storm problem.AODV protocol repairs the route after it break,so it causes losing more packets and increasing overhead.This paper researches how to solve the problems deeply.The details are described as follows:1.In order to solve the broadcast storm problem caused by simple broadcast in routing discovery phase,a location-aided probabilistic broadcast(LAPB)algorithm for MANET is proposed in this paper.Based on the location information and neighbor knowledge LAPB dynamically adjusts the broadcast probability of nodes in a specific area to select more effective nodes.Destination node selects an optimal route based on hops and delay.Simulation results demonstrate that LAPB algorithm can reduce overhead and discovery delay in the route discovery phase.2.In order to reduce the overhead and lost packets caused by AODV protocol in route maintenance,a prediction-aided routing(PAR)algorithm is proposed in this paper.PAR designs the time of repairing a route according to the hop of a node,and the time is used to compute the threshold which decides to repair the route before it becomes broken.Simulation results demonstrate that PAR could reduce 3~5% overhead of network than the traditional prediction algorithm and ensure the reliability of network.