Joint resource optimization and relay selection in cooperative cellular networks with imperfect channel knowledge

Ayaz Ahmad, M. Assaad
{"title":"Joint resource optimization and relay selection in cooperative cellular networks with imperfect channel knowledge","authors":"Ayaz Ahmad, M. Assaad","doi":"10.1109/SPAWC.2010.5671058","DOIUrl":null,"url":null,"abstract":"In this paper, we study resource allocation and relay selection in a decode-and-forward downlink OFDMA cooperative network assuming imperfect channel state information (CSI) at the base station (BS). We assume that due to feedback delay, the BS has only outdated CSI of BS to users and inter-user links. We propose a centralized optimization framework in which the BS takes decisions on the basis of available outdated CSI given the conditional probability distribution of the current CSI. We approach the problem by using dual optimization framework, decompose it into per-subcarrier optimization problem, and develop an optimal resource allocation and relay selection algorithm. The proposed algorithm minimizes the total transmit power of the system by jointly selecting the best relay node for each source-destination pair, and optimally allocating power and subcarriers to the source and relay nodes under constraints on users' conditional expected data rates. The duality gaps of the solution are virtually zero. Furthermore, we show that the per-subcarrier decomposition of the problem reduces the complexity of the solution from exponential to polynomial. Simulation results show that the system performance may be badly affected by feedback delay. Simulation results also show that users' cooperation significantly reduces the power consumption compared to non-cooperative communication.","PeriodicalId":436215,"journal":{"name":"2010 IEEE 11th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"481 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"22","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE 11th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPAWC.2010.5671058","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 22

Abstract

In this paper, we study resource allocation and relay selection in a decode-and-forward downlink OFDMA cooperative network assuming imperfect channel state information (CSI) at the base station (BS). We assume that due to feedback delay, the BS has only outdated CSI of BS to users and inter-user links. We propose a centralized optimization framework in which the BS takes decisions on the basis of available outdated CSI given the conditional probability distribution of the current CSI. We approach the problem by using dual optimization framework, decompose it into per-subcarrier optimization problem, and develop an optimal resource allocation and relay selection algorithm. The proposed algorithm minimizes the total transmit power of the system by jointly selecting the best relay node for each source-destination pair, and optimally allocating power and subcarriers to the source and relay nodes under constraints on users' conditional expected data rates. The duality gaps of the solution are virtually zero. Furthermore, we show that the per-subcarrier decomposition of the problem reduces the complexity of the solution from exponential to polynomial. Simulation results show that the system performance may be badly affected by feedback delay. Simulation results also show that users' cooperation significantly reduces the power consumption compared to non-cooperative communication.
具有不完全信道知识的协同蜂窝网络联合资源优化与中继选择
本文研究了在假定基站信道状态信息不完全的情况下,译码转发下行OFDMA合作网络中的资源分配和中继选择问题。我们假设由于反馈延迟,BS对用户和用户间链接只有过期的BS CSI。我们提出了一个集中式优化框架,在该框架中,给定当前CSI的条件概率分布,BS根据可用的过时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学术官方微信