Resource Allocation in Multi-Carrier Multiplexed NOMA Cooperative System

Jie Zeng; Jiaying Sun; Yuxin Song; Jiajia Mei; Tiejun Lv; Shidong Zhou

doi:10.3390/s22166023

Resource Allocation in Multi-Carrier Multiplexed NOMA Cooperative System

Sensors (Basel). 2022 Aug 12;22(16):6023. doi: 10.3390/s22166023.

Authors

Jie Zeng^{1

2}, Jiaying Sun³, Yuxin Song⁴, Jiajia Mei⁵, Tiejun Lv⁶, Shidong Zhou^{1

2}

Affiliations

¹ Beijing National Research Center for Information Science and Technology, Tsinghua University, Beijing 100084, China.
² Department of Electronic Engineering, Tsinghua University, Beijing 100084, China.
³ State Key Laboratory of Wireless Mobile Communications, China Academy of Telecommunication Technology, Beijing 100084, China.
⁴ School of Communication and Information Engineering, Chongqing University of Posts and Telecommunications, Chongqing 400065, China.
⁵ The National Key Laboratory of Science and Technology on Communications, University of Electronic Science and Technology of China, Chengdu 611731, China.
⁶ School of Information and Communication Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China.

Abstract

Non-orthogonal multiple access (NOMA) cooperative communication technology can combine the advantages of NOMA and cooperative communication, providing high spectrum efficiency and increasing user coverage for next-generation wireless systems. However, the research on NOMA cooperative communication technology is still in a preliminary stage and has mainly concentrated on the scenario of fewer users. This paper focuses on a user-centered NOMA collaboration system in an ultra-dense network, and it constructs a resource allocation optimization problem to meet the demands of each user. Then, this paper decomposes the optimization problem into two subproblems; one is the grouping match among multiple relays and users, and the other is jointly allocating power and subcarrier resources. Accordingly, a dynamic packet matching algorithm based on Gale-Shapley and an iterative algorithm based on the difference of convex functions programing are proposed. Compared with existing schemes, the proposed algorithms can improve system throughput while ensuring the quality of service of users.

Keywords: cooperative communication; dynamic group matching; non-orthogonal multiple access; resource allocation; ultra-dense networks.

Grants and funding

This work was supported by the National Natural Science Foundation of China (No. 62001264), the Natural Science Foundation of Beijing (No. L192025), and the National Key R & D Program (No. 2018YFB1801102).