Frontend
Fluid Antenna-Aided Robust Secure Uplink Transmission in LEO Satellite Constellations
arXiv math.IT0 views
arXiv:2605.18099v2 Announce Type: replace Abstract: Secure uplink transmission in low-earth orbit (LEO) satellite constellations faces significant challenges due to the time-varying spatial distributions of serving and potential eavesdropping satellites, particularly when their angular separations are small and eavesdropper channel state information (CSI) is imperfect. To address these challenges, this paper investigates fluid antenna (FA)-aided robust secure uplink transmission in LEO satellite constellations. To avoid frequent antenna reconfiguration, the FA positions are optimized over an observation interval and remain fixed throughout the interval, while transmit beamforming dynamically adapts to the time-varying satellite channels. We formulate an average worst-case secrecy rate maximization problem by jointly optimizing FA positions and time-varying beamforming under norm-bounded eavesdropper CSI uncertainties and per-slot secrecy rate constraints. Two new alternating optimization (AO) algorithms are developed to solve the resulting non-convex problem. For robust beamforming optimization, the S-procedure, semidefinite relaxation (SDR), and first-order approximation are employed to construct a tractable convex problem, followed by Gaussian randomization for rank-one recovery. For FA position optimization, we derive concave surrogate functions for successive convex approximation (SCA) and develop a differential evolution (DE)-based search strategy to reduce computational complexity. Numerical results demonstrate that both FA-aided schemes consistently outperform conventional fixed-position antenna arrays across different constellation configurations and CSI uncertainty levels. Moreover, the two algorithms exhibit different performance-complexity tradeoffs as the number of FA elements increases, with DE offering a computational advantage for larger arrays while SCA can achieve higher secrecy rates.
Source:https://arxiv.org/abs/2605.18099PreviousA class of asymptotically optimal authentication codes with secrecyNextPerfect Codes As Exact Minimizers Of Quadratic Discrepancy In q-ary Hamming Spaces
Related posts
마이크로드라마 열풍 속 '눈 건강'의 역설, Amblyotube가 제시하는 새로운 해법 — 개발자이자 약시 경험자의 시선에서
0dev.to
Reconcile an email research batch before comparing providers
0dev.to
They don't make 'em like that any more: Borland Turbo Pascal 7
0Hacker News
Institute for Advanced Study's Electronic Computer Project (1946 – 1954)
0Hacker News New
Why the Fascination with Retrocomputing?
0Hacker News New

Auditing 3,300 Files and 153 Claude Code & Codex Logs: Why 39.0% of Agent Functions Are Written Without Searching the Repo
0dev.to