一种用于OFDMA认知网络的低复杂度资源分配算法

发布时间：2018-05-07 08:40

本文选题：OFDMA + 子载波分配　；参考：《东南大学学报(自然科学版)》2017年06期

【摘要】：针对功率受限的多用户正交频分多址接入(OFDMA)认知网络,提出了一种低复杂度的资源分配算法,包括子载波和功率分配.在子载波分配中,选取包含最差信道质量的子载波优先分配给用户,再将剩余的子载波信道质量值按方差的降序分配给用户,避免了最后未被分配的子载波恰好只能分配给对应信道质量最差用户的情况发生;在功率分配时,在传统线性注水算法的基础上增加了对主用户抗干扰阈值的判断,在最大化次用户吞吐量的同时,提高了主用户的抗干扰能力.仿真结果表明,与已有算法相比,该算法能够有效提升分配给用户的最差子载波信道质量,在用户吞吐量上接近于传统线性注水算法的性能上限,具有良好的主用户公平性,且计算复杂度低.
[Abstract]:A low complexity resource allocation algorithm is proposed for multi-user orthogonal frequency division multiple access (OFDMA) cognitive networks with power constraints, including subcarriers and power allocation. In the subcarrier allocation, the sub-carriers including the worst channel quality are selected to be assigned to the user first, and the remaining sub-carrier channel quality values are assigned to the user in descending order according to the variance. It avoids the situation that the last unallocated subcarriers can only be allocated to the worst users of the corresponding channel. In power allocation, the judgment of the anti-interference threshold of the primary user is added on the basis of the traditional linear water injection algorithm. While maximizing the throughput of the secondary users, the anti-interference ability of the primary users is improved. Simulation results show that compared with the existing algorithms, the proposed algorithm can effectively improve the quality of the worst subcarrier channel assigned to users, and is close to the performance upper limit of the traditional linear waterflooding algorithm in terms of user throughput, and has good primary user fairness. And the computational complexity is low.
【作者单位】：南京航空航天大学电子信息工程学院;东南大学信息科学与工程学院;
【基金】：国家自然科学基金资助项目(61372104,61572254) 研究生创新基地(实验室)开放基金资助项目(kfjj20170402)
【分类号】：TN929.5

【相似文献】