基于模拟退火粒子群优化的Ad Hoc网络多播路由算法  

A QoS Multicast Routing Algorithm Based on Simulated Annealing Particle Swarm Optimization

作　　者：薛冉[1] XUE Ran(Langfang Normal University,Langfang 065000,China)

机构地区：[1]廊坊师范学院,河北廊坊065000

出　　处：《廊坊师范学院学报（自然科学版）》2018年第4期19-22,共4页Journal of Langfang Normal University(Natural Science Edition)

基　　金：河北省教育厅自然科学指导项目"确保QoS的Ad hoc网络组播路由算法研究"(Z2015153)

摘　　要：根据粒子群算法的缺点和模拟退火算法的优点,将两个算法进行结合,提出一种基于模拟退火粒子群优化的Ad Hoc网络多播路由算法,分析该算法搜索到的多播树随迭代次数的变化,并计算不同网络规模下算法达到收敛时的多播树的适应值。实验结果表明,该算法能快速找到Ad Hoc网络中满足QoS要求的最优多播树。According to the disadvantage of particle swarm algorithm and the excellence of simulated annealing algorithm,a QoS multicast routing algorithm based on simulated annealing particle swarm optimization is put forward,and the realization process is stated.The variation of multicast tree with the number of iterations is analyzed.The adaptive value of multicast tree under different network sizes is calculated The new solution of simulated annealing are produced with roulette strat-egy.The simulation shows that the optimal multicast tree satisfying the QoS requirement can be quickly found.

关 键 词：AD HOC网络 粒子群算法 QoS 多播 模拟退火算法 

分 类 号：G40-058.1[文化科学—教育学原理]