Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2607.12328

Metasurface Antenna-Enabled LEO Satellite Constellation Communications: Design and Optimization

Wenfei Yao·Xiaoming Chen·Qi Wang·Qiao Qi·Ming Ying
View original source ↗Read source document ↗Export metadata ↓

Abstract

Next-generation low Earth orbit (LEO) satellite constellations face critical bottlenecks in spectral efficiency and onboard hardware complexity. To overcome these limitations, this paper introduces a novel architecture enabled by metasurface antennas (MAs) at the LEO satellites. In particular, MAs are metasurface-integrated feed antennas that perform high-precision beamforming directly in the wave domain, thereby effectively mitigating multi-user interference. Based on such an antenna architecture, a weighted sum rate (WSR) maximization problem is formulated by jointly optimizing the scheduling of feed antennas to terrestrial users (TUs) and the passive beamforming of the metasurface for system performance enhancement. To address this mixed-integer nonlinear programming (MINLP) challenge, an alternating optimization (AO)-based joint scheduling and beamforming algorithm is proposed. On the one hand, the proposed algorithm incorporates a polynomial-time minimum-cost maximum-flow (MCMF) method, which is dedicated to the optimal scheduling of feed antennas and TUs. On the other hand, it adopts a weighted minimum mean square error (WMMSE) method integrated with semidefinite relaxation (SDR) technique, which is tailored for metasurface beamforming design. Simulation results confirm the effectiveness of the proposed algorithm for MA-enabled LEO satellite constellation communications.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Wenfei Yao, Xiaoming Chen, Qi Wang, Qiao Qi, Ming Ying. 2026-07-14. Metasurface Antenna-Enabled LEO Satellite Constellation Communications: Design and Optimization. https://arxiv.org/abs/2607.12328

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗