Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2611.06726

Intra-Cell Spatial Reuse in LEO Downlinks: Beam-Leakage-Aware Satellite Scheduling

Shizhen Jia·Hao Guo·Ruoyu Sun·Hans Geerdes·Mark Poletti·Songwei Dong·Lauryn Smith·Sundeep Rangan
View original source ↗Read source document ↗Export metadata ↓

Abstract

Dense low-earth-orbit (LEO) constellations offer an opportunity to increase local broadband capacity by serving multiple terminals in the same cell through concurrent satellite beams. However, interference between overlapping beams limits spatial reuse, and satellite selection based solely on link strength or angular separation may result in suboptimal performance. This paper proposes beam-leakage-aware satellite scheduling for Ku-band LEO downlink transmissions. With matched transmit and receive beamforming, we formulate a fixed-cardinality sum-rate maximization problem that jointly accounts for satellite-dependent received powers and pairwise receive-array leakage. A beam-leakage-aware branch-and-bound (BL-BnB) algorithm combines an admissible upper bound with greedy-plus-swap initialization to obtain globally optimal schedules for the reference-point model. We evaluate the method using a 24-h ephemeris-derived Starlink visibility trace with antenna and transmit-power models calibrated to public SpaceX filings. The results show that total capacity increases with beam count, but less than proportionally. With eight concurrent beams, BL-BnB improves mean per-beam capacity by 27.2% over nearest-satellite selection, primarily benefiting weaker links. BL-BnB achieves millisecond-scale runtimes in our evaluation, supporting the computational feasibility of optimal scheduling.

Explore related subjects

eess.SP

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Shizhen Jia, Hao Guo, Ruoyu Sun, Hans Geerdes, Mark Poletti, Songwei Dong, Lauryn Smith, Sundeep Rangan. 2026-11-04. Intra-Cell Spatial Reuse in LEO Downlinks: Beam-Leakage-Aware Satellite Scheduling. https://arxiv.org/abs/2611.06726

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

KEEP EXPLORING

Related papers

arXiv2026

DDA-Net: Accurate TDD Channel Estimation via Deep Unfolding the Doppler-Delay-Angle Representation of Channel Signals

In TDD massive MIMO systems, channel estimation under sparse frequency-hopping pilots is challenging: each snapshot captures only one narrow pilot block that hops across frequency, with tens of milliseconds between adjacent snapshots. Finite-window leakage and off-grid effects weaken the ideal Doppler-delay-angle (DDA) sparsity, limiting both classical sparse recovery and purely data-driven approaches lacking an explicit structured transform-domain model. We propose DDA-Net, a model-driven 3D deep unfolding network for joint multi-snapshot channel state reconstruction. DDA-Net integrates an ADMM-based formulation with a closed-form data-consistency update that avoids tensor inversion, a lightweight Doppler-domain learned prior, and delay oversampling to mitigate basis mismatch. It consistently outperforms strong baselines across three channel settings from 3GPP TR 38.901: UMa-NLOS, UMi-NLOS, and CDL-B. Ablations confirm that window-level 3D processing and explicit Doppler modeling yield target-dependent improvements. With minimal target-domain fine-tuning, the UMa-pretrained model surpasses both its zero-shot version and counterparts trained from scratch with the same number of target-domain samples. The Doppler-domain design proves consistently superior to its time-domain equivalent, with a wider margin after fine-tuning. These results demonstrate that combining exact physical data consistency with a learned DDA-domain prior is an effective and sample-efficient approach to channel state acquisition under sparse frequency-hopping pilots.

eess.SP↗
arXiv2026

Optimal symmetric low-rank BD-RIS configuration maximizing the determinant of a MIMO link

Beyond-diagonal reconfigurable intelligent surfaces (BD-RISs) significantly improve wireless performance by allowing tunable interconnections among elements, but their design in multiple-input multiple-output (MIMO) systems has so far relied on complex iterative algorithms or suboptimal approximations. This work introduces a simple yet powerful approach: instead of directly maximizing the achievable rate, we maximize the absolute value of the determinant of the equivalent MIMO channel. We derive a closed-form symmetric unitary scattering matrix whose rank is exactly twice the channel's degrees of freedom ($2r$). Remarkably, this low-rank solution achieves the same determinant value as the optimal unitary BD-RIS. Using log-majorization theory, we prove that the rate loss relative to the optimal unitary BD-RIS vanishes at high signal-to-noise ratio (SNR) or when the number of BD-RIS elements becomes large. Moreover, the proposed solution can be perfectly implemented using a $q$-stem BD-RIS architecture with only $q=2r-1$ stems, requiring a minimum number of reconfigurable circuits. The resulting Max-Det solution is orders of magnitude faster to compute than existing iterative methods while achieving near-optimal rates in practical scenarios. This makes high-performance BD-RIS deployment feasible even with large surfaces and limited computational resources.

eess.SP↗
arXiv2026

Constrained Tensor Decomposition-Based Target Sensing for Sparse Non-Uniform Array-Enabled AFDM ISAC Systems

Sparse non-uniform array-enabled affine frequency division multiplexing (AFDM) is a promising candidate for integrated sensing and communication (ISAC), while its performance critically depends on accurate target parameter estimation. In this paper, we propose a constrained tensor decomposition-based sensing framework for delay, Doppler, and angle estimation. Specifically, a manifold-constrained alternating least squares algorithm is developed by exploiting the sparse array geometry structure, enabling robust factor matrix extraction and direct angle estimation. In addition, we analyze the uniqueness condition of the tensor decomposition. From the decomposed factor matrices, delays and Doppler shifts are coarsely estimated by pulse compression, and refined by an iterative one dimensional golden-section search.Moreover, the Cramér-Rao bound (CRB) is derived to characterize the fundamental performance limit of the considered estimation problem. Finally, simulation results validate the effectiveness of the proposed estimation algorithm.

eess.SP↗