Sum Rate Maximization for Movable Antenna Enhanced Multiuser Covert Communications
Haobin Mao, Xiangyu Pi, Lipeng Zhu, Zhenyu Xiao, Xiang-Gen Xia, Rui, Zhang

TL;DR
This paper introduces a movable antenna system to enhance covert multiuser communications, optimizing antenna positions and beamforming to significantly improve the sum rate under covertness constraints.
Contribution
It presents a novel joint optimization framework for antenna positioning and beamforming in movable antenna systems to maximize covert communication sum rate.
Findings
Movable antennas outperform fixed-position antennas in covert sum rate.
The proposed algorithm effectively optimizes antenna positions and beamforming.
Simulation results confirm significant sum rate improvements.
Abstract
In this letter, we propose to employ movable antenna (MA) to enhance covert communications with noise uncertainty, where the confidential data is transmitted from an MA-aided access point (AP) to multiple users with a warden attempting to detect the existence of the legal transmission. To maximize the sum rate of users under covertness constraint, we formulate an optimization problem to jointly design the transmit beamforming and the positions of MAs at the AP. To solve the formulated non-convex optimization problem, we develop a block successive upper-bound minimization (BSUM) based algorithm, where the proximal distance algorithm (PDA) and the successive convex approximation (SCA) are employed to optimize the transmit beamforming and the MAs' positions, respectively. Simulation results show that the proposed MAs-aided system can significantly increase the covert sum rate via antenna…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsWireless Communication Security Techniques · Internet Traffic Analysis and Secure E-voting · Cooperative Communication and Network Coding
MethodsMixing Adam and SGD
