Author: Yi Zhang Yan-chun Liu
Publisher: Inderscience Publishers
ISSN: 1741-1084
Source: International Journal of Wireless and Mobile Computing, Vol.5, Iss.1, 2011-12, pp. : 18-23
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
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.