Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

Ant routing algorithm for mobile ad-hoc networks based on adaptive improvement

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

2 Author(s)
Zeng Yuan-yuan ; Sch. of Comput., Wuhan Univ., China ; He Yan-xiang

A mobile ad-hoc network is a collection of mobile nodes without any existing infrastructure or central administrator. A lot of research work has been developed to find a path between end points, which is aggravated through the flexible node mobility. In this paper, an ant colony algorithm adaptive improvement on routing is presented (ARAAI). It is based on swarm intelligence and especially on the ant colony based meta-heuristic. Considering the stagnation behavior of ant colony algorithm, the method of adaptive parameters coordination is put forward to construct a globally optimizing algorithm. The ns-2 simulation results show the routing protocol is highly efficient and scalable comparing with existing AODV and DSR protocol.

Published in:

Wireless Communications, Networking and Mobile Computing, 2005. Proceedings. 2005 International Conference on  (Volume:2 )

Date of Conference:

23-26 Sept. 2005