Ad Hoc网络中基于双向收敛蚁群算法的QoS路由算法  

A QoS Routing Based on Bi-directional Convergence Ant Colony Algorithm for Ad Hoc Networks

作　　者：孙艳歌[1] 刘明[1] 许芷岩[1] 

机构地区：[1]华中师范大学计算机科学系,湖北武汉430079

出　　处：《微电子学与计算机》2006年第10期1-3,共3页Microelectronics & Computer

摘　　要：蚂蚁算法是一种新型随机优化算法,能有效解决AdHoc网络多约束的QoS路由问题,但存在收敛速度慢和易陷入局部最优等缺点。针对于此,在借鉴精英策略的基础上提出了一种基于双向收敛蚁群算法,并将该算法应用于AdHoc网络的QoS路由问题中。仿真结果表明,算法可明显提高数据包的投递率,降低端到端的传输时延。Ant colony algorithm is a new optimization algorithm, can effectively solves the problem of QoS routing with multiple constrains. A QoS routing based on bi-directional convergence ant colony algorithm for Ad Hoc networks was proposed to accelerate the convergence rate of the algorithm. Simulation results show that the proposed algorithm can obviously improve packet delivery ratio and reduce end to end delay.

关 键 词：AD HOC QOS路由 蚁群算法 双向收敛 

分 类 号：TP31[自动化与计算机技术—计算机软件与理论]