An enhancement of AODV routing protocol for wireless ad hoc networks

Abstract

Wireless ad hoc network is an infrastructure less, self organized, multi hop packet switched network. In an ad hoc network, node movement results in dynamic topology and cause link failures. In this paper, we are using packet scheduling technique for Ad Hoc on Demand Distance Vector (AODV) routing protocol. We are using weight hop based scheduling for AODV routing protocols. In this paper, intermediate node starts the packet scheduling and manages its buffer memory according to data transfer rate. For link break, intermediate store the data packets and repair the broken route and manage over flow of data packets. We try to send the data packet by using alternate routes instead of dropping it. We analyze the proposed technique on NS-2.34 simulator. Simulation results show that proposed scheme performance is better than AODV.