By Topic

A Dynamic Ant Colony Optimization Algorithm for the Ad Hoc Network Routing

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

4 Author(s)
Sun Gai-ping ; Dept. of Comput. & Sci., North China Inst. of Sci. & Technol., Beijing, China ; Guo Hai-wen ; Wang Dezhi ; Wang Jiang-hua

The Ad Hoc network is a dynamic topology and self organization network. In allusion to the Ad Hoc network dynamic movement characteristic, present an ant colony Optimization algorithm (ANRBA) for the Ad Hoc network routing based on the network link and node status. In the ANRBA, it uses the load accepted rate, topology variety rate and routing delay time as measurement value to select the routing paths. It replaces the routing table with a pheromone table. After the establishment of the routing path, use the ant colony algorithm to gather the routing path measurement and dynamically update the pheromone table, which realizes the network load dynamic distribution. The simulation results show that the ANRBA algorithm is much better in the packet switching rate and average delay time. And it is an effective Ad Hoc network routing algorithm.

Published in:

Genetic and Evolutionary Computing (ICGEC), 2010 Fourth International Conference on

Date of Conference:

13-15 Dec. 2010