IMPROVEMENT OVER AODV ROUTING PROTOCOL FOR MOBILE AD HOC NETWORKS

Abstract

Ad hoc Networks is a group of mobile nodes with no fixed infrastructure, nodes communicate directly with one another over wireless channels. Because the transmission range of these nodes is limited, a routing. protocol is needed to enable the communication between them. Ad hoc networks have many characteristics that render routing protocols designed for wired networks inapplicable. This dissertation presents the Ad hoc On Demand Distance Vector Routing (AODV) protocol. AODV is a reactive protocol in that it discovers routes only when there is a need. AODV is well suited for mobile wireless networks in that it has low processing and memory overhead and low network utilization. In this dissertation work is carried out on the route discovery process of AODV routing protocol which plays a vital role for finding the destination of a packet when it is born into the network. "Improved route discovery in AODV" (IMAODV) is proposed. In this method the problem of repeated route discovery process is resolved when a link failure occurs. Considering IMAODV the neighborhood information is calculated by creating the neighborhood table, and named it as Improved Neighborhood Calculations in AODV (INAODV). Proposed protocols are simulated using the NS2 simulator. The performance of INAODV is compared with IMAODV and AODV. The experimental results show there is significant increase in terms of throughput and packet delivery ratio.