Papers for

satellite communications engineers

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

Atmospheric model predicts quantum satellite communication channel behavior

Atmospheric channel model for QKD over satellite megaconstellations

Abstract: Atmospheric turbulence and channel loss represent the primary limiting factors in ground-to-satellite quantum communication systems, yet their joint impact remains insufficiently characterized across diverse operational conditions. In this work, we develop a comprehensive and open atmospheric channel model for quantum optical links along ground-to-satellite paths, integrating altitude-dependent molecular and aerosol absorptions. The model is validated with available data from missions such as Micius and Hispasat, including a secondary viability assessment for a hypothetical Starlink-based quantum communication network, where we evaluate the predicted channel behavior in terms of single-photon transmittance and power balance, alongside the channel capacity of the link for uplink and downlink exclusively. Our comparative analysis demonstrates the ability of our channel model to predict real data under simple atmospheric behavior assumptions, which offer practical guidelines for the design and optimization of future quantum satellite missions.

Tue 20 OctNetworking and Internet Architecture
The gist
Communicating with satellites using quantum signals faces challenges from atmospheric turbulence and signal loss, which are hard to measure together under many conditions. The authors created a detailed model that combines effects from different altitudes and kinds of particles in the air. They tested the model against real mission data and simulated how future quantum networks might perform. Their model helps predict how well quantum signals travel between the ground and satellites, aiding future satellite mission designs.
Open → 2610.27856v1

Finite block coding bounds for gaussian sources over erasure channels

Joint Source-Channel Coding of Gaussian Sources over Block Erasure Channels: Nonasymptotic Bounds and Channel-Uniform Normal Approximations

Abstract: We study finite-blocklength lossy transmission of a Gaussian memoryless source over memoryless, possibly nonstationary block erasure channels under an excess mean-squared distortion criterion. We derive computable nonasymptotic achievability and converse bounds and establish matching third-order, channel-uniform normal approximations. Our nonasymptotic achievability bound follows from an exact evaluation of the ensemble-average excess-distortion probability of a specified random coding scheme and improves known general one-shot bounds (Kostina-Verdú 2013, Li-Anantharam 2021) evaluated with the same channel input and source reproduction distributions. Our nonasymptotic converse argument conditions on the erasure pattern and combines an energy-conditioned spherical-cap bound with a volume bound. The spherical-cap argument retains the geometric prefactor needed to identify the converse third-order term. In our channel-uniform normal approximation, we show that for fixed distortion ratio, target excess-distortion probability, and block size, the required source blocklength and remainder constants are independent of the channel blocklength and erasure-probability profile. Both the sufficient and necessary information-balance conditions contain the term $\frac12\log k$, where $k$ is the source blocklength, and differ only in bounded remainder terms. The analysis combines a threshold-uniform normal approximation for functions of the source energy, logistic and exponential random-threshold representations, and source-induced Gaussian smoothing of the channel information. Numerical evaluations compare the nonasymptotic bounds with their common third-order normal approximation. Our results provide a benchmark for transmitting a high-dimensional source using a small number of packets.

Wed 30 SeptInformation Theory
The gist
Sending data like images or sound over unreliable networks is tricky because some parts can get lost, causing errors. This paper studies how to send chunks of data from a simple type of information source (Gaussian) over channels that might lose entire blocks of data. The authors provide precise mathematical limits on how well the data can be compressed and recovered at finite block sizes, not just for very long transmissions. They present improved bounds and approximations that work uniformly for different block loss patterns, helping to understand the tradeoffs when only a few packets are sent.
Open → 2609.38725v1

Mars local computing reduces delays and boosts data from robotic missions

Bandwidth, Latency, and 400 Million Kilometers: The Case for Mars-Local Compute

Abstract: There have been recent proposals for human settlements on Mars in 2030s. Any human activity on Mars must be preceded by extensive robotic exploration. However, Mars exploration is bottlenecked by the low bandwidth, intermittent Mars-Earth link. For example, HiRISE, a high-resolution camera onboard the Martian orbiter MRO imaged less than 3% of Mars over eleven years, even though MRO's low resolution Context Camera had mapped more than 99% of Mars in that time. We present a systems case for shared compute for Mars exploration. Such Mars-local compute, paired with advances in computer vision and AI, can enable large volumes of data to be collected and processed on Mars while sending periodic updates, insights, and selective datasets to Earth. To overcome the lack of surface infrastructure on Mars, we propose a two-tier in-orbit deployment of computational satellites that provides consistent coverage and bandwidth. Our analysis shows that the proposed deployment can start small: one areostationary node makes compute reachable from all active Mars missions, two additional areostationary nodes can extend this coverage to roughly 90% of the planet, while low-Mars-orbit nodes add high-rate surface links and compute capacity where demand grows.

Fri 25 SeptDistributed, Parallel, and Cluster ComputingNetworking and Internet Architecture
The gist
Sending information from Mars to Earth is very slow and often interrupted, which limits how much data robots can send back. The authors suggest placing computers in Mars orbit to process lots of data locally, then only sending important updates to Earth. This setup would include satellites that stay in fixed positions above Mars, covering most of the planet and helping robots explore more effectively. This could make robotic missions much more productive before we send humans there.
Open → 2609.31566v1

LLM agent improves routing with dynamic quality service in LEO satellites

STR-Agent: An LLM-Driven Agent for QoS-Aware Routing in LEO Satellite Networks

Abstract: LEO satellite networks feature dynamic topologies, time-varying links, and diverse service requirements, which make conventional routing schemes difficult to support fine-grained quality-of-service (QoS) provisioning. Existing studies mainly optimize routing over network states with predefined objectives, but rarely address the practical challenge of translating unstructured natural-language service requests into adaptive routing decisions. To bridge this gap, we propose STR-Agent, an LLM-driven framework for QoS-aware routing in LEO satellite networks. The key innovation of STR-Agent lies in unifying intent perception, tool-based execution, experience accumulation, and reflection-based policy adaptation within a single agent architecture. Specifically, the Perception Module converts natural-language requests into structured routing semantics, while the Reflection Module dynamically adjusts the service-to-routing-policy mapping according to real-time congestion conditions and historical routing outcomes, rather than relying on a fixed routing objective. In addition, we develop a specialized perception model, and construct a domain-specific supervised fine-tuning dataset for LEO service understanding. Simulation results in a Walker-Delta constellation show that STR-Agent significantly outperforms conventional baselines: it reduces end-to-end delay by up to 60% compared with DQ-Dijkstra, improves average intent-understanding accuracy from 45.4% to 92.45% after supervised fine-tuning, and the Reflection Module further reduces the delay by 120 ms at 600 Mbps. These results demonstrate the potential of LLM-driven agent architectures to enable service-aware and adaptive QoS routing in future LEO satellite networks.

Thu 17 SeptNetworking and Internet ArchitectureArtificial Intelligence
The gist
LEO satellite networks are tricky because their connections change all the time, and different users need different service types. The authors made STR-Agent, a smart system that understands natural language requests and turns them into routing instructions customized for network conditions. It learns from past results and adjusts on the fly to keep the network running smoothly. In simulated tests, STR-Agent lowered delays and better understood user needs compared to older methods.
Open → 2609.20347v1