SearcharxivSearch

arXiv · 2608.14755

Resilient Spectrum Scheduling for Colocated Space Networks

Abstract

Ground station handovers across Earth based Deep Space Network (DSN) terminals incur carrier lock reacquisition delays of 4 to 8 minutes per event, introducing periodic telemetry blackouts during cislunar flights. We address this limitation by formulating temporal handover sequences as perfect interval conflict graphs. For single spacecraft trajectories, we establish that adding a single reserve channel ($k=4$) enables static offline channel preallocation, eliminating spacecraft transponder retuning during station switches. To sustain link availability under unexpected atmospheric fades or station outages, we construct a Robust Space Communication Graph (R-SCG) model, demonstrating that four channels suffice to maintain uninterrupted coverage under single node failure conditions. For unmodeled link disruptions, we implement a distributed local recoloring scheme with $O(1)$ amortized complexity, augmented by Random Forest state classification for predictive channel reassignment. Furthermore, for colocated spacecraft clusters, we show that the joint ground space conflict graph retains chordality, bounding the required spectrum to $3+c$ channels for $c$ concurrent assets. A 10 day orbital simulation demonstrates that static channel preassignment recovers up to 2.7~hours of telemetry throughput relative to conventional reactive handover schemes.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Most Esrat Jahan, Md. Kamrujjaman. 2026-08-14. Resilient Spectrum Scheduling for Colocated Space Networks. https://arxiv.org/abs/2608.14755

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

KEEP EXPLORING

Related papers

Average Chord Lengths in a Triangle

Let $P$ be a point inside a triangle $T$. We consider the average length of the chords of $T$ through $P$, where the direction of the chord is chosen uniformly. An elementary formula is obtained in terms of the distances from $P$ to the sides and vertices of the triangle. Several classical triangle centers give especially simple specializations. For example, if $I$ is the incenter, then \[ M_T(I)=\frac{2r}{\pi} \log\left(\cot\frac A4\cot\frac B4\cot\frac C4\right). \] Our main result is the sharp inequality \[ M_T(P)\le \frac{p}{\pi\sqrt3}\log(2+\sqrt3), \] valid simultaneously for every triangle of perimeter $p$ and every interior point $P$. Thus, among all such pairs $(T,P)$, the largest possible average chord length occurs only when $T$ is equilateral and $P$ is its center. The proof is an elementary symmetrization argument. We close with brief remarks relating the problem to the radial center of a convex body, the electrostatic potential center of a triangle, and dual quermassintegrals.

math.GM

A Proof of Liu's Conjecture on the Fundamental Triangle Inequality

Let $a,b,c$ be the side lengths of a triangle, and let $R$ and $r$ denote its circumradius and inradius, respectively. We prove a conjecture of Liu stating that \[\sum_{\mathrm{cyc}} \left(\frac{a(b+c-a)}{bc}\right)^k \geq 2+\left(\frac{2r}{R}\right)^k,~~k>1, \] with the reverse inequality for $0<k<1$. The proof reduces the problem to three positive variables with fixed sum and product. We also determine the equality cases.

math.GM