Jamming-Based Covert Communication for Rate-Splitting Multiple Access

We investigate secure communications for a rate-splitting multiple access (RSMA) system. In particular, a jamming-based covert communication (CC) technique is used to effectively prevent a warden from detecting the data communications. As the jamming signals also degrades the data rate of the users,...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on vehicular technology Jg. 72; H. 8; S. 11074 - 11079
Hauptverfasser: Nguyen, Trung Thanh, Luong, Nguyen Cong, Feng, Shaohan, Elbassioni, Khaled, Niyato, Dusit
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.08.2023
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Algorithms
Covert communication
Data communication
dual approximation algorithm
Interference
Jamming
NOMA
Nonorthogonal multiple access
Optimization
Power
Quadratic programming
Radio transmitters
rate-splitting multiple access
Security
Simulation
Splitting
Transmitting antennas
ISSN:0018-9545, 1939-9359
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We investigate secure communications for a rate-splitting multiple access (RSMA) system. In particular, a jamming-based covert communication (CC) technique is used to effectively prevent a warden from detecting the data communications. As the jamming signals also degrades the data rate of the users, we formulate an optimization problem that maximizes the minimum data rate over all the users subject to the constraints on the security requirement and power budgets of the transmitter and optimize the data rate, transmit power, and jamming power. The max-min problem is non-convex, and we propose a fast exponential algorithm which can produce a global optimal solution to the problem. The simulation results show that our proposed algorithm outperforms the sequential quadratic programming algorithm, a powerful algorithmic tool for solving nonlinear optimization problems, in terms of min-rate and execution time (for a small number of users), given the same security requirement. Additionally, it is observed through simulation that RSMA can achieve up to three times better than non-orthogonal multiple access (NOMA) in terms of min-rate.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0018-9545
1939-9359
DOI:10.1109/TVT.2023.3259963