A precoding scheme with generation crossing for network coding

D. Hu, M. Wang, F. Lau, Q. Peng
{"title":"A precoding scheme with generation crossing for network coding","authors":"D. Hu, M. Wang, F. Lau, Q. Peng","doi":"10.1109/APCC.2009.5375492","DOIUrl":null,"url":null,"abstract":"Random network coding based on the generation concept provides various benefits such as reduced system complexity. However, various generation updating processes used in general result in a throughput loss. In this paper, we propose a network coding scheme using a concept we call “generation crossing”. We also introduce a full cardinality precode, which enables the receiver to recover the lost packets when only a subset of the linearly independent encoded packets is received at the destination. We show that the successful delivery probability of all generations increases remarkably with a small number of overlapped packets between successive generations.","PeriodicalId":217893,"journal":{"name":"2009 15th Asia-Pacific Conference on Communications","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 15th Asia-Pacific Conference on Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APCC.2009.5375492","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Random network coding based on the generation concept provides various benefits such as reduced system complexity. However, various generation updating processes used in general result in a throughput loss. In this paper, we propose a network coding scheme using a concept we call “generation crossing”. We also introduce a full cardinality precode, which enables the receiver to recover the lost packets when only a subset of the linearly independent encoded packets is received at the destination. We show that the successful delivery probability of all generations increases remarkably with a small number of overlapped packets between successive generations.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种具有生成交叉的网络编码预编码方案
基于生成概念的随机网络编码具有降低系统复杂度等诸多优点。然而,通常使用的各种代更新过程会导致吞吐量损失。在本文中,我们提出了一种网络编码方案,使用我们称之为“代交叉”的概念。我们还引入了一个全基数预码,它使接收方能够在目的地只接收到线性独立编码数据包的一个子集时恢复丢失的数据包。结果表明,当连续几代之间存在少量重叠包时,所有代的成功投递概率显著增加。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Packets scheduling for optical SDL LIFO buffers Unified construction algorithm of network coding in cyclic networks A novel QoS-guaranteed proportional fairness with joint space-time-frequency scheduling Constructing optical buffers with switches and fiber delay lines Performance evaluation of cheating host in ALM over wireless multi-hop networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1