电子学报2011，Vol.39Issue(8)：1858-1863,6.
认知网络中的拥塞规避多径路由算法
Multiple-Path Routing Algorithm with Congestion Avoidance in Cognitive Networks
摘要
Abstract
The delay and loss of data {jackets, which caused by the links congestion, will lower down die users' QoS. While the present link state routing algorithms don't possess congestion avoidance mechanism.This paper proposes an ant-based multiple-path routing algorithm with congestion avoidance, in order to solve the above problems. It improves the ant colony algorithm, and adopts double-way ant-exploration method to speed up the exploration of optimal routes. The new searching routings guidance better satisfies the demands of QoS. Simulation contrast with OPNET shows that the algorithm is valid and effective at controlling packet loss ratio,delay and residual bandwidth.关键词
认知网络/蚂蚁算法/多径路由/拥塞规避Key words
cognitive networks/ ant colony algorithm/ multiple-path routing/ congestion avoidance分类
信息技术与安全科学引用本文复制引用
王传臣,张润彤,李丹丹,曹峰..认知网络中的拥塞规避多径路由算法[J].电子学报,2011,39(8):1858-1863,6.基金项目
国家自然科学基金(No.60773033) （No.60773033）
国家863高技术研究发展计划(No.2009AA01Z211) （No.2009AA01Z211）
中央高校基本科研业务费专项资金(No.2009YJS034) （No.2009YJS034）
