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

• Published in: 2010 Fourth International Conference on Genetic and Evolutionary Computing pp. 358 - 361
• Main Authors: Sun Gai-ping, Guo Hai-wen, Wang Dezhi, Wang Jiang-hua
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01-12-2010
• Subjects: Ad hoc networks; Delay; Heuristic algorithms; Load modeling; Routing; Routing protocols
• ISBN: 9781424488919; 1424488915
• DOI: 10.1109/ICGEC.2010.95

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.