Re-Planning Budgets under Admission Control in Grant-Free LEO Beam-Hopping Access
Abstract
Reordering low-Earth-orbit (LEO) beam-hopping visits can reduce grant-free update delivery even when each region receives the same service time. We derive the largest limit on inter-frame position changes that meets a prescribed delivery-rate loss tolerance when every group is visited once per frame. The guarantee concerns a protected beam's spatially averaged long-run delivery rate relative to optimized periodic service under exogenous re-planning. Fixed admission can favor irregular visits, whereas admission optimized for each revisit interval makes the per-visit reward concave under sufficient conditions on transmission success. Periodic service is then optimal at a fixed mean interval. The shortest and longest allowed intervals determine the exact worst-case loss, attained by feasible alternating visit orders that respect every group's displacement limit. The resulting budget requires no estimate of the revisit-interval distribution and extends to independent stationary renewal updates. In a collision example with 40 groups and 40 resources per slot, increasing the loss tolerance from zero to 1% raises the limit from 17 to 24 positions. With independent priorities, the latter retains over 90% of the priority-weighted waiting-cost reduction achieved by unrestricted ordering. Received-power simulations under Rayleigh fading support the predicted loss.
Related
- Adaptive Beam Hopping and Power Control for Dual-Layer Over-the-Air Online Federated Learning in LEO Satellite Networks
- Exponential Backoff: Meta-Stability and Implicit Admission Control
- Trajectory-Planning Attitude Control System for Satellites with Magnetic Attitude Control and One Reaction Wheel
- Notes on Generative Modeling for Feedback Control and Planning
- Planning to Learn: Real-Time Robust Adaptive Control on the GPU with Guaranteed Future Learning
BibTeX
@misc{park2026replanning,
title = {{Re-Planning Budgets under Admission Control in Grant-Free LEO Beam-Hopping Access}},
author = {Joon-Young Park and Young-Chai Ko},
howpublished = {arXiv},
year = {2026},
month = nov,
doi = {10.48550/arxiv.2611.07592},
eprint = {2611.07592},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2611.07592},
note = {CC0},
}
RIS
TY - UNPB
TI - Re-Planning Budgets under Admission Control in Grant-Free LEO Beam-Hopping Access
AU - Joon-Young Park
AU - Young-Chai Ko
PY - 2026
DA - 2026/11/05
PB - arXiv
DO - 10.48550/arxiv.2611.07592
UR - https://arxiv.org/abs/2611.07592
AB - Reordering low-Earth-orbit (LEO) beam-hopping visits can reduce grant-free update delivery even when each region receives the same service time. We derive the largest limit on inter-frame position changes that meets a prescribed delivery-rate loss tolerance when every group is visited once per frame. The guarantee concerns a protected beam's spatially averaged long-run delivery rate relative to optimized periodic service under exogenous re-planning. Fixed admission can favor irregular visits, whereas admission optimized for each revisit interval makes the per-visit reward concave under sufficient conditions on transmission success. Periodic service is then optimal at a fixed mean interval. The shortest and longest allowed intervals determine the exact worst-case loss, attained by feasible alternating visit orders that respect every group's displacement limit. The resulting budget requires no estimate of the revisit-interval distribution and extends to independent stationary renewal updates. In a collision example with 40 groups and 40 resources per slot, increasing the loss tolerance from zero to 1% raises the limit from 17 to 24 positions. With independent priorities, the latter retains over 90% of the priority-weighted waiting-cost reduction achieved by unrestricted ordering. Received-power simulations under Rayleigh fading support the predicted loss.
ER -