An efficient Soliton-like network coding protocol for the resource-constrained Y-network

Andrew Liau, Il Kim, S. Yousefi
{"title":"An efficient Soliton-like network coding protocol for the resource-constrained Y-network","authors":"Andrew Liau, Il Kim, S. Yousefi","doi":"10.1109/CWIT.2013.6621613","DOIUrl":null,"url":null,"abstract":"Originally designed for point-to-point transmissions, fountain codes are capacity-achieving codes over a binary erasure channel. On the other hand, network coding is an optimal multihop data dissemination protocol whose high decoding complexity makes it too expensive for resource-constrained applications. Soliton-like rateless coding (SLRC) has previously combined network and fountain coding paradigms such that a less complex decoder can be applied. Specifically, the coding done at an intermediate relay node allows a belief propagation decoder to be efficiently applied. We extend the SLRC protocol and propose the Improved Soliton-like Rateless Coding (ISLRC) protocol. In ISLRC, the relay applies intelligent coding and shapes the degree distribution such that performance is better than SLRC. In addition, ISLRCs performance gains are achieved using fewer resources than SLRC while maintaining all the key properties of SLRC. Simulation results show that even under the worst-case scenario of ISLRC, better performance can be achieved compared to SLRC and other existing schemes.","PeriodicalId":398936,"journal":{"name":"2013 13th Canadian Workshop on Information Theory","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 13th Canadian Workshop on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CWIT.2013.6621613","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Originally designed for point-to-point transmissions, fountain codes are capacity-achieving codes over a binary erasure channel. On the other hand, network coding is an optimal multihop data dissemination protocol whose high decoding complexity makes it too expensive for resource-constrained applications. Soliton-like rateless coding (SLRC) has previously combined network and fountain coding paradigms such that a less complex decoder can be applied. Specifically, the coding done at an intermediate relay node allows a belief propagation decoder to be efficiently applied. We extend the SLRC protocol and propose the Improved Soliton-like Rateless Coding (ISLRC) protocol. In ISLRC, the relay applies intelligent coding and shapes the degree distribution such that performance is better than SLRC. In addition, ISLRCs performance gains are achieved using fewer resources than SLRC while maintaining all the key properties of SLRC. Simulation results show that even under the worst-case scenario of ISLRC, better performance can be achieved compared to SLRC and other existing schemes.
一种资源受限的类孤子网络编码协议
喷泉码最初设计用于点对点传输,是通过二进制擦除信道实现容量的代码。另一方面,网络编码是一种最优的多跳数据传播协议,但其解码复杂度高,对于资源受限的应用来说成本过高。类孤子无速率编码(SLRC)以前结合了网络和喷泉编码范式,这样就可以应用一个不太复杂的解码器。具体来说,在中间中继节点上完成的编码允许有效地应用信念传播解码器。对SLRC协议进行了扩展,提出了改进的类孤子无速率编码(ISLRC)协议。在ISLRC中,继电器采用智能编码,并对度分布进行了整形,使其性能优于SLRC。此外,islrc使用比SLRC更少的资源实现了性能提升,同时保持了SLRC的所有关键特性。仿真结果表明,即使在最坏的情况下,与SLRC和其他现有方案相比,ISLRC也能取得更好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信