Authors: Zhang Yi; Liu Yan-chun
Addresses: Department of Computer Science, Jilin Business and Technology College, Changchun 130062, China; Military Simulation Technology Institute, Air Force Aviation University, Changchun 130022, China ' Military Simulation Technology Institute, Air Force Aviation University, Changchun 130022, China
Abstract: In this paper, some improvements on Ant Colony Optimisation (ACO) are presented and we use the improved algorithm to solve the multicast routing problem. The improvements are given as follows: A novel optimised implementing approach is designed to reduce the processing costs (the bandwidth, delay, mincost) involved with routing of ants in the conventional ACO. Based on the model of network routing, the set of candidates is limited to the nearest c points in order to reduce the counting of other points. And we also use the flags on the blocked points in order to prevent selecting these points. Simulations show that the speed of convergence of the improved algorithm can be enhanced greatly compared with the traditional algorithm.
Keywords: ant colony optimisation; ACO; multicast routing; QoS constraints; quality of service; self-adaptive; simulation.
International Journal of Wireless and Mobile Computing, 2011 Vol.5 No.1, pp.18 - 23
Available online: 09 Dec 2011 *Full-text access for editors Access for subscribers Purchase this article Comment on this article