时延容忍网络中一种基于网络编码的高效传输协议

J. Sheu, Chih-Yin Lee, Chuang Ma
{"title":"时延容忍网络中一种基于网络编码的高效传输协议","authors":"J. Sheu, Chih-Yin Lee, Chuang Ma","doi":"10.1109/IMIS.2013.74","DOIUrl":null,"url":null,"abstract":"In Delay Tolerant Networks, the delay of packets is long due to the intermittent connections caused by the mobility of nodes. Epidemic Routing Protocol can reduce the delay time and raise the packet delivery rate by replicating and spread copies of source packets in the networks, but it inevitably exhaust memory resources and network bandwidth. In this paper, we propose a network coding with limited buffer routing protocol. When a buffer of a node is full, two packets in the buffer are chosen randomly and encoded linearly together in to a packet to save buffer space and improve the performance in many-to-one communications.","PeriodicalId":425979,"journal":{"name":"2013 Seventh International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"An Efficient Transmission Protocol Based on Network Coding in Delay Tolerant Networks\",\"authors\":\"J. Sheu, Chih-Yin Lee, Chuang Ma\",\"doi\":\"10.1109/IMIS.2013.74\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In Delay Tolerant Networks, the delay of packets is long due to the intermittent connections caused by the mobility of nodes. Epidemic Routing Protocol can reduce the delay time and raise the packet delivery rate by replicating and spread copies of source packets in the networks, but it inevitably exhaust memory resources and network bandwidth. In this paper, we propose a network coding with limited buffer routing protocol. When a buffer of a node is full, two packets in the buffer are chosen randomly and encoded linearly together in to a packet to save buffer space and improve the performance in many-to-one communications.\",\"PeriodicalId\":425979,\"journal\":{\"name\":\"2013 Seventh International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing\",\"volume\":\"34 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-07-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 Seventh International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IMIS.2013.74\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 Seventh International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IMIS.2013.74","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

在容忍延迟网络中,由于节点的移动而导致的间歇性连接导致报文的延迟时间较长。流行路由协议通过在网络中复制和传播源数据包的副本,可以减少延迟时间,提高数据包的传输速率,但不可避免地会消耗内存资源和网络带宽。本文提出了一种具有有限缓冲的网络编码路由协议。当一个节点的缓冲区已满时,随机选择缓冲区中的两个数据包并将其线性编码在一起,以节省缓冲区空间并提高多对一通信的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Efficient Transmission Protocol Based on Network Coding in Delay Tolerant Networks
In Delay Tolerant Networks, the delay of packets is long due to the intermittent connections caused by the mobility of nodes. Epidemic Routing Protocol can reduce the delay time and raise the packet delivery rate by replicating and spread copies of source packets in the networks, but it inevitably exhaust memory resources and network bandwidth. In this paper, we propose a network coding with limited buffer routing protocol. When a buffer of a node is full, two packets in the buffer are chosen randomly and encoded linearly together in to a packet to save buffer space and improve the performance in many-to-one communications.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信