基于多队列自适应的DTN传染路由算法  

Adaptive Epidemic Routing Algorithm Based on Multi Queue in DTN

作　　者：郭航[1,2] 王兴伟[1] 黄敏[1] 蒋定德[1] 

机构地区：[1]东北大学信息科学与工程学院,沈阳110819 [2]空军第一航空学院基础部,河南信阳464000

出　　处：《小型微型计算机系统》2012年第4期829-832,共4页Journal of Chinese Computer Systems

基　　金：国家自然科学基金项目(61070162;71071028;60802023;70931001)资助;高等学校博士学科点专项科研基金项目(20100042110025;20070145017)资助;中央高校基本科研业务费专项基金项目(N090504003;N090504006)资助

摘　　要：传染路由是DTN中一类较简单的基本路由算法.针对DTN网络环境易变的特点及传染路由的不足提出多队列自适应传染路由,采用多队列方式管理存储空间,利用效用函数对队列内信息进行排序,针对不同队列及网络情况采用相异的转发机制,从而降低网络负载率、提高传输率并降低传输时延,同时可提供简单的QoS.仿真证明本算法优于路由算法Spray andw ait和MaxProp.Epidemic routing is one of the basic Simple routing algorithms in the Delay/Disruption Tolerant Networks （DTN）. This paper proposes a multi queues adaptive epidemic routing algorithm according to the variable characteristics of DTN and shortcomings of epidemic routing, introduces multi queues into storage managements, adopts the utility function to sort the messages in queue, and uses the different forwarding policy for different queues and network conditions. The proposed routing algorithm can reduce the overhead ratio of networks and communication delay, increase the delivery ratio and offer the simple QoS. The simulation shows that the algorithm is suoerior to Sorav and walt. Maxoroo in performance.

关 键 词：容延容断网络 传染路由 多队列 

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