Throughput maximization over temporally correlated fading channels in cognitive radio networks

Doha Hamza, M. Nafie
{"title":"Throughput maximization over temporally correlated fading channels in cognitive radio networks","authors":"Doha Hamza, M. Nafie","doi":"10.1109/ICTEL.2010.5478781","DOIUrl":null,"url":null,"abstract":"We consider a primary link and a secondary link, each composed of a transmitter and a receiver. The primary channel and the channel between the secondary transmitter and the primary receiver follow a first-order Markov model for channel variation over time. Under this assumption of temporal correlation and via exploiting the channel state information (CSI) feedback, we pose the cognitive power control problem as the maximization of secondary throughput subject to a constraint on the primary outage. To solve this problem, we assume that the primary transmitter sends with a constant-rate and with a constant-power, and we consider two types of feedback: perfect delayed CSI and one-bit automatic repeat request (ARQ) CSI. To reduce the computational complexity in the case of ARQ-CSI, we reformulate the cognitive power control problem as the maximization of the weighted sum of primary and secondary throughput which we solve optimally for delayed-CSI and greedily for ARQ-CSI. We also solve the cognitive power control problem for a constant-power variablerate primary link where the primary transmitter exploits the channel temporal correlation. In this scheme, we only consider a temporally correlated primary link and perfect delayed CSI. We solve the weighted sum throughput maximization problem under two scenarios. In the first, the primary rate is adapted without considering the secondary link. In the second, the primary rate and secondary power are determined simultaneously assuming a central controller.","PeriodicalId":208094,"journal":{"name":"2010 17th International Conference on Telecommunications","volume":"100 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 17th International Conference on Telecommunications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTEL.2010.5478781","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

We consider a primary link and a secondary link, each composed of a transmitter and a receiver. The primary channel and the channel between the secondary transmitter and the primary receiver follow a first-order Markov model for channel variation over time. Under this assumption of temporal correlation and via exploiting the channel state information (CSI) feedback, we pose the cognitive power control problem as the maximization of secondary throughput subject to a constraint on the primary outage. To solve this problem, we assume that the primary transmitter sends with a constant-rate and with a constant-power, and we consider two types of feedback: perfect delayed CSI and one-bit automatic repeat request (ARQ) CSI. To reduce the computational complexity in the case of ARQ-CSI, we reformulate the cognitive power control problem as the maximization of the weighted sum of primary and secondary throughput which we solve optimally for delayed-CSI and greedily for ARQ-CSI. We also solve the cognitive power control problem for a constant-power variablerate primary link where the primary transmitter exploits the channel temporal correlation. In this scheme, we only consider a temporally correlated primary link and perfect delayed CSI. We solve the weighted sum throughput maximization problem under two scenarios. In the first, the primary rate is adapted without considering the secondary link. In the second, the primary rate and secondary power are determined simultaneously assuming a central controller.
认知无线电网络中时间相关衰落信道的吞吐量最大化
我们考虑一个主链路和一个辅助链路,每个链路由一个发送器和一个接收器组成。主信道和次级发射机与主接收机之间的信道遵循信道随时间变化的一阶马尔可夫模型。在这种时间相关假设下,通过利用信道状态信息(CSI)反馈,我们提出了认知功率控制问题,即在限制主中断的情况下,实现二次吞吐量的最大化。为了解决这个问题,我们假设主发送器以恒定速率和恒定功率发送,并考虑两种类型的反馈:完全延迟CSI和一位自动重复请求(ARQ) CSI。为了降低ARQ-CSI情况下的计算复杂度,我们将认知能力控制问题重新表述为主、次吞吐量加权和的最大化问题,并对延迟csi和ARQ-CSI进行了最优解和贪婪解。我们还解决了恒功率可变主链路的认知功率控制问题,其中主发射机利用信道时间相关性。在该方案中,我们只考虑一个时间相关的主链路和完美的延迟CSI。我们在两种情况下解决了加权和吞吐量最大化问题。在第一种方法中,主要速率被调整而不考虑次要链路。在第二种方法中,假设有一个中央控制器,同时确定主速率和次功率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信