Hyppää sisältöön
    • Suomeksi
    • In English
Trepo
  • Suomeksi
  • In English
  • Kirjaudu
Näytä viite 
  •   Etusivu
  • Trepo
  • TUNICRIS-julkaisut
  • Näytä viite
  •   Etusivu
  • Trepo
  • TUNICRIS-julkaisut
  • Näytä viite
JavaScript is disabled for your browser. Some features of this site may not work without it.

A Comparison Between RSMA, NOMA, and SDMA in Cell-Free Massive MIMO Systems: From Secrecy Perspective

Zhang, Yao; Zhu, Yongxu; Wang, Dongming; Xia, Wenchao; Lu, Weidang; Tan, Bo (2025-09-16)

 
Avaa tiedosto
A_Comparison_Between_RSMA_NOMA_and_SDMA_in_Cell-Free_Massive_MIMO_Systems.pdf (1.180Mt)
Lataukset: 



Zhang, Yao
Zhu, Yongxu
Wang, Dongming
Xia, Wenchao
Lu, Weidang
Tan, Bo
16.09.2025

IEEE Transactions on Communications
This publication is copyrighted. You may download, display and print it for Your own personal use. Commercial use is prohibited.
doi:10.1109/TCOMM.2025.3610223
Näytä kaikki kuvailutiedot
Julkaisun pysyvä osoite on
https://urn.fi/URN:NBN:fi:tuni-202510139833

Kuvaus

Peer reviewed
Tiivistelmä
This paper investigates secure transmission in the uplink of a cell-free massive multiple-input multiple-output (MIMO) system employing three distinct multiple access strategies: rate-splitting multiple access (RSMA), non-orthogonal multiple access (NOMA), and space-division multiple access (SDMA). RSMA, functioning as a unifying paradigm, merges the merits of both NOMA and SDMA, and holds substantial promise for enhancing system secrecy. We derive closed-form expressions for secrecy spectral efficiency (SE) under Rician fading channels and imperfect channel knowledge assumptions. The secrecy SE is subsequently evaluated across a range of system configurations, encompassing varying access point (AP) and user numbers, AP and eavesdropper antenna dimensions, line-of-sight probabilities, successive interference cancellation conditions, and multiple access protocols. Harnessing these expressions, we establish an optimization framework for the users’ power control coefficients and APs’ receiving weights to maximize the sum secrecy SE while ensuring quality-of-service secrecy requirements for users. Additionally, an alternative optimization algorithm is proposed to ascertain a high-quality solution. Comprehensive simulations substantiate our theoretical propositions and evaluate the efficacy of the proposed sum secrecy SE maximization algorithm.
Kokoelmat
  • TUNICRIS-julkaisut [22172]
Kalevantie 5
PL 617
33014 Tampereen yliopisto
oa[@]tuni.fi | Tietosuoja | Saavutettavuusseloste
 

 

Selaa kokoelmaa

TekijätNimekkeetTiedekunta (2019 -)Tiedekunta (- 2018)Tutkinto-ohjelmat ja opintosuunnatAvainsanatJulkaisuajatKokoelmat

Omat tiedot

Kirjaudu sisäänRekisteröidy
Kalevantie 5
PL 617
33014 Tampereen yliopisto
oa[@]tuni.fi | Tietosuoja | Saavutettavuusseloste