TY - JOUR
T1 - Secrecy sum rate maximization for a MIMO-NOMA uplink transmission in 6G networks
AU - Dursun, Y
AU - Wang, KD
AU - Ding, ZG
N1 - Funding Information:
The authors would like to thank the editor-in-chief and the anonymous referees for their useful comments and suggestions. This work was supported by Republic of Turkey Ministry of National Education .
Publisher Copyright:
© 2022 Elsevier B.V.
PY - 2022/8
Y1 - 2022/8
N2 - 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.
AB - 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.
KW - multiple input multiple output (MIMO)
KW - non-orthogonal multiple access (NOMA)
KW - physical layer security (PLS)
KW - sixth generation radio access networks (6G-RAN)
UR - https://www.scopus.com/pages/publications/85126551835
UR - https://www.mendeley.com/catalogue/aff87f05-64ce-377e-99f0-18c5c1369b59/
U2 - 10.1016/j.phycom.2022.101675
DO - 10.1016/j.phycom.2022.101675
M3 - Article
SN - 1876-3219
VL - 53
SP - 1
EP - 7
JO - Physical Communication
JF - Physical Communication
M1 - 101675
ER -