Improved On-demand Routing Protocol in Mobile Ad-hoc Network

In mobile ad-Hoc network there is no fixed topology and infrastructure. One of the most important and efficient routing protocol on the basis of energy and number of nodes is AODV distance vector routing protocol source nodes forward In this routing algorithm first it sends the route request (RREQ) to the neighbor with the range of the source and the nodes and then finds the path from one node to another. The intermediate nodes having less energy also forward packets. As the lifetime expires it falls down and the power and energy is not used in the efficient transfer of message and data. It could not forward RREP on reverse path. Hence source node has to restart again and again which results in unnecessary rebroadcast efficiency is less and packet delivery ration is also less and throughput is also less and more end to end delay. Solution of the above problem in AODV protocol is OAODV routing protocol optimized one in this node does not forward as soon as request (RREQ) reached their first it checked there is a sufficient energy (battery lifetime) and until the node density is greater than the threshold value. These two taking into consideration various statistics . Optimized AODV analyses the energy and node density by avoiding the unnecessary information sending efficiently. By comparing energy ratio and node density it proves that OAODV is much better than AODV protocol on the basis of battery lifetime, throughput, and PDR.