###
DOI:
计算机系统应用英文版:2010,19(10):242-245
本文二维码信息
码上扫一扫!
DTN网络中ED算法的分析与改进
(中南大学 信息科学与工程学院 湖南 长沙 410083)
Analysis and Improvement of Earliest-Delivery Routing Algorithm Based on DTN
摘要
图/表
参考文献
相似文献
本文已被:浏览 2490次   下载 4256
Received:February 10, 2010    Revised:April 06, 2010
中文摘要: 详细研究了延迟容忍网络(DTN)的一种确定性路由算法—ED(Earliest-Delivery),分析了其计算延时开销函数,并在此基础上充分考虑了传播延时、节点之间链路的连接规律,引入链路连接状态表来选取路由决策时刻,优化延时开销的计算。实验结果表明,改进后的ED算法可以有效地降低延时,提高路由成功率。
Abstract:This paper focuses on one of DTN’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.
文章编号:     中图分类号:    文献标志码:
基金项目:国家自然科学基金(60173041)
引用文本:
陈元甲,刘卫国,施荣华.DTN网络中ED算法的分析与改进.计算机系统应用,2010,19(10):242-245
CHEN Yuan-Jia,LIU Wei-Guo,SHI Rong-Hua.Analysis and Improvement of Earliest-Delivery Routing Algorithm Based on DTN.COMPUTER SYSTEMS APPLICATIONS,2010,19(10):242-245