Secrecy Sum Rate Maximization for a MIMO-NOMA Uplink Transmission in 6G networks

Physical Communication 2022  ·  Yunus Dursun, Kaidi Wang, Zhiguo Ding ·

Non-orthogonal multiple access (NOMA), as a well-qualified candidate for sixth-generation (6G) mobile networks, has been attracting remarkable research interests due to high spectral efficiency and massive connectivity. The aim of this study is to maximize the secrecy sum rate (SSR) for a multiple-input multiple-output (MIMO)-NOMA uplink network under the maximum total transmit power and quality of service (QoS) constraints. Thanks to the generalized singular value decomposition method, the SSR of NOMA is compared with conventional orthogonal multiple access and other baseline algorithms in different MIMO scenarios. Due to the subtractive and non-convex nature of the SSR problem, the first-order Taylor approximation is exploited to transform the original problem into a suboptimal concave problem. Simulation results are provided and compared with some other benchmarks to evaluate the efficacy of the proposed method.

PDF Abstract

Code
Add Remove Mark official

No code implementations yet. Submit your code now

Tasks
Add Remove

Datasets

  Add Datasets introduced or used in this paper

Results from the Paper
Add Remove

  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.

Methods
Add Remove

No methods listed for this paper. Add relevant methods here
Contact us on: hello@paperswithcode.com . Papers With Code is a free resource with all data licensed under CC-BY-SA.
Terms Data policy Cookies policy