.png){kind=icon}
返回
Jamming-Based Covert Communication for Rate-Splitting Multiple Access
.png){kind=icon}
PRE
AI
DOI：10.1109/TVT.2023.3259963.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
Covert communication
dual approximation algorithm
jamming
rate-splitting multiple access
期刊
IF:
7.1
论文数:
1.8W
被引数:
6.6W
机构
引用论文
.png){kind=icon}
A Primer on Rate-Splitting Multiple Access: Tutorial, Myths, and Frequently Asked Questions速率拆分多路访问入门: 教程，神话和常见问题
OAAI
OAAI分享收藏分享收藏分享收藏分享收藏Latency Minimization in Covert Communication-Enabled Federated Learning Network启用隐蔽通信的联邦学习网络中的延迟最小化
PREAI
分享收藏
查看更多内容