International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 51 - Number 21 |
Year of Publication: 2012 |
Authors: Suvarna P. Bhatsangave, V. R. Chirchi |
10.5120/8326-1720 |
Suvarna P. Bhatsangave, V. R. Chirchi . OAODV Routing Algorithm for Improving Energy Efficiency in MANET. International Journal of Computer Applications. 51, 21 ( August 2012), 15-22. DOI=10.5120/8326-1720
In mobile ad hoc networks (MANETs), there is no fixed infrastructure. One of the most widely used routing protocols for an ad hoc network is the Ad hoc On Demand Distance Vector routing protocol, abbreviated as AODV. In the conventional AODV routing protocol, source node forwards RREQ (Route Request) packet to find out path to the destination node. The intermediate node having less lifetime or energy, also forwards RREQ. As lifetime expires after some time i. e. node goes down; it could not forward RREP (Route Reply) on reverse path. Hence, source node has to restart RREQ rebroadcast to communicate with destination, which results in unnecessary RREQ rebroadcast, less Packet Delivery Ratio (PDR) as well as throughput and more end to end delay. Solution to above problem is given in this paper, by Optimized AODV (OAODV) routing protocol. In this, the node does not forward RREQ unless there is sufficient energy (battery lifetime), and until the node density in its surrounding exceeds a particular threshold. These two parameters are defined taking into consideration various statistics. Optimized AODV analyzes these two parameters, when implementing routing discovery, and avoiding the unnecessary information sending efficiently. By comparing AODV with optimized AODV in the same scenario, the new protocol is much better than AODV in terms of battery lifetime and throughput.