Movable Antennas-Assisted Secure Transmission Without Eavesdroppers' Instantaneous CSI

• Published in: IEEE transactions on mobile computing 2024-12, Vol.23 (12), p.14263-14279
• Main Authors: Hu, Guojie, Wu, Qingqing, Xu, Donghui, Xu, Kui, Si, Jiangbo, Cai, Yunlong, Al-Dhahir, Naofal
• Format: Magazinearticle
• Language: English
• Subjects: Antennas; Array signal processing; Eavesdropping; Laguerre series approximation; Movable antennas; Power system reliability; Probability; projected gradient ascent/descent; Receiving antennas; secrecy outage probability; transmit beamforming; Transmitting antennas
• ISSN: 1536-1233; 1558-0660
• DOI: 10.1109/TMC.2024.3438795

Movable antenna (MA) technology is highly promising for improving communication performance, due to its advantage of flexibly adjusting positions of antennas to reconfigure channel conditions. In this paper, we investigate MAs-assisted secure transmission under a legitimate transmitter Alice, a legitimate receiver Bob and multiple eavesdroppers. Specifically, we consider a practical scenario where Alice has no any knowledge about the instantaneous non-line-of-sight component of the wiretap channel. Under this setup, we evaluate the secrecy performance by adopting the secrecy outage probability metric, the tight approximation of which is first derived by interpreting the Rician fading as a special case of Nakagami fading and concurrently exploiting the Laguerre series approximation. Then, we minimize the secrecy outage probability by jointly optimizing the transmit beamforming and positions of antennas at Alice. However, the problem is highly non-convex because the objective includes the complex incomplete gamma function. To tackle this challenge, we, for the first time, effectively approximate the inverse of the incomplete gamma function as a simple linear model. Based on this approximation, we arrive at a simplified problem with a clear structure, which can be solved via the developed alternating projected gradient ascent (APGA) algorithm. Considering the high complexity of the APGA, we further design another scheme where the zero-forcing based beamforming is adopted by Alice, and then we transform the problem into minimizing a simple function which is only related to positions of antennas at Alice. Such problem is well-solved via another projected gradient descent algorithm developed with a lower complexity. As demonstrated by simulations, our proposed schemes achieve significant performance gains compared to conventional schemes based on fixed-position antennas.