Optimization in conventional AODV using probability and drop factor

  Reena Karandikar,  Praveen Malviya

There's one significant difficulty and problem in AODV i.e. Efficiency. The distinct traits of AODV reward a new set of great and principal challenges to protocol design; these incorporate open peer-to-peer network structure, shared wi-fi medium, stringent useful resource constraints, and totally dynamic network topology. In this Dissertation, we attention upon the congestion manipulate hassle in on-demand distance vector routing (AODV) protocol for cellular and wireless ad hoc networks. We endorse to look at mechanisms to deal with the congestion hassle inside AODV routing protocol. First, we look at a randomized technique of AODV protocol. Then we present a preemptive ad hoc on-call for distance vector routing protocol for cell ad hoc networks. We discuss the implementation of each algorithm, and file on the overall performance results of simulation of numerous scenarios the usage of the ns-2 ad hoc network simulator. AODV protocol is increased with a drop factor that induces a randomness characteristic to result in our proposed ad-Hoc On-Demand Routing protocol. Throughout the route discovery method, each intermediary or router nodes between the supply and the vacation spot nodes makes a determination to either broadcast/ahead the RREQ packet further closer to the destination or drop it.

Keywords- AODV, Drop Factor and RREQ

Unique Identification Number - IJEDR1701087
Page Number(s) - 577-579
Pubished in - Volume 5 | Issue 1 | March 2017
DOI (Digital Object Identifier) -   
Publisher - IJEDR (ISSN - 2321-9939)

  Reena Karandikar,  Praveen Malviya,   "Optimization in conventional AODV using probability and drop factor", International Journal of Engineering Development and Research (IJEDR), ISSN:2321-9939, Volume.5, Issue 1, pp.577-579, March 2017, Available at :http://www.ijedr.org/papers/IJEDR1701087.pdf