A novel localised network coding-based overhearing strategy

Zuoting Ning, Lan He, Dafang Zhang, Kun Xie
{"title":"A novel localised network coding-based overhearing strategy","authors":"Zuoting Ning, Lan He, Dafang Zhang, Kun Xie","doi":"10.1504/IJHPCN.2019.10018473","DOIUrl":null,"url":null,"abstract":"Network coding is a very effective approach to improve network throughput and reduce end-to-end delay. However, the existing approaches cannot thoroughly solve the problem of how to deal with newly overheard packets when the buffer is full, meanwhile, coding node does not schedule the packets in coding queue according to the packets' information in overhearing buffer. As a result, these methodologies lack flexibility and require quite a few assumptions. To address these limitations, we propose a new network coding overhearing strategy which is based on data packet switching and scheduling (DPSS) algorithm. First, when overhearing buffer is full and the sink nodes have overheard new packets, sink nodes will drop the recently overheard packets but record their IDs; second, sink nodes report the packets' information to the coding node that schedules the packets in coding queue for ease of encoding. Finally, sink nodes delete the packets which have been used for decoding, and call for the ever dropped packets when decoding ratio reaches the threshold. Theoretical analysis and simulation demonstrate that, compared with traditional overhearing policies, our scheme gets higher coding ratio and less delay.","PeriodicalId":412308,"journal":{"name":"Int. J. Embed. Syst.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Embed. Syst.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/IJHPCN.2019.10018473","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Network coding is a very effective approach to improve network throughput and reduce end-to-end delay. However, the existing approaches cannot thoroughly solve the problem of how to deal with newly overheard packets when the buffer is full, meanwhile, coding node does not schedule the packets in coding queue according to the packets' information in overhearing buffer. As a result, these methodologies lack flexibility and require quite a few assumptions. To address these limitations, we propose a new network coding overhearing strategy which is based on data packet switching and scheduling (DPSS) algorithm. First, when overhearing buffer is full and the sink nodes have overheard new packets, sink nodes will drop the recently overheard packets but record their IDs; second, sink nodes report the packets' information to the coding node that schedules the packets in coding queue for ease of encoding. Finally, sink nodes delete the packets which have been used for decoding, and call for the ever dropped packets when decoding ratio reaches the threshold. Theoretical analysis and simulation demonstrate that, compared with traditional overhearing policies, our scheme gets higher coding ratio and less delay.
一种新的基于局域网络编码的监听策略
网络编码是提高网络吞吐量和降低端到端时延的有效方法。然而,现有的方法并不能彻底解决当缓冲区满时如何处理新听到的数据包的问题,同时编码节点并没有根据侦听缓冲区中的数据包信息对编码队列中的数据包进行调度。因此,这些方法缺乏灵活性,需要相当多的假设。为了解决这些限制,我们提出了一种新的基于数据包交换和调度(DPSS)算法的网络编码监听策略。首先,当侦听缓冲区已满且接收节点已侦听到新数据包时,接收节点将丢弃最近侦听到的数据包,但记录其id;其次,汇聚节点将数据包的信息报告给编码节点,编码节点在编码队列中调度数据包,以便于编码。最后,汇聚节点删除已经用于解码的数据包,并在解码率达到阈值时调用曾经丢失的数据包。理论分析和仿真结果表明,与传统的监听策略相比,该方案具有更高的编码率和更小的时延。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信