基于匹配理论的NOMA异构网络资源分配算法

Resource Allocation Algorithm for NOMA Heterogeneous Network Based on Matching Theory

在非正交多址接入异构网络中,通过联合资源分配和用户调度可达到用户调度数与系统吞吐量之间的平衡。提出一种基于匹配理论的用户-子信道双边匹配算法(USTSMA)。在满足用户最小数据速率需求和已知完美信道状态信息的条件下,将用户和子信道认为是追求自身最大收益的两个独立集合,通过迭代的方式实现用户和子信道之间的稳定匹配。在此基础上,利用注水算法解决用户的功率分配问题。仿真结果表明,USTSMA在系统总吞吐量、用户调度数等方面性能优于S-MGA和GA两种用户分组算法以及正交频分多址接入方案,并且逼近最优上界。

In Non-Orthogonal Multiple Access(NOMA)heterogeneous network,the balance between the number of scheduled users and the the system throughput can be achieved by joint resource allocation and user scheduling.Therefore,this paper proposes a User-Subchannel Two-Side Matching Algorithm(USTSMA)based on the matching theory.Under the condition of satisfying the user’s minimum data rate requirement and knowing perfect Channel State Information(CSI),the user and subchannel are considered as two independent sets to pursue their own maximum profit,and the stable matching between users and subchannels is obtained by iteration.On this basis,the water injection algorithm is used for user power allocation.Simulation results show that USTSMA can approach the upper bound in terms of total system throughput and number of user scheduling,and is superior to Orthogonal Frequency Division Multiple Access,OFDMA(OFDMA)scheme and two user grouping algorithms,S-MGA and GA.