Abstract
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. General Terms Ad hoc network routing protocol, Wireless ad hoc networks et. al.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
