By Topic

PACONET: imProved  Ant Colony Optimization Routing Algorithm for Mobile Ad Hoc NETworks

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
$33 $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)

Mobile ad hoc networks (MANETS) are infrastructureless network consisting of mobile nodes, with constantly changing topologies, that communicate via a wireless medium. Therefore, routing is a challenging issue in MANETs. Recently, nature inspired algorithms have been explored as means of finding an efficient solution to this routing problem. In this paper, we develop an improved routing algorithm for MANETs based on ant colony optimization (ACO) inspired by real ants. The performance of the routing algorithm is evaluated through simulation and is compared to an existing well known MANET routing protocol, ad hoc on-demand distance vector (AODV). Several performance metrics are considered in different scenarios with varying mobility levels and traffic load.

Published in:

22nd International Conference on Advanced Information Networking and Applications (aina 2008)

Date of Conference:

25-28 March 2008