基于蚁群算法的容迟网络概率路由算法  

Probabilistic Routing Algorithm Based on Ant Colony Algorithm in DTN

作　　者：宋鑫[1] 王炳庭[1] 胡勇[1] 王贵竹[1] 

机构地区：[1]安徽大学计算智能与信号处理教育部重点实验室,合肥230039

出　　处：《计算机工程》2013年第4期90-93,99,共5页Computer Engineering

基　　金：国家自然科学基金资助项目(61071168);安徽大学"211工程"学术创新团队基金资助项目;安徽大学"211工程"三期质量工程基金资助项目(40010014;39010014);安徽大学通信工程重点建设专业基金资助项目(39020014)

摘　　要：容迟网络的概率路由算法根据节点与信宿节点之间相遇的概率判断是否转发报文,但相遇概率不能真正准确地反映报文递交成功的概率。针对该问题,提出一种基于蚁群算法的概率路由算法,结合蚁群算法的基本原理改进信息素浓度的更新机制和报文转发机制。仿真结果表明,与传统的概率路由算法相比,改进后的概率路由算法报文递交率较高,开销率较小。The probabilistic routing algorithm in Delay Tolerant Network（DTN） called PROPHET, determines whether to forward messages according to the encounter probability between node and destination. However encounter probability can not accurately show the successfully delivered probability. Aimming at this problem, PROPHET-ACA is proposed, and it combines the fundamental of ant colony algorithm with probabilistic routing. The rule both in pheromone update and in message transmission is modified. Simulation results show that compared with to the PROPHET, in PROPHET-ACA, the delivery probability of message is obviously increased higher and the overhead ratio is decreased.

关 键 词：容迟网络 概率路由 蚁群算法 贝叶斯因子 选择概率 信息素浓度更新 

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