Model For Geographic Routing In Mobile Ad Hoc Networks Using Adaptive Position Update

For making effective forwarding decisions in geographic routing, nodes need to maintain up-to-date positions of their immediate neighbors. Periodic broadcasting of beacon packets that contain the geographic location coordinates of the nodes is a popular method used by most geographic routing protocols to maintain neighbor positions, but it is found that when mobile nodes are taken in to consideration the periodic broadcasting of beacon packet is not is not attractive from both update cost and routing performance , to eliminate this problem we propose this model which uses Adaptive Position Update .The Adaptive Position Update works on two principles: (i) nodes whose movements are harder to predict update their positions more frequently (and vice versa), (ii) nodes which are static and closer to the forwarded path update their position more frequently (and vice versa). This paper focus on the working of the model based on this strategy the working efficiency of this model is validated by NS2 simulations .The simulations results (in comparison with GPSR (Greedy Perimeter Stateless Routing Protocol)), shows that our model can significantly reduce the update cost and improve the routing performance in terms of packet delivery ratio and average end-to-end delay when compared with other beaconing schemes.