Beam-Hopping Pattern Design for Grant-Free Random Access in LEO Satellite Communications
- 4 December 2025
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 25 (15361276) , 8246-8259
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.Keywords
All Related Versions
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:
- Grant-Free Massive Access for LEO-satellite based 6G IoT networks2022
- Evolution of Non-Terrestrial Networks From 5G to 6G: A SurveyIEEE Communications Surveys & Tutorials, 2022
- Beam Hopping for LEO Satellite:Challenges and Opportunities2022
- Help from space: grant-free massive access for satellite-based IoT in the 6G eraDigital Communications and Networks, 2022
- Satellite Communications in the New Space Era: A Survey and Future ChallengesIEEE Communications Surveys & Tutorials, 2020
- The unconstrained binary quadratic programming problem: a surveyJournal of Combinatorial Optimization, 2014
- Beam hopping in multi-beam broadband satellite systems: System simulation and performance comparison with non-hopped systems2010
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programsMathematical Programming, 2005
- Semidefinite Programming Relaxations for the Quadratic Assignment ProblemJournal of Combinatorial Optimization, 1998
- Solution of the matrix equation AX−XB=CComputing, 1986