卫星网络中基于多QoS约束的蚁群优化路由算法  

Ant Colony Optimization Routing Algorithm Based on Multi-QoS Constraints in Satellite Networks

作　　者：魏德宾[1,2] 刘健 潘成胜 邹启杰[1,2] WEI Debin;LIU Jian;PAN Chengsheng;ZOU Qijie(College of Information Engineering,Dalian University,Dalian,Liaoning 116622,China;Key Laboratory of Communication and Network,Dalian,Liaoning 116622,China)

机构地区：[1]大连大学信息工程学院,辽宁大连116622 [2]通信与网络重点实验室,辽宁大连116622

出　　处：《计算机工程》2019年第7期114-120,共7页Computer Engineering

基　　金：国家自然科学基金(91338104);辽宁省自然科学基金(20170540034);辽宁省博士科研启动基金(201601312)

摘　　要：针对蚁群算法在求解多目标优化问题时存在收敛速度慢、容易陷入局部最优解等问题,提出一种面向卫星网络的多约束QoS路由算法。通过改进蚁群算法的启发函数,将链路QoS信息作为蚂蚁选择下一跳节点的重要依据,并结合排序思想与最大最小蚂蚁算法优化信息素更新规则,获取符合当前业务的最优QoS路径。实验结果表明,该算法在满足卫星网络业务多QoS需求的同时,具有良好的收敛速度和寻优能力。Aiming at the problems of ant colony algorithm in solving multi-objective optimization problems,such as slow convergence speed and easy to fall into local optimal solution,a multi-constrained QoS routing algorithm for satellite networks is proposed.By improving the heuristic function of the ant colony algorithm, the link QoS information is used as an important basis for the ant to select the next hop node, and the ordering idea and the maximum and minimum ant algorithm are combined to optimize the pheromone update rule to obtain the optimal QoS path in line with the current service.Experimental results show that the algorithm has good convergence speed and optimization ability while satisfying multi-QoS requirements of satellite network services.

关 键 词：卫星网络 服务质量路由 蚁群算法 启发函数 信息素 

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