...
首页> 外文期刊>Journal of information and computational science >An Adaptive Spray and Wait Routing Algorithm Based on Capability of Node in DTN
【24h】

An Adaptive Spray and Wait Routing Algorithm Based on Capability of Node in DTN

机译:DTN中基于节点能力的自适应喷雾等待路由算法

获取原文
获取原文并翻译 | 示例
           

摘要

Delay Tolerant Network (DTN) is an intermittently connected network where there is no complete path from source to destination for most of the time, and routing becomes one of the most challenging and open problems in DTN. To deal with this issue and avoid random and blindfold forwarding in Binary Spray and Wait (BSW) routing, we present the concept of CoN (Capability of Node), then propose the CoN-ASW routing algorithm, which uses the CoN to calculate the number of message copies to be forwarded and determine whether to forward messages to the encounter node. The simulation results show that the proposed algorithm can significantly improve the delivery utility while enhancing delivery rate and reduce the overhead.
机译:延迟容忍网络(DTN)是一种间歇性连接的网络,在大多数情况下,从源到目的地都没有完整的路径,并且路由成为DTN中最具挑战性和开放性的问题之一。为了解决此问题并避免在二进制喷涂等待模式(BSW)路由中出现随机和眼罩转发,我们提出了CoN(节点的能力)的概念,然后提出了CoN-ASW路由算法,该算法使用CoN来计算数量要转发的消息副本的数量,并确定是否将消息转发到遇到节点。仿真结果表明,该算法可以显着提高交付效率,同时提高交付速度,减少开销。

著录项

  • 来源
    《Journal of information and computational science》 |2014年第6期|1975-1982|共8页
  • 作者单位

    Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education, Anhui University, Hefei 230039, China;

    Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education, Anhui University, Hefei 230039, China;

    Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education, Anhui University, Hefei 230039, China;

  • 收录信息
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

    DTN; Routing; CoN; BSW;

    机译:DTN;路由;CoN;BSW;

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号