Analysis and Improvement of Earliest-Delivery Routing Algorithm Based on DTN
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    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.

    Reference
    Related
    Cited by
Get Citation

陈元甲,刘卫国,施荣华. DTN网络中ED算法的分析与改进.计算机系统应用,2010,19(10):242-245

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:February 10,2010
  • Revised:April 06,2010
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-3
Address:4# South Fourth Street, Zhongguancun,Haidian, Beijing,Postal Code:100190
Phone:010-62661041 Fax: Email:csa (a) iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063