By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Abdel-Moniem, A.M. ; Dept of Comput. Sci., Assiut Univ., Assiut, Egypt ; Mohamed, M.H. ; Hedar, A.-R.

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).

Published in:

Intelligent Systems Design and Applications (ISDA), 2010 10th International Conference on

Date of Conference:

Nov. 29 2010-Dec. 1 2010