一种蚁群算法优化的高效防拥塞QoS路由算法  

An Efficient Anti-Congestion QoS Routing Algorithm Based On Ant Colony Optimization

作　　者：邱泽敏[1] 

机构地区：[1]中山大学新华学院,广东广州510520

出　　处：《计算机仿真》2015年第10期296-300,共5页Computer Simulation

摘　　要：针对现有无线路由算法存在搜索速度慢且易出现节点拥塞的问题;提出了一种基于蚁群算法优化的高效防拥塞Qo S路由算法。上述算法根据蚁群算法的正反馈机制与相互协作特性,来提高传统Qo S路由算法的搜索准确性;通过引入双向的蚁群来解决前期搜索效率慢的问题,并通过采用防拥塞的赏罚机制来对路径的最优提供良好的基础。实验结果表明,其实验结果与预期效果基本相符,上述算法能够在保证网络质量的同时,有效减少网络节点的负载压力。通过与其它算法进行比较,改进算法在搜索时间与耗能上具有一定的优势。Existing wireless routing algorithm has problems that search slow and prone node congestion. In response to this phenomenon, this article puts forward an efficient anti - congestion QoS routing algorithm based on ant colony optimization. This algorithm improves search accuracy of traditional QoS routing algorithm according to the positive feedback mechanism and mutual collaboration features of ant colony algorithm. It uses the bidirectional ant colony to solve the problem of early search efficiency to slow. And it uses reward and punishment mechanism to pre- vent network congestion. Experimental results show that the experimental results are basically consistent with the ex- pected effects. The algorithm can guarantee the quality of the network, and effectively reduce the load pressure of network nodes. After comparing with other algorithms, this algorithm has certain advantages in the search time and energy.

关 键 词：无线路由 蚁群算法 防拥塞 

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