Network coded routing in delay tolerant networks: an experience report

A. Petz, Chien-Liang Fok, C. Julien, B. Walker, Calvin Ardi
{"title":"Network coded routing in delay tolerant networks: an experience report","authors":"A. Petz, Chien-Liang Fok, C. Julien, B. Walker, Calvin Ardi","doi":"10.1145/2414393.2414397","DOIUrl":null,"url":null,"abstract":"In delay-tolerant networks, end-to-end routes are rarely available, and routing protocols must take advantage of the opportunistic interactions among nodes to deliver packets. Probabilistic routing performs well in such networks and has been the dominant focus of research in this area. However, creating efficient routing protocols is challenging because to reduce latency, one often needs to replicate messages thus increasing routing overhead. Network coding has been explored as a way to increase throughput in DTNs without a significant increase in overhead, and network coded routing approaches have shown promising results. In this paper, we report on our experience integrating both erasure coded and network coded routing into the well-adopted DTN2 Reference Implementation. We implement our routing module and evaluate it via small real-world field tests.","PeriodicalId":200060,"journal":{"name":"Extreme Conference on Communication","volume":"81 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Extreme Conference on Communication","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2414393.2414397","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 17

Abstract

In delay-tolerant networks, end-to-end routes are rarely available, and routing protocols must take advantage of the opportunistic interactions among nodes to deliver packets. Probabilistic routing performs well in such networks and has been the dominant focus of research in this area. However, creating efficient routing protocols is challenging because to reduce latency, one often needs to replicate messages thus increasing routing overhead. Network coding has been explored as a way to increase throughput in DTNs without a significant increase in overhead, and network coded routing approaches have shown promising results. In this paper, we report on our experience integrating both erasure coded and network coded routing into the well-adopted DTN2 Reference Implementation. We implement our routing module and evaluate it via small real-world field tests.
容忍延迟网络中的网络编码路由:经验报告
在容忍延迟的网络中,端到端路由很少可用,路由协议必须利用节点之间的机会交互来传递数据包。概率路由在这种网络中表现良好,一直是该领域研究的主要焦点。然而,创建高效的路由协议具有挑战性,因为要减少延迟,通常需要复制消息,从而增加路由开销。网络编码作为一种在不显著增加开销的情况下提高ddn吞吐量的方法已经被探索,并且网络编码路由方法已经显示出有希望的结果。在本文中,我们报告了我们将擦除编码和网络编码路由集成到广泛采用的DTN2参考实现中的经验。我们实现了我们的路由模块,并通过小型的实际现场测试对其进行了评估。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信