Optimal time and rate allocation for a network-coded bidirectional two-hop communication

C. Hausl, O. Iscan, F. Rossetto
{"title":"Optimal time and rate allocation for a network-coded bidirectional two-hop communication","authors":"C. Hausl, O. Iscan, F. Rossetto","doi":"10.1109/EW.2010.5483533","DOIUrl":null,"url":null,"abstract":"We consider a bidirectional communication between two terminals with the help of a relay. The transmissions of the three nodes are divided in time and there is no direct link between the terminals. The allocation of the transmission time and of the rates in both directions can be asymmetric. We first derive a closed form expression of the optimal time allocation for a given ratio of the rates in both directions and for given signal-to-noise ratios of all channels. Then, we derive a closed form expression of the optimal rate ratio such that the sum-rate is maximized under the assumption that the time allocation is optimally chosen. This also leads to a condition based on the channel SNRs, when to communicate with or without network coding in order to maximize the sum-rate. Then, we consider the design of the network code and compare several code designs by simulation whereas we assume that a turbo code is used as channel code. It turns out that efficient asymmetric two-way communication requires to perform network coding at the physical layer and can be realized by network-encoding the channel-encoded bits.","PeriodicalId":232165,"journal":{"name":"2010 European Wireless Conference (EW)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 European Wireless Conference (EW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EW.2010.5483533","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

Abstract

We consider a bidirectional communication between two terminals with the help of a relay. The transmissions of the three nodes are divided in time and there is no direct link between the terminals. The allocation of the transmission time and of the rates in both directions can be asymmetric. We first derive a closed form expression of the optimal time allocation for a given ratio of the rates in both directions and for given signal-to-noise ratios of all channels. Then, we derive a closed form expression of the optimal rate ratio such that the sum-rate is maximized under the assumption that the time allocation is optimally chosen. This also leads to a condition based on the channel SNRs, when to communicate with or without network coding in order to maximize the sum-rate. Then, we consider the design of the network code and compare several code designs by simulation whereas we assume that a turbo code is used as channel code. It turns out that efficient asymmetric two-way communication requires to perform network coding at the physical layer and can be realized by network-encoding the channel-encoded bits.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
网络编码双向两跳通信的最佳时间和速率分配
我们考虑在继电器的帮助下两个终端之间的双向通信。三个节点的传输在时间上是分开的,终端之间没有直接连接。传输时间和速率在两个方向上的分配可能是不对称的。我们首先推导出两个方向上给定比率和所有信道的给定信噪比的最佳时间分配的封闭形式表达式。然后,在时间分配最优的前提下,导出了最优速率比的封闭表达式,使得总和速率最大。这也导致了一种基于信道信噪比的情况,即何时使用或不使用网络编码进行通信以最大化求和速率。然后,我们考虑了网络码的设计,并通过仿真比较了几种码的设计,而我们假设使用turbo码作为信道码。结果表明,高效的非对称双向通信需要在物理层进行网络编码,并且可以通过对信道编码位进行网络编码来实现。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Soft carrier phase recovery for continuous phase modulations Rate-adaptive space-time constellation design for partially coherent Rayleigh fading channels Effective scheduling of real-time traffic in HSUPA Evaluation of spectrum opportunities in the GSM band A Simple and Robust Dissemination protocol for VANETs
×
引用
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