Abstract
Increasing demand for massive device connectivity in underserved regions drives the development of advanced low Earth orbit (LEO) satellite communication systems. Beam-hopping LEO systems without connection establishment provide a promising solution for achieving both demand-aware resource allocation and low access latency. However, integrating beam-hopping with grant-free random access presents unique challenges due to sporadic and unpredictable device activity, fundamentally differing from scheduled systems with deterministic resource allocation. This paper investigates beam-hopping pattern design for grant-free random access systems to dynamically allocate satellite resources according to traffic demands across serving cells. We formulate a binary optimization problem that maximizes the minimum successful transmission probability across cells, which captures performance in systems with unpredictable device activity. To solve this problem, we propose novel beam-hopping design algorithms that alternately enhance the collision avoidance rate to mitigate intra-cell collisions and the decoding success probability to manage inter-cell interference within an alternating optimization framework. Specifically, the algorithms employ a bisection method to optimize illumination allocation for each cell based on demand, while using the alternating direction method of multipliers (ADMM) to optimize beam-hopping patterns for maximizing decoding success probability. Furthermore, we enhance the ADMM by replacing the strict binary constraint with two equivalent continuous-valued constraints. Simulation results demonstrate the superiority of the proposed algorithms compared to other beam-hopping methods and verify robustness in managing traffic demand imbalance.
Funding Information
  • Grant of Korea Health Industry Development Institute (KHIDI), funded by the Ministry of Health & Welfare, Republic of Korea (RS-2025-25454431)
  • National Research Foundation of Korea (NRF) funded by Korean government (RS-2024-00453301)

This publication has 33 references indexed in Scilit: