Congestion avoidance in AODV routing protocol using buffer queue occupancy and hop count

Abstract

Owing to network congestion, data could be loosed when its transmitted from source to destination. The reactive routing algorithm Ad hoc On-Demand Distance Vector Protocol (AODV) uses number of sequences and hops to select an optimal path. However, it doesnt consider nodes loads to choose the suited route. In addition, its efficiency declines sharply when dealing with high load and fast mobility. To face this problem, this paper presents an improved protocol Buffer Queue Occupancy-AODV (BQO-AODV) which selects optimal routes by considering the minimum value of BQO metric instead of minimum hop count. The results of tasting have shown better performance of our proposed protocol (BQO-AODV) comparing to AODV routing protocol in terms of average end to end delay, packet delivery ratio and normalized routing load.