English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 57615/91160 (63%)
造访人次 : 13536588      在线人数 : 352
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻

    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/105962

    题名: A Novel Routing Scheme to Use the Rule of First Encounter within OOP-Routing for Delay Tolerant Ad-Hoc Networks
    作者: Yang, Shih-Yang;Jiang, Jiun-Ting;Chen, Po-Zung
    关键词: DTN;Routing;Epidemic;NS2;OOP
    日期: 2013/01/31
    上传时间: 2016-04-22 13:12:39 (UTC+8)
    摘要: In DTNs, most of the routing developments are addressed in specific scenarios. However, about zero-knowledge routing, fewer breakthroughs can make their ways for novel developments. From this paper, we propose a novel routing in terms of zero-knowledge, namely OOPFE. We get the routing idea through observations in the daily life. In the 400-meter relay race of the World Olympic Game, the average speed is faster than that of the individual 400-meters race. We attempt to use the characteristic and further research by the way of “relay-delivering message” to tackle the tradeoff for increasing the delivery ratio and decreasing the number of duplication in the random moving scenarios. And, we have got a novel method and used NS2 Simulator to verify. Since the hop-limit greatly affects the efficiency, we also analyze the average number of hop counts for different hop-limits. The results show that this routing more ssuitable for the scenarios when the speed of source nodes is slower or the size of the network scenario is larger.
    關聯: Journal of Communications and Information Sciences 3(1), pp.47-59
    DOI: 10.4156/jcis.vol3.issue1.6
    显示于类别:[資訊工程學系暨研究所] 期刊論文


    档案 描述 大小格式浏览次数



    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回馈