ENHANCEMENT OF AODV ROUTING PROTOCOL FOR SPARSE AD HOC NETWORKS

Abstract

Ad hoc On-demand Distance Vector routing (AODV) is a widely used and popular network routing protocol for Mobile. Ad hoc Network (MANET). This protocol relies on the assumption that nodes are scattered over theentire region and there exists end-to-end connectivity in the network.This routing .scheme will fail when network is partially connected. The aim of this dissertation is to design and implement a routing protocol that improves performance of AODV for sparse ad hoc networks. We propose an extension to Ad hoc On demand Distance Vector algorithm (AODV), named Enhanced Ad hoc On demand Distance Vector algorithm (EAODV), to remove above assumptions. We follow a store andforward method to deliver the message to the destination, when sourceand destination are not connected. We will develop a module which extends AODV and help in communicating in cases where network ispartitioned or partially connected. Analysis and Comparison is done for AODV and proposed Enhanced AODV protocols. Results show that Enhanced AODVprotocol improves the end-to-end delay.