基于蚁群算法的多路径多约束QoS路由研究  

Study of multiconstrained QoS multipath routing on ACO algorithm

作　　者：肖伟[1] 全惠云[1] 刘枫[1] 

机构地区：[1]湖南师范大学数学与计算机学院,长沙410081

出　　处：《计算机工程与应用》2008年第30期111-113,共3页Computer Engineering and Applications

基　　金：湖南省教育厅资助科研课题No.06C525~~

摘　　要：多路径多约束服务质量(Quality of Service,QoS)路由问题是无线传感器网络的核心问题之一,由于网络拓扑的不断变化及链路的固有的不精确性,解决这个问题具有很大的挑战性。首先给出无线传感器网络中QoS路由问题描述及调和蚁群算法(Ant Colony Optimization,ACO)的基本算法步骤及其特点。然后在分析了蚁群算法应用于QoS路由问题的可能性的基础上,给出了调和蚁群算法解决多路径多约束QoS问题的算法。最后通过仿真实例得到满意的结果。QoS routing with multiconstrained is an important issue in wireless sensor networks.The Quality-of-Service （QoS） routing in a wireless sensor network is challenge because the network topology may change constantly,and the available state infor mation for routing is inherently imprecise.First,this paper introduces QoS routing problem in wireless sensor networks,and gives basic steps and characteristics in harmonic ACO.Then,after the probability about ACO is applied to QoS routing problem in wireless sensor networks is analyzed.The algorithm is presented.This algorithm can effectively solve multconstrained QoS multipath problem.Computing simulation examples show its validity.

关 键 词：多路径多约束 QOS路由 调和 蚁群算法 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]