Dynamic Scheduling Algorithm for Beam Hopping Switching in Low Earth Orbit Constellations Aimed at Non-Uniform Traffic Demands

In recent years, the development of Beam-Hopping (BH) technology has provided new solutions for the flexible configuration and efficient utilization of satellite resources. This technology is implemented through time-slicing, allowing only a subset of beams to be activated as needed, thereby enhancing the flexibility of on-board resource allocation. However, current research on beam-hopping resource allocation for Low-Earth Orbit (LEO) satellites often focuses on optimizing single-resource allocation schemes, which makes it difficult to address the challenges posed by non-uniform traffic demands across ground regions. To address these limitations, this paper proposes the Weighted Degree of Saturation (DSatur) Algorithm for scheduling satellite beams, which explicitly considers the variability and uneven distribution of service demands. Simulation results demonstrate that the proposed algorithm effectively integrates ground cells satellite access strategies, satellite load balancing, cells service distribution, terrestrial-satellite link status, and service priorities to achieve resource allocation. By addressing non-uniform traffic demands, the proposed algorithm improves system throughput by approximately 29.12% compared to the Round-robin algorithm and by 5.37% compared to the Traffic-prioritized algorithm, providing a significant advantage in managing uneven service distributions.