Beam-Hopping Pattern Design for Grant-Free Random Access in LEO Satellite Communications
Seunghyeon Jeon, Seonjung Kim, Gyeongrae Im, and Yo-Seb Jeon

TL;DR
This paper presents novel beam-hopping pattern design algorithms for LEO satellite systems that dynamically allocate resources for grant-free random access, improving success probability and handling traffic demand imbalance.
Contribution
It introduces a binary optimization framework and innovative algorithms using bisection and ADMM to optimize beam-hopping patterns for LEO satellite communications.
Findings
Algorithms outperform existing methods in simulations.
Robustness demonstrated under traffic demand imbalance.
Enhanced decoding success probability achieved.
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. This paper investigates beam-hopping pattern design for the grant-free random access systems to dynamically allocate satellite resources according to traffic demands across serving cells. We formulate a binary optimization problem that aims to maximize the minimum successful transmission probability across cells, given limited satellite beam generation capacity. To solve this problem, we propose novel beam-hopping design algorithms that alternately enhance the collision avoidance rate and decoding success probability within an alternating optimization framework.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
