Search arXivSearch

arXiv · 2509.00901

Movable Antenna Empowered Secure Near-Field MIMO Communications

Abstract

This paper investigates movable antenna (MA) empowered secure transmission in near-field multiple-input multiple-output (MIMO) communication systems, where the base station (BS) equipped with an MA array transmits confidential information to a legitimate user under the threat of a potential eavesdropper. To enhance physical layer security (PLS) of the considered system, we aim to maximize the secrecy rate by jointly designing the hybrid digital and analog beamformers, as well as the positions of MAs at the BS. To solve the formulated non-convex problem with highly coupled variables, an alternating optimization (AO)-based algorithm is introduced by decoupling the original problem into two separate subproblems. Specifically, for the subproblem of designing hybrid beamformers, a semi-closed-form solution for the fully-digital beamformer is first derived by a weighted minimum mean-square error (WMMSE)-based algorithm. Subsequently, the digital and analog beamformers are determined by approximating the fully-digital beamformer through the manifold optimization (MO) technique. For the MA positions design subproblem, we utilize the majorization-minimization (MM) algorithm to iteratively optimize each MA's position while keeping others fixed. Extensive simulation results validate the considerable benefits of the proposed MA-aided near-field beam focusing approach in enhancing security performance compared to the traditional far-field and/or the fixed position antenna (FPA)-based systems. In addition, the proposed scheme can realize secure transmission even if the eavesdropper is located in the same direction as the user and closer to the BS.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yaodong Ma, Kai Liu, Yanming Liu, Lipeng Zhu. 2025-08-31. Movable Antenna Empowered Secure Near-Field MIMO Communications. https://arxiv.org/abs/2509.00901

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT