An Improvement of Ad Hoc on-Demand Vector Routing Protocol with Buffer Queue Metric

EasyChair Preprint 15793

Abstract

The ad hoc on-demand distance vector (AODV) is a routing protocol that is usually used in the mobile ad hoc networks (MANETs) and other wireless ad hoc networks. The AODV is a reactive protocol, so a source node will use control messages to find routes to a destination node whenever there are data packets that are needed to transmit. If there is more than one route to the destination node, the source node chooses the shortest route (the route has the fewest number of hops). However, this selection is not ideal in some cases. Considering there is a defected node or unavailable node in the shortest route, the path from the source node to the destination node becomes unstable. To avoid this problem, an enhancement of the AODV is proposed. The proposed solution uses another metric besides the number of hops to find the best route. The new metric is the degree of the queue in the buffers of involved nodes. The nodes that have the queued buffers are relatively busier than other nodes, so they should not be considered in the procedure of the new path establishment. In this paper, the performance of the proposed solution is evaluated using the NS-3 simulator, and the performance results show that the solution improves the performance of the network more than the AODV.

Keyphrases: AODV, MANET, Routing, protocol, simulation

@booklet{EasyChair:15793,
  author    = {Van Vuong Ngo},
  title     = {An Improvement of Ad Hoc on-Demand Vector Routing Protocol with Buffer Queue Metric},
  howpublished = {EasyChair Preprint 15793},
  year      = {EasyChair, 2025}}