loading...
PACONET: imProved??Ant Colony Optimization Routing Algorithm for Mobile Ad Hoc NETworks
March 25-March 28
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/AINA.2008.7722nd International Conference on Adva ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
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.
Index Terms:
ACO, MANET, performance evaluation
Citation:
Eseosa Osagie, Parimala Thulasiraman, Ruppa K. Thulasiram, "PACONET: imProved??Ant Colony Optimization Routing Algorithm for Mobile Ad Hoc NETworks," aina, pp.204-211, 22nd International Conference on Advanced Information Networking and Applications (aina 2008), 2008
Usage of this product signifies your acceptance of the Terms of Use.