arXiv · 2606.22900
Radio Resource Allocation for Beam Hopping Scheduling in LEO Satellite Communications: A Spatio-Temporal Perspective
Abstract
Low Earth Orbit (LEO) satellite networks face critical challenges in radio resource allocation due to dynamic traffic demands and stringent interference constraints. Beam-hopping (BH) technology offers a promising solution by enabling dynamic beam resource allocation across spatial and temporal domains. In this paper, we propose a Tabu Search-based spatio-temporal BH resource allocation strategy for LEO satellite communication systems. Specifically, the BH scheduling problem is formulated to maximize user demand satisfaction under interference constraints. To solve this problem efficiently, the proposed Tabu Search framework integrates adaptive tabu tenure control, greedy-based initialization with interference-aware beam selection, and Simulated Annealing acceptance criteria. Extensive simulation results demonstrate that the proposed method consistently improves system throughput by 17.2\% and user satisfaction by 11.7\% compared with greedy-based BH strategies. These results indicate that the proposed approach provides a scalable and robust solution for dynamic resource allocation in interference-limited LEO satellite networks.
Explore related subjects
Keep this discovery
Hao Yuan, Lanyining Li, Jianghua Long, Xing Zhang. 2026-06-22. Radio Resource Allocation for Beam Hopping Scheduling in LEO Satellite Communications: A Spatio-Temporal Perspective. https://arxiv.org/abs/2606.22900
Cite the original work for its findings. Save a collection to share your selection of sources.