RIF:用于命名数据容忍延迟网络的转发策略

Li Wang, Ru Li
{"title":"RIF:用于命名数据容忍延迟网络的转发策略","authors":"Li Wang, Ru Li","doi":"10.1109/ICEIEC.2017.8076539","DOIUrl":null,"url":null,"abstract":"Efficient content retrieval is crucial for Named Data Delay Tolerant Networking (NDDTN). Previous studies have shown that using social properties reasonably can improve availability of forwarding data packets, reduce overhead and delay. In this paper, a forwarding strategy, called RIF based on Region of Interest (ROI), is proposed and put forward for NDDTN. RIF computes cumulative visiting time and visits for getting the similarity of two nodes. Especially, RIF introduces the geographical adjacency degree of ROIs. RIF selects relay nodes according to similarity and adjacency degree of ROI sets of two nodes. This paper uses real mobility traces to evaluate RIF, and simulation results indicate that compared with PLBR, RIF improves the delivery ratio by 7 percent, and has lower delay.","PeriodicalId":163990,"journal":{"name":"2017 7th IEEE International Conference on Electronics Information and Emergency Communication (ICEIEC)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"RIF: A forwarding strategy for named data delay tolerant networking\",\"authors\":\"Li Wang, Ru Li\",\"doi\":\"10.1109/ICEIEC.2017.8076539\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Efficient content retrieval is crucial for Named Data Delay Tolerant Networking (NDDTN). Previous studies have shown that using social properties reasonably can improve availability of forwarding data packets, reduce overhead and delay. In this paper, a forwarding strategy, called RIF based on Region of Interest (ROI), is proposed and put forward for NDDTN. RIF computes cumulative visiting time and visits for getting the similarity of two nodes. Especially, RIF introduces the geographical adjacency degree of ROIs. RIF selects relay nodes according to similarity and adjacency degree of ROI sets of two nodes. This paper uses real mobility traces to evaluate RIF, and simulation results indicate that compared with PLBR, RIF improves the delivery ratio by 7 percent, and has lower delay.\",\"PeriodicalId\":163990,\"journal\":{\"name\":\"2017 7th IEEE International Conference on Electronics Information and Emergency Communication (ICEIEC)\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 7th IEEE International Conference on Electronics Information and Emergency Communication (ICEIEC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICEIEC.2017.8076539\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 7th IEEE International Conference on Electronics Information and Emergency Communication (ICEIEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICEIEC.2017.8076539","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

高效的内容检索是命名数据容忍延迟网络(NDDTN)的关键。已有研究表明,合理利用社交属性可以提高转发数据包的可用性,降低开销和延迟。本文提出并提出了一种基于感兴趣区域的NDDTN转发策略RIF。RIF计算累计访问时间和访问次数,以获得两个节点的相似性。特别是RIF引入了roi的地理邻接度。RIF根据两个节点的感兴趣点集的相似度和邻接度选择中继节点。仿真结果表明,与PLBR相比,RIF的投递率提高了7%,并且具有更低的时延。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
RIF: A forwarding strategy for named data delay tolerant networking
Efficient content retrieval is crucial for Named Data Delay Tolerant Networking (NDDTN). Previous studies have shown that using social properties reasonably can improve availability of forwarding data packets, reduce overhead and delay. In this paper, a forwarding strategy, called RIF based on Region of Interest (ROI), is proposed and put forward for NDDTN. RIF computes cumulative visiting time and visits for getting the similarity of two nodes. Especially, RIF introduces the geographical adjacency degree of ROIs. RIF selects relay nodes according to similarity and adjacency degree of ROI sets of two nodes. This paper uses real mobility traces to evaluate RIF, and simulation results indicate that compared with PLBR, RIF improves the delivery ratio by 7 percent, and has lower delay.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信