WMN下一种差异度蚁群QoS路由算法IARQM  

An Improved ACO Routing Algorithm Based on Multi-constrained Qo S for Wireless Mesh Network

作　　者：段汐[1] 杨群[1] 陈兵[1] 钱红燕[1] 李媛祯 

机构地区：[1]南京航空航天大学计算机科学与技术学院,南京210016

出　　处：《小型微型计算机系统》2014年第12期2633-2638,共6页Journal of Chinese Computer Systems

摘　　要：为了支持无线Mesh网络(Wireless Mesh Network,WMN)中多媒体实时应用,必须提供更好的服务质量(Quality of Service,Qo S).为此,提出一种基于差异度蚁群的WM N多约束Qo S路由算法(Improved ACO Routing Algorithm Based on M ulti-Constrained Qo S for Wireless M esh Netw ork,IARQM),该算法利用归一化后的路径Qo S信息和路径差异度调节信息素增量,并用其替代目标函数,在发挥最优路径激励作用的同时提高了算法效率.IARQM根据节点类型对下一跳节点选择进行调整,能充分适应WMN特点,并在链路失效后利用邻居管理提供恢复容错机制,具有很强的健壮性.实验结果表明,与ARMAN、QSS路由算法和AODV路由协议相比,IARQM能更好地支持WM N多约束Qo S路由,并有效提升网络性能.To support real-time multimedia applications for wireless mesh network （ WMN ）, higher quality of service （ QoS ） should be guaranteed. In this paper, we proposed an improved ACO （ Ant colony optimization ） routing algorithm based on multi-constrained QoS for wireless mesh network（ IARQM）. The algorithm uses the normalized path QoS information and the degree of difference between the paths to calculate the pheromone increment. Then we substitute the pheromone increment for objective function. Our algorithm can fully adapt to WMN topology by using different methods for various node types, and provides a special local connection management. Link recovery time can be given after the failure to improve the robustness of the algorithm. Simulation results demonstrate that the proposed algorithm is more feasible and effective than ARMAN（ Ant Routing for Mobile Ad Hoc Networks ）, QSS （Ant Colony based Multi Constraints QoS Aware Service Selection） and AODV （ Ad hoc On-Demand Distance Vector Routing）.

关 键 词：多约束Qo S路由 无线MESH网络 蚁群算法 差异度 邻居管理 

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