Search arXiv⌕ Search

arXiv · 2609.34728

Robust Resource Management for SAGIN using DNN-Driven Channel Uncertainty Learning

Abstract

This paper focuses on the joint robust beamforming and resource allocation for space-air-ground integrated networks (SAGIN) under uncertain channel state information (CSI). In SAGIN, uncertain CSI undermines the precise adjustment of beamforming and resource allocation, posing a major challenge to meeting heterogeneous users' strict quality of service (QoS) requirements. To address this challenge, we first formulate a chance-constrained optimization problem to minimize the total transmit power while satisfying QoS requirements under a predefined outage probability. By leveraging semidefinite relaxation (SDR), the objective function is transformed into a linear function of the traces of the beamforming matrices. Then, we propose a deep neural network (DNN)-driven channel uncertainty learning to dynamically learn and model the uncertain CSI as an asymmetric uncertainty set. Under the constructed CSI uncertainty set, a robust counterpart method based on pre-trained network parameters is developed. It characterizes the uncertainty set as a finite union of convex sets, thereby providing a tractable approximation for the original chance constraints. Finally, we design an adaptive iterative algorithm to jointly optimize the resource allocation and beamforming vectors. Simulation results show that our proposed DNN-driven method outperforms traditional robust and non-robust methods, achieving a superior energy efficiency and robust reliability in SAGIN.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Haonan Zhang, Weihua Wu, Qi Zhang, Runzi Liu, Zewei Jing, Weijia Han. 2026-09-28. Robust Resource Management for SAGIN using DNN-Driven Channel Uncertainty Learning. https://arxiv.org/abs/2609.34728

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

KEEP EXPLORING

Related papers

Rate Loss Analysis for Multiple-Antenna NOMA with Limited Feedback

In the limited feedback downlink multiple-input single-output (MISO) non-orthogonal multiple access (NOMA) system, both the effective channel gain and the channel direction need to be quantized. The quantization error affects the feasible region of NOMA and the rate loss compared with the case of full channel state information (CSI). In this work, we analyze these effects and obtain an upper bound for the rate loss. Numerical results show that the sum rate of the limited feedback MISO-NOMA system approaches that of the full CSI as the number of feedback bits increases.

cs.IT↗

Singleton-Optimal Rank-Metric CSS Codes : Equality Structure and Exact Projected-Recovery Radii

Correlated faults from shared control can have dense physical support yet low rank over a base field, motivating rank-metric quantum codes for stacked architectures. We prove an asymmetric rank-metric Singleton bound for Calderbank--Shor--Steane codes, including degenerate codes, and characterize equality through commuting maximum-rank-distance matrix codes. Optimal pairs exist for every admissible parameter triple and are necessarily pure. Comparison with erasure bounds establishes an exact advantage in stacked rank distance for general stabilizer codes at fixed physical resources on certain tall layouts. We determine whether relaxing the recovery target enlarges the worst-case correctable radius. For Singleton-optimal pairs with positive logical dimension, the measured syndrome determines the projected error modulo stabilizers exactly at radii strictly below half the sector rank distance, on every layout and for every nonzero projector. The projected syndrome is recoverable at arbitrary radii exactly when the complementary check space is invariant under the adjoint projector; otherwise, the same radius limit applies. For nontrivial idempotents, this invariance requires more rows than columns or sector distance one. For trace-self-adjoint projectors, linear ambient projected-syndrome interfaces in both sectors exist exactly when the code splits as a tensor product across the projector. Designs placing the two check spaces in complementary projector images are necessarily one-sided whenever they encode logical information. Two explicit families realize the extreme cases of the equality structure, including a two-sided family with an efficient certifying decoder attaining the optimal unique-decoding radius.

cs.IT↗

On the Lack of Periodicity of Walker Satellite Constellation Routing Tables

In a referential that rotates with Earth, the dynamics of the configurations of satellites in a Delta Walker constellation can be analyzed as a dynamical system as a function of a translation on the torus. This paper extends this type of analysis to routing over a Walker constellation, leveraging fixed ground relays. It considers any deterministic, time-invariant routing rule on such a collection of satellites and relays. The main object of interest is the routing table associated with this rule, which specifies, for all source-destination pairs, a route made of satellites and relays between them, for instance the shortest, together with angular information on next hop at each step of the route, which is essential for beamforming in this context. The main result is that, for each such routing rule, the routing table inherits the dichotomy of the torus flow: when the ratio of the Earth-spin and satellite angular speeds is rational, the routing table process is periodic with the same period as the constellation. When it is irrational, the table is non periodic but admits ergodic long-run averages which can be computed as ensemble averages w.r.t. an explicit invariant measure. Simulations with mixed satellite--gateway greedy routing illustrate these findings in terms of both temporal and spectral properties of the Walker routing table time series. The paper also discusses how to define metrics that cope with such non periodic fluctuations when present. This is illustrated by a comparison of the round-trip times between two far away cities as offered by a Walker constellation using greedy routing on one side, and by the currently available terrestrial fiber on the other side. It is shown how ergodicity can be used to make this comparison between the time varying instantaneous round trip times of the constellation and the constant round trip time of the fiber network meaningful.

cs.IT↗