Nonlinear network code for high throughput broadcasting with retransmissions

Qiang Li, S. Ting, Chin Keong Ho
{"title":"Nonlinear network code for high throughput broadcasting with retransmissions","authors":"Qiang Li, S. Ting, Chin Keong Ho","doi":"10.1109/ISIT.2009.5205268","DOIUrl":null,"url":null,"abstract":"In a typical network coding scenario, a node has to broadcast a set of messages to a group of receiver nodes who have already received a subset of the messages through other links. In this paper, we will first present the achievable rate region for this broadcasting scenario, and then extend the result to the case with retransmissions. With the proposed nonlinear network coding strategy, the achievable rate region can be achieved without requiring the exact knowledge of a priori information available at the receiver nodes. The broadcasting node simply performs retransmissions with independent codebooks until every receiver node has received the whole set of messages. Through the analysis of network throughput, we will show that each receiver node is able to effectively accumulate mutual information over the multiple transmissions thus achieving higher overall throughput than the conventional random linear network coding strategy.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2009.5205268","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12

Abstract

In a typical network coding scenario, a node has to broadcast a set of messages to a group of receiver nodes who have already received a subset of the messages through other links. In this paper, we will first present the achievable rate region for this broadcasting scenario, and then extend the result to the case with retransmissions. With the proposed nonlinear network coding strategy, the achievable rate region can be achieved without requiring the exact knowledge of a priori information available at the receiver nodes. The broadcasting node simply performs retransmissions with independent codebooks until every receiver node has received the whole set of messages. Through the analysis of network throughput, we will show that each receiver node is able to effectively accumulate mutual information over the multiple transmissions thus achieving higher overall throughput than the conventional random linear network coding strategy.
具有重传的高吞吐量广播的非线性网络代码
在典型的网络编码场景中,节点必须将一组消息广播给一组接收节点,这些接收节点已经通过其他链接接收了消息的子集。在本文中,我们将首先给出这种广播场景的可实现速率区域,然后将结果扩展到重传的情况。采用所提出的非线性网络编码策略,可以在不需要精确了解接收节点上可用的先验信息的情况下获得可实现的速率区域。广播节点简单地使用独立的码本执行重传,直到每个接收节点都接收到完整的消息集。通过对网络吞吐量的分析,我们将证明每个接收节点能够有效地在多次传输中积累相互信息,从而获得比传统随机线性网络编码策略更高的总体吞吐量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信