Metraipolis › archive › dc_2f282d2dfc36

Re-Planning Budgets under Admission Control in Grant-Free LEO Beam-Hopping Access — arXiv:2611.07592

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.07592
License (as archived)
CC0-1.0
Archived
2026-11-06T14:53:08.353Z
SHA-256 of the archived text
b62accd0141037d993f6045ab6877ebb0c1609aa70e33c305b2630a78d87b84b
Stable URL of this page
https://metraipolis.com/documento/dc_2f282d2dfc36

How to cite

Re-Planning Budgets under Admission Control in Grant-Free LEO Beam-Hopping Access — arXiv:2611.07592 — arXiv (en), https://arxiv.org/abs/2611.07592 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2f282d2dfc36 (Metraipolis archive dc_2f282d2dfc36, sha256 b62accd0141037d993f6045ab6877ebb0c1609aa70e33c305b2630a78d87b84b)
BibTeX
@misc{dc2f282d2dfc36,
  title = {Re-Planning Budgets under Admission Control in Grant-Free LEO Beam-Hopping Access — arXiv:2611.07592},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.07592},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2f282d2dfc36; sha256 b62accd0141037d993f6045ab6877ebb0c1609aa70e33c305b2630a78d87b84b},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.07592. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.IT, nuovi lavori del giorno).
Categorie arXiv: Signal Processing (eess.SP) ; Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2611.07592 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-06T14:24:46.062Z dalla pagina https://arxiv.org/list/math.IT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).