Interference-Aware Radio Resource Allocation in OFDMA-Based Cognitive Radio Networks
Interference-Aware Radio Resource Allocation in OFDMA-Based Cognitive Radio Networks
复制标题
DOI：
10.1109/tvt.2011.2126613
复制
发表时间：
2011-05-01
影响因子：
6.8
通讯作者：
Stueber, Gordon L.
中科院分区：
文献类型：
--
作者：
Almalfouh, Sami M.;Stueber, Gordon L.
研究了基于正交频分多址的认知无线电网络中的无线资源分配问题。资源分配算法的目标是最大化CR网络吞吐量下的PU干扰约束。引入PU子带的CR干扰被建模为由以下两部分组成的复合物：1）CR带外发射和2）由于不完美的频谱感测而产生的干扰。我们考虑下行链路和上行链路的子载波和功率分配。在这两种情况下，资源分配问题是一个混合整数非线性规划问题，获得最优解是已知的NP-难。针对下行链路资源分配问题，提出了计算效率较高的次优算法，并将其推广到上行链路。我们通过仿真表明，所提出的算法表现出接近最优的性能，并显着降低计算复杂度相比，获得最优的解决方案。
This paper considers the problem of radio resource allocation in an orthogonal frequency-division multiple access based cognitive radio (CR) network that opportunistically operates within the licensed primary users (PUs) spectrum. The resource allocation algorithm aims at maximizing the CR network throughput under PUs interference constraints. The CR interference introduced into PUs subbands is modeled as a composite that consists of the following two parts: 1) CR out-of-band emissions and 2) the interference that arises as a result of imperfect spectrum sensing. We consider both downlink and uplink subcarrier and power allocation. In both cases, the resource allocation problem is a mixed-integer nonlinear programming problem, for which obtaining the optimal solution is known to be NP-hard. Computationally efficient suboptimal algorithms are proposed for the downlink resource allocation problem, and then, they are extended to the uplink case. We show through simulation that the proposed algorithms exhibit near-optimal performance and significantly reduce the computational complexity compared to obtaining the optimal solution.