Performance evaluation of realistic manet using modified adaptive position updation in geographic routing

Now a days, Position based routing is apt for capacious mobile ad-hoc networks. Geographic routing has been widely acclaimed as the most promising draw near to scalable wireless position based routing. In geographic routing, nodes need to keep current positions of their immediate neighbors for making forwarding decisions effectively. Static broadcasting of beacon packets that contain the geographic location coordinates of the nodes is a common technique used by geographic routing protocols to maintain neighbor positions. A beaconing strategy which ignores the node mobility and traffic forwarding patterns in the network is not enchanting from both update cost and routing performance points of view. I put forward a dynamic position updation mechanism known as Modified Adaptive Position Update (MAPU) strategy. In which the duration of position updation is based on the mobility dynamics of the nodes and the forwarding traffic patterns in the network. M APU is based on three axioms: (i) find out an efficient data forwarding path which contains low mobile nodes, (ii) nodes whose dynamisms are difficult to adumbrate update their location co ordinate more frequently (and vice versa), and (iii) nodes very abreast to data forwarding paths update their positions more frequently (and vice versa). NS2 simulation is used for the theoretical analysis of the geographic routing protocol, Greedy Perimeter Stateless Routing Protocol (GPSR) including MAPU approach. I used to compare the above with periodic beaconing and other recently proposed updating schemes. The result shows that MAPU can significantly reduce the update cost and advance the routing performance in terms of packet delivery ratio and average end-to-end delay. Also further researches are mainly related to the evaluation in realistic network scenarios, which account for sparse network, realistic radio propagation, localization error.