Dragon-AODV: Efficient Ad Hoc On-Demand Distance Vector Routing Protocol Using Dragon Fly Algorithm

Abstract

Dragonfly is one of the latest swarm intelligence techniques which exhibit the hunting and the direction-finding actions of the dragonflies. This paper proposed a modified design of Ad hoc On-Demand Distance Vector (AODV) routing protocol by modifying the AODV routing is using dragonfly algorithm (DA). The optimization has been done on the loss ratio and the delay to provide the path having minimum delay with reduced loss ratio. The algorithm has been compared with three state-of-the art techniques by using throughput, delay, loss ratio, routing overhead as the parameters. The analysis has been done on different scaled network, i.e., network having different number of nodes. The improved throughput along with the low loss ratio and delay shows the significance of the algorithm.