DTN网络中ED算法的分析与改进  

Analysis and Improvement of Earliest-Delivery Routing Algorithm Based on DTN

作　　者：陈元甲[1] 刘卫国[1] 施荣华[1] 

机构地区：[1]中南大学信息科学与工程学院,湖南长沙410083

出　　处：《计算机系统应用》2010年第10期242-245,共4页Computer Systems & Applications

基　　金：国家自然科学基金(60173041)

摘　　要：详细研究了延迟容忍网络(DTN)的一种确定性路由算法—ED(Earliest-Delivery),分析了其计算延时开销函数,并在此基础上充分考虑了传播延时、节点之间链路的连接规律,引入链路连接状态表来选取路由决策时刻,优化延时开销的计算。实验结果表明,改进后的ED算法可以有效地降低延时,提高路由成功率。This paper focuses on one ofDTN＇ s deterministic routing algorithms--ED （Earliest-Delivery） and makes an analysis of its calculation of the delay cost function. To select the accurate time of routing decision-making and optimize the calculation of delay cost, a link connection state table is employed. On this basis, the transmission delay and rules of node-link connection are taken into account. Experimental results show that the improved ED can effectively reduce the delay and improve routing success rate.

关 键 词：延迟容忍网络 路由算法 延时开销 最早传递算法 

分 类 号：TN929.5[电子电信—通信与信息系统]