首页 | 官方网站   微博 | 高级检索  
     


Resource Allocation for Throughput Maximization in Cognitive Radio Network with NOMA
Authors:Xiaoli He  Yu Song  Yu Xue  Muhammad Owais  Weijian Yang  Xinwen Cheng
Abstract:Spectrum resources are the precious and limited natural resources. In order to improve the utilization of spectrum resources and maximize the network throughput, this paper studies the resource allocation of the downlink cognitive radio network with non-orthogonal multiple access (CRN-NOMA). NOMA, as the key technology of the fifth-generation communication (5G), can effectively increase the capacity of 5G networks. The optimization problem proposed in this paper aims to maximize the number of secondary users (SUs) accessing the system and the total throughput in the CRN-NOMA. Under the constraints of total power, minimum rate, interference and SINR, CRN-NOMA throughput is maximized by allocating optimal transmission power. First, for the situation of multiple sub-users, an adaptive optimization method is proposed to reduce the complexity of the optimization solution. Secondly, for the optimization problem of nonlinear programming, a maximization throughput optimization algorithm based on Chebyshev and convex (MTCC) for CRN-NOMA is proposed, which converts multi-objective optimization problem into single-objective optimization problem to solve. At the same time, the convergence and time complexity of the algorithm are verified. Theoretical analysis and simulation results show that the algorithm can effectively improve the system throughput. In terms of interference and throughput, the performance of the sub-optimal solution is better than that of orthogonal-frequency-division-multiple-access (OFDMA). This paper provides important insights for the research and application of NOMA in future communications.
Keywords:Resource allocation  non-orthogonal multiple access  cognitive radio network  throughput maximization  Chebyshev  convex
点击此处可从《》浏览原始摘要信息
点击此处可从《》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号