By Topic

Adaptive Routing In Ad Hoc Wireless Networks Using Ant Colony Optimization

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

2 Author(s)
Vahide Rajabi Zanjani ; Dept. of Comput. & IT, Azad Univ., Ghazvin, Iran ; Abolfazl Toroghi Haghighat

This paper presents a new adaptive and dynamic routing algorithm called AAODV for mobile ad hoc networks inspired by Ant Colony Optimization algorithms. This algorithm is proposed by maintaining the nature of the Ad hoc On-demand Distance Vector (AODV) routing through the use of Ant Colony Optimization. AAODV maintains the on-demand nature of AODV but works in an adaptive manner. It does not send any Route Request packet that AODV does. Rather it identifies its paths with the feedback of previously traveled packets and updates and maintains the paths accordingly. This routing technique is a probabilistic adaptive technique that can change its route with the change of network topology by learning the environment. We evaluate AAODV algorithm by comparing it to AODV. Our simulations show that the AAODV algorithm provides better performance in average delay, packet loss, bandwidth overhead, and throughput than the AODV algorithm.

Published in:

Computer Technology and Development, 2009. ICCTD '09. International Conference on  (Volume:2 )

Date of Conference:

13-15 Nov. 2009