Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/30457
Title: Secure MIMO Communication Relying on Movable Antennas
Authors: Tang, J
Pan, C
Zhang, Y
Ren, H
Wang, K
Keywords: movable antenna (MA);physical layer security (PLS);artificial noise (AN);antenna position optimization
Issue Date: 20-Sep-2024
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Citation: Tang, J, et al. (2024) 'Secure MIMO Communication Relying on Movable Antennas', IEEE Transactions on Communications, 0 (early access), pp. 1- 17. doi: 10.1109/TCOMM.2024.3465369.
Abstract: This paper considers a movable antenna (MA)-aided secure multiple-input multiple-output (MIMO) communication system consisting of a base station (BS), a legitimate information receiver (IR) and an eavesdropper (Eve), where the BS is equipped with MAs to enhance the system's physical layer security (PLS). Specifically, we aim to maximize the secrecy rate (SR) by jointly optimizing the transmit precoding (TPC) matrix, the artificial noise (AN) covariance matrix and the MAs' positions under the constraints of the maximum transmit power and the minimum spacing between MAs. To solve this non-convex problem with highly coupled optimization variables, the block coordinate descent (BCD) method is applied to alternately update the variables. Specifically, we first reformulate the SR into a tractable form, and derive the optimal TPC matrix and the AN covariance matrix with fixed MAs' positions by applying the Lagrangian multiplier method in semi-closed forms. Then, the majorization-minimization (MM) algorithm is employed to iteratively optimize each MA's position while keeping others fixed. We also extend the above work to a more general multicast scenario. Finally, simulation results are provided to demonstrate the effectiveness of the proposed algorithms and the significant advantages of the MAs over conventional fixed position antennas (FPAs) in enhancing system's security.
Description: A preprint version of the article is available at arXiv:2403.04269v1 [cs.IT], https://arxiv.org/abs/2403.04269 . It has not been certified by peer review.
URI: https://bura.brunel.ac.uk/handle/2438/30457
DOI: https://doi.org/10.1109/TCOMM.2024.3465369
ISSN: 0090-6778
Other Identifiers: ORCiD: Jun Tang https://orcid.org/0009-0003-6000-2307
ORCiD: Cunhua Panhttps://orcid.org/0000-0001-5286-7958
ORCiD: Yang Zhang https://orcid.org/0009-0000-1659-1536
ORCiD: Hong Ren https://orcid.org/0000-0002-3477-1087
arXiv:2403.04269v1 [cs.IT]
Appears in Collections:Dept of Computer Science Research Papers

Files in This Item:
File Description SizeFormat 
FullText.pdfCopyright © 2024 Institute of Electrical and Electronics Engineers (IEEE). Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works by sending a request to pubs-permissions@ieee.org (see: https://journals.ieeeauthorcenter.ieee.org/become-an-ieeejournal- author/publishing-ethics/guidelines-and-policies/post-publication-policies/ for more information).791.5 kBAdobe PDFView/Open


Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.