A joint subcarrier selection and power allocationscheme using variational inequality in OFDM-basedcognitive relay networks
A joint subcarrier selection and power allocationscheme using variational inequality in OFDM-basedcognitive relay networks
复制标题
基于 OFDM 的认知中继网络中使用变分不等式的联合子载波选择和功率分配方案
DOI：
10.1002/wcm.2581
复制
发表时间：
2016
影响因子：
--
通讯作者：
Kuo-Chi Lin
中科院分区：
文献类型：
--
作者：
Peng Jun;Li Shuo;Zhu Chaoliang;Weirong Liu;Zhengfa Zhu;Kuo-Chi Lin
将正交频分复用（OFDM）技术引入认知无线电（CR）可以提高频谱利用率，但同时也给认知无线电网络的资源分配带来了挑战。在基于OFDM的认知中继网络中，两个最重要的研究问题是子载波选择和功率分配。本文提出了一种非合作博弈模型，通过联合优化子载波选择和功率分配来最大化系统吞吐量。首先，考虑到直接和中继链路，一个等效的信道增益被提出来简化的协作中继模型为一个非中继模型。然后，利用变分不等式方法证明了所提出的非合作博弈的纳什均衡解的存在唯一性。此外，为了计算博弈的解，提出了一种基于拉格朗日函数和分布式迭代注水算法的次优算法。该算法可以联合优化子载波选择和功率分配过程。最后，仿真结果表明，所提出的联合子载波选择和功率分配方案的有效性。版权所有© 2015约翰威利父子有限公司.
Introducing orthogonal frequency division multiplexing (OFDM) into cognitive radio (CR) can potentially increase the spectrum efficiency, but it also leads to further challenges for the resource allocation of CR networks. In OFDM‐based cognitive relay networks, two of the most significant research issues are subcarrier selection and power allocation. In this paper, a non‐cooperative game model is proposed to maximize the system throughput by jointly optimizing subcarrier selection and power allocation. First, taking the direct and relay links into consideration, an equivalent channel gain is presented to simplify the cooperative relay model into a non‐relay model. Then, a variational inequality method is utilized to prove the existence and uniqueness of the Nash equilibrium solution of the proposed non‐cooperative game. Moreover, to compute the solution of the game, a suboptimal algorithm based on the Lagrange function and distributed iterative water‐filling algorithm is proposed. The proposed algorithm can jointly optimize the process of subcarrier selection and power allocation. Finally, simulation results are shown to demonstrate the effectiveness of the proposed joint subcarrier selection and power allocation scheme. Copyright © 2015 John Wiley & Sons, Ltd.