Delay-constrained achievable rate maximization in wireless relay networks with causal feedback

James C. F. Li, S. Dey
{"title":"Delay-constrained achievable rate maximization in wireless relay networks with causal feedback","authors":"James C. F. Li, S. Dey","doi":"10.1109/SPAWC.2008.4641649","DOIUrl":null,"url":null,"abstract":"Motivated by delay-sensitive information transmission applications, we propose an expected achievable rate maximization scheme with a K-block delay constraint on data transmission using a three node cooperative relay network assuming a block fading channel model. Channel information is fed back to the transmitter only in a causal fashion, so that the optimal power allocation strategy is only based on the current and past channel gains.We consider the two simplest schemes for information transmission using a three node (a source, a relay and a destination) relay network, namely the amplify and forward (AF) and decode and forward (DF) protocols. We use a dynamic programming based methodology to solve the (K-block delay constrained) expected capacity maximization problem with a short term (over K blocks) sum power (total transmission power of the source and the relay) constraint. Furthermore, two simple power allocation schemes for high and low SNR situations are proposed. Extensive numerical results are presented for Rayleigh fading channels, including results demonstrating the accuracy of the high/low SNR approximation based power allocation schemes.","PeriodicalId":197154,"journal":{"name":"2008 IEEE 9th Workshop on Signal Processing Advances in Wireless Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE 9th Workshop on Signal Processing Advances in Wireless Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPAWC.2008.4641649","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Motivated by delay-sensitive information transmission applications, we propose an expected achievable rate maximization scheme with a K-block delay constraint on data transmission using a three node cooperative relay network assuming a block fading channel model. Channel information is fed back to the transmitter only in a causal fashion, so that the optimal power allocation strategy is only based on the current and past channel gains.We consider the two simplest schemes for information transmission using a three node (a source, a relay and a destination) relay network, namely the amplify and forward (AF) and decode and forward (DF) protocols. We use a dynamic programming based methodology to solve the (K-block delay constrained) expected capacity maximization problem with a short term (over K blocks) sum power (total transmission power of the source and the relay) constraint. Furthermore, two simple power allocation schemes for high and low SNR situations are proposed. Extensive numerical results are presented for Rayleigh fading channels, including results demonstrating the accuracy of the high/low SNR approximation based power allocation schemes.
具有因果反馈的无线中继网络中时延约束的可实现速率最大化
基于对延迟敏感的信息传输应用,我们提出了一种基于k块延迟约束的三节点协同中继网络数据传输预期可实现速率最大化方案。信道信息仅以因果方式反馈给发射机,因此最优功率分配策略仅基于当前和过去的信道增益。我们考虑使用三节点(源、中继和目的地)中继网络进行信息传输的两种最简单的方案,即放大转发(AF)和解码转发(DF)协议。我们使用基于动态规划的方法来解决具有短期(超过K个块)和功率(源和继电器的总传输功率)约束的(K块延迟约束)期望容量最大化问题。此外,针对高信噪比和低信噪比的情况,提出了两种简单的功率分配方案。给出了瑞利衰落信道的大量数值结果,包括基于高/低信噪比近似的功率分配方案的准确性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信