针对Ad Hoc网络组播组发现的蚁群算法  

ACO algorithm for discovery of multicast group in Ad Hoc network

作　　者：原萍[1] 海龙[2] 

机构地区：[1]上海工程技术大学城市轨道交通学院,上海201620 [2]东北大学信息科学与工程学院,沈阳110819

出　　处：《计算机应用》2010年第6期1447-1450,共4页journal of Computer Applications

基　　金：上海市教育委员会重点学科建设项目(J51401)

摘　　要：针对将蚁群算法应用于AdHoc网络组播寻路中存在无法同时找到多目标的局限性,提出了一种采用逆向寻路的解决方案。当前进蚂蚁在到达接收端时,会自动复制出若干个返回蚂蚁并进行回溯,而这些返回的蚂蚁并不是按原路返回,而是进行反向的寻路,同时原前进蚂蚁将继续寻找其他多目标并进行相同的操作。仿真结果与原始蚁群算法进行了比较,可以发现在延迟、带宽消耗、发包数上逆向蚁群算法要优于原始蚁群算法。仿真实验表明,改进的蚁群算法减少了为寻找多目标所造成的延迟,并且提高了算法的收敛速度。Ant colony algorithm applied to Ad Hoc network multicast routing has its own limitation that multi-objective could not be found at the same time.With regard to the limitation,an improved scheme called Contrary Ant Colony Optimization （CACO） routing algorithm was proposed.Some backward ants would be copied to find the routing from the contrary direction when a forward ant reached a destination node.After that the forward ant continued to find other multicast destinations with the same operation.The simulation results were compared with that of the original ant colony algorithm.Delay,overhead and packet number of CACO were better than ACO.The results indicate that CACO reduce the delay of finding multi-objective and enhance the convergence rate of the ant colony algorithm.

关 键 词：组播路由 移动自组织网络 蚁群算法 前进蚂蚁 返回蚂蚁 

分 类 号：TP393[自动化与计算机技术—计算机应用技术] TP18[自动化与计算机技术—计算机科学与技术]