Secure Coverage Enhancement in Aerial Reconfigurable Intelligent Surface-Assisted High-Speed Train Communication Systems
Changzhu Liu, Ruisi He, Bo Ai, Yong Niu, Zhu Han, Gongpu Wang, Haoxiang Zhang, Jiahui Han, Zhangdui Zhong
Abstract
High-speed trains (HSTs) have become a prominent means of transportation, requiring high data rates and reliable communication services for HST passengers. However, the wireless channels in HST communication systems are susceptible to various security threats, including eavesdropping. Addressing these security concerns is therefore of critical importance. One promising technology for enhancing security is the integration of a reconfigurable intelligent surface (RIS) on an unmanned aerial vehicle, referred to as an aerial reconfigurable intelligent surface (ARIS). This technology offers significant potential for improving wireless network performance, though it also introduces unique challenges in terms of physical layer security (PLS). This paper investigates the PLS of ARIS-aided HST communication systems. A problem of maximizing the weighted sum secrecy rate is formulated by jointly optimizing the active beamforming at the base station (BS) and the phase shift at the ARIS, subject to constrains on the BS transmit power and the unit modulus of the ARIS reflecting coefficient. To address this problem, a joint optimization algorithm is proposed using the block coordinate descent method. Specifically, the problem is decomposed into two subproblems: active beamforming design and ARIS phase shift optimization. The active beamforming is optimally designed via the successive convex approximation technique, while the ARIS phase shift is efficiently updated using the alternating direction method of multipliers technique. Simulation results demonstrate the rapid convergence of the proposed algorithm, which achieves a higher secrecy rate compared to existing methods in the literature.
Create a lesson
Related papers
Auxiliary Codes and the Generalized Packing-Covering Conjecture
Isaac Barouch Essayag, Aryeh Lev Zabokritskiy
Low-Rank Masking for Single-Server Matrix Multiplication
Alejandro Cohen, Rafael G. L. D'Oliveira, Alex Sprintson
Computing the entropy rate of a quantized stationary Gaussian process
Jeremy Magland
Counterexample to a Proposed Capacity Characterization of the Relay Channel
Chun Hei Michael Shiu
Common Randomness: A Key Enabler of Trustworthy 6G Communication Systems
Rami Ezzine, Moritz Wiese, Wafa Labidi et al.
Information Spectrum Methods for -Capacity Problems in the Theory of Mixed Multiple-Access Channels with Cost Constraint
Te Sun Han, Hideki Yagi