An ant colony optimization algorithm for the mobile ad hoc network routing problem based on AODV protocol

In this paper, we present a modified on-demand routing algorithm for mobile ad-hoc networks (MANETs). The proposed algorithm is based on both the standard Ad-hoc On-demand Distance Vector (AODV) protocol and ant colony based optimization. The modified routing protocol is highly adaptive, efficient a...

Full description

Saved in:
Bibliographic Details
Published in2010 10th International Conference on Intelligent Systems Design and Applications pp. 1332 - 1337
Main Authors Abdel-Moniem, Ahmed M, Mohamed, M H, Hedar, A
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.11.2010
Subjects
Ad hoc networks
Ant Colony Optimization
Load modeling
Mobile Ad-hoc Network
Mobile communication
Mobile computing
Routing
Routing protocols
Online AccessGet full text
ISBN1424481341
9781424481347
ISSN2164-7143
DOI10.1109/ISDA.2010.5687094

Cover

More Information
Summary:In this paper, we present a modified on-demand routing algorithm for mobile ad-hoc networks (MANETs). The proposed algorithm is based on both the standard Ad-hoc On-demand Distance Vector (AODV) protocol and ant colony based optimization. The modified routing protocol is highly adaptive, efficient and scalable. The main goal in the design of the protocol was to reduce the routing overhead, response time, end-to-end delay and increase the performance. We refer to the new modified protocol as the Multi-Route AODV Ant routing algorithm (MRAA).
ISBN:1424481341
9781424481347
ISSN:2164-7143
DOI:10.1109/ISDA.2010.5687094