Beam-Hopping Pattern Design for Grant-Free Random Access in LEO Satellite Communications
IEEE Transactions on Wireless Communications · 2026 · 25 · 8246-8259
DOI: 10.1109/twc.2025.3636684 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Transactions on Wireless Communications, 2026. Verfasst von Seunghyeon Jeon und 3 weiteren Autor:innen. Die Arbeit wurde bisher 9-mal zitiert (Crossref) und nennt 39 Literaturangaben. Gefördert von: Grant of Korea Health Industry Development Institute (KHIDI), funded by the Ministry of Health & Welfare, Republic of Korea, National Research Foundation of Korea (NRF) funded by Korean Government.
Abstract (Originalsprache)
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.
Förderung
- Grant of Korea Health Industry Development Institute (KHIDI), funded by the Ministry of Health & Welfare, Republic of Korea
- National Research Foundation of Korea (NRF) funded by Korean Government
Zitieren
APA
Jeon, S., Kim, S., Im, G., & Jeon, Y. (2026). Beam-Hopping Pattern Design for Grant-Free Random Access in LEO Satellite Communications. IEEE Transactions on Wireless Communications, 25, 8246-8259. https://doi.org/10.1109/twc.2025.3636684
Vancouver
Jeon S, Kim S, Im G, Jeon Y. Beam-Hopping Pattern Design for Grant-Free Random Access in LEO Satellite Communications. IEEE Transactions on Wireless Communications. 2026;25:8246-8259. doi:10.1109/twc.2025.3636684
BibTeX
@article{Jeon2026,
author = {Jeon, Seunghyeon and Kim, Seonjung and Im, Gyeongrae and Jeon, Yo-Seb},
title = {Beam-Hopping Pattern Design for Grant-Free Random Access in LEO Satellite Communications},
journal = {IEEE Transactions on Wireless Communications},
year = {2026},
volume = {25},
pages = {8246--8259},
doi = {10.1109/twc.2025.3636684}
}
EUVIMED