一种基于路径目的节点数的改进蚁群算法  

An Improved Ant Colony Algorithm Based on Numbers of Target Nodes on Routes

作　　者：朱先飞[1] 张钺[2] 邓远意 柯峰[2] 

机构地区：[1]中国电信股份有限公司广东研究院,广州510000 [2]华南理工大学电子与信息学院,广州510630

出　　处：《电讯技术》2014年第8期1146-1151,共6页Telecommunication Engineering

基　　金：国家高技术研究发展计划(863计划)项目(2012AA12A203)~~

摘　　要：组播技术是无线Mesh网的关键技术之一,它可以大大提高信息的传播效率。介绍了信息组播的主要步骤,指出蚁群算法是构建路由组播树的高效启发式算法。对传统的蚁群算法进行定性分析,并对其进行改进,在计算路径费用以及信息素更新时考虑路径上的目的节点个数,路径上的目的节点数越多,其信息素增长速率越快。两个例子的仿真结果表明,该改进算法与传统蚁群算法相比分别使费用和代价减少了28.57%和22.36%,改善了系统性能。Multicast technology is one of the key technologies of wireless mesh network （MSN） and it can improve the efficiency of transmitting information significantly. This paper introduces the main steps of muhicast and points out that ant colony algorithm（ANA） is an efficient heuristic algorithm for constructing a muhicast tree. The traditional ANA is analyzed qualitatively and improved by taking the target nodes on one route under consideration when calculating the route＇ s cost and updating the pheromone. The more target nodes on one route, the faster the increasing rate of pheromone on this route. The simulation results of two examples show that the improved algorithm can reduce the cost and price by 28.57% and 22.36% respectively compared with ANA, thus improving the performance of muhieast system.

关 键 词：无线MESH网 组播路由 组播树 蚁群算法 

分 类 号：TN915[电子电信—通信与信息系统] TP393[电子电信—信息与通信工程]