Improving AODV Route Recovery Mechanisms with Connectivity and Particle Swarm Optimization

Main Article Content

Nadilma C. V. N. Pereira
Carmelo J. A. Bastos-Filho
Renato M. de Moraes

Abstract

This paper proposes a new function for the Ad Hoc On-Demand Distance Vector (AODV) algorithm using the connectivity concept to decide between source and local repair when a link break occurs. Besides, we used a Computational Intelligence algorithm, called Particle Swarm Optimization (PSO), which enables to find candidate solutions in all considered search space in order to reduce average data packet delivery delay sent over the network. The performance of the original AODV protocol, according to its Request for Comments (RFC), is compared with this new implemented approach, called here as AODVPSO. Three metrics were used to evaluate the performance of the algorithm: throughput (as data packet delivery fraction), routing overhead and average data packet delivery delay. We observed that the AODV-PSO outperformed the original AODV protocol in the scenarios studied in this paper.

Article Details

How to Cite
C. V. N. Pereira, N., J. A. Bastos-Filho, C., & M. de Moraes, R. (2015). Improving AODV Route Recovery Mechanisms with Connectivity and Particle Swarm Optimization. Journal of Communication and Information Systems, 27(1). https://doi.org/10.14209/jcis.2012.3
Section
Regular Papers

Most read articles by the same author(s)