Re-Planning Budgets under Admission Control in Grant-Free LEO Beam-Hopping Access

arXiv:2611.07592 · eess.SP, cs.IT, math.IT · Submitted 2026-11-05 · Read on arXiv

Listen

Radio episode about this paper

Transcript

Introduction to the show: ident: Electrical Engineering. The day in electrical engineering: signals, systems and the hardware that carries them.

Rosa: We're looking at the paper: "Re-Planning Budgets under Admission Control in Grant-Free LEO Beam-Hopping Access".

Dev: Here's the gist of the paper. Reordering low-Earth-orbit (LEO) beam-hopping visits can reduce grant-free update delivery even when each region receives the same service time The largest integer budget meeting a prescribed tolerance within the frame-permutation class is derived when every group is visited once per frame.

Rosa: System Model Description The system model involves a fixed codebook partitioning B beams into G disjoint groups of K co-active beams, illuminated one group at a time as in Fig.

Rosa: Each visit has L random-access slots of duration Ts and M orthogonal resources per slot.

Paper summary: Rosa: So to wrap up on "Re-Planning Budgets under Admission Control in Grant-Free LEO Beam-Hopping Access," the authors show that by optimizing admission control based on the revisit interval, you can find a budget that is better than what you get from just using a fixed admission probability. They found that this approach restores concavity in the delivery rate function under certain success conditions, which means the per-visit reward structure is more favorable.

Dev: And they derived an explicit expression for the worst-case delivery rate loss when you put a limit on how much every group can move between frames, and they showed that feasible alternating visit orders can reach this worst case while respecting all those displacement limits. They also confirmed that this budget extends to independent stationary renewal updates.

Taro: What this means practically is that we have a way to bound the performance loss based on how we structure the access control, not just how much the beams move randomly, which is a nice shift in focus for designing these networks.

Rosa: It points toward a design where the system proactively adjusts its admission strategy based on temporal context—how long it's been since the last visit—to maximize efficiency. But we have to remember that this guarantee only holds if things like homogeneous loading and one-visit expiry are happening in practice.

Dev: And the authors make it clear that while optimized revisit-conditioned admission is good for concavity, a fixed admission probability can still lead to irregular visits, so you have to choose your approach based on what kind of performance you need versus the complexity of your control system.

Taro: So we have a tool here that gives us a concrete way to calculate the performance loss under specific movement constraints in this LEO environment, but it's not a magic fix; it requires careful planning and testing to ensure those real-world conditions are met.

Conclusion: Rosa: So we’ve looked at how reordering those beam hops can help reduce delivery loss even when everyone gets the same service time, and now we’re wrapping up on this paper, "Re-Planning Budgets under Admission Control in Grant-Free LEO Beam-Hopping Access."

Dev: Yeah, the core idea is that you don't just keep a fixed probability for switching beams; you can use information about when the last visit was to set that probability dynamically.

Rosa: Exactly. They show that optimizing admission control based on those revisit intervals restores what we call reward concavity, which basically means the performance structure becomes much more favorable for the system.

Dev: And they derived a budget expression for the worst-case delivery loss when you put a limit on how much every group can change its position between frames.

Taro: So it’s not just about hoping for the best; they found that feasible alternating visit orders can actually hit that worst case while respecting all those movement limits for each beam group.

Rosa: It’s interesting because this new budget extends to independent stationary renewal updates, which is a pretty clean way to handle these long-term performance guarantees.

Dev: The implication here is that we can design access control methods that adapt to the actual traffic patterns instead of just guessing a static setting for how often we switch beams.

Taro: If you can get this kind of predictable loss bound, it means you have a much better safety case for how the system handles those unpredictable LEO traffic arrivals.

Joon-Young Park, Young-Chai Ko

Korea University

eess.SP, cs.IT, math.IT

Submitted: 2026-11-05

Updated: 2026-11-05

Comments: 6 pages, 5 figures, 1 table, submitted to IEEE ICC 2027

License: http://creativecommons.org/publicdomain/zero/1.0/

Importance score: 83/100

The gist: Reordering low-Earth-orbit (LEO) beam-hopping visits can reduce grant-free update delivery even when each region receives the same service time The largest integer budget meeting a prescribed…

Key concepts

Beam Illumination Pattern Design
This involves partitioning a fixed codebook of beams into disjoint groups. The system illuminates one group at a time during each visit. This structure is central to how the beam hopping and resource allocation are organized in the satellite network.
Admission Classes
The paper compares two ways to control access: static admission, which uses a fixed probability across all visits, and revisit-conditioned admission. The latter adapts the access probability based on the specific interval observed at a gate, aiming to optimize performance for that particular visit.
Reward Concavity
This mathematical property ensures that optimizing admission control leads to a well-behaved solution. Under sufficient conditions, optimizing for each interval restores this concavity, allowing the derived budget to be computed without needing the exact distribution of revisit intervals.

Terminology

Summary

Reordering low-Earth-orbit (LEO) beam-hopping visits can reduce grant-free update delivery even when each region receives the same service time The largest integer budget meeting a prescribed tolerance within the frame-permutation class is derived when every group is visited once per frame. p. 0

Where the paper says it

kr 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 deliveryrate loss tolerance when every group is visited once per frame.

System Model Description

The system model involves a fixed codebook partitioning B beams into G disjoint groups of K co-active beams, illuminated one group at a time as in Fig. 1. Each visit has L random-access slots of duration Ts and M orthogonal resources per slot. p. 1

Where the paper says it

Re-planning changes only their order. Each visit has L random-access slots of duration Ts and M orthogonal resources per slot.

The revisit interval Tn is determined by the position Jn ∈

(G + Jn − Jn−1) and the duration D = LTs + Tg. Device locations form independent Poisson point processes of intensity λ > 0 in beam footprints of area A, with mean population N¯ = λA per beam. p. 1

Where the paper says it

This converts a limit on position changes into a bound on revisit intervals. Latest-Update Traffic and Load-Domain Access Model Device locations form independent Poisson point processes of intensity λ > 0 in beam footprints of area A, with mean population N¯ = λA per beam.

Admission Control and Reward Concavity

The paper compares two admission classes: static admission, which keeps the same probability across visits, and revisit-conditioned admission, which uses the interval observed at the gate to set pn = p(Tn). Under sufficient conditions on transmission success, admission optimized for each interval restores concavity and yields a limit computable without the revisit-interval distribution. p. 0

Where the paper says it

With fixed admission, the per-visit reward can turn convex at long intervals, so irregular visits can outperform periodic service. Under sufficient conditions on transmission success, admission optimized for each interval restores concavity and yields a limit computable without the revisit-interval distribution.

Periodic service is then optimal at a fixed mean interval. p. 0
Where the paper says it

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.

Distribution-Free Budget Derivation

The authors derive an explicit expression for the exact worst-case delivery-rate loss under a limit on every group’s position change. Concavity places the worst case at the extreme intervals [13], and feasible alternating visit orders attain it while respecting all groups’ limits. p. 0

Where the paper says it

• We derive an explicit expression for the exact worst-case delivery-rate loss under a limit on every group’s position change. Concavity places the worst case at the extreme intervals [13], and feasible alternating visit orders attain it while respecting all groups’ limits.

The resulting budget extends to independent stationary renewal updates. p. 0
Where the paper says it

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.

Numerical Results and Performance

Numerical evaluations with specific parameters show that the 1% budgets at M = 40 retain over 90% of the cost reduction achieved by unrestricted reordering. The certified budget excludes certain constructions, such as alternating construction of Theorem 2, which yields a tagged-beam loss while other groups remain periodic. p. 5

Where the paper says it

8% tagged-beam loss while the other 38 groups remain periodic. The certified budget excludes this construction.

Conclusion

Optimized revisitconditioned admission provides the required reward concavity, whereas a fixed admission probability can favor irregular visits. Conservative caps bound calibration loss, and the budget extends to independent stationary renewal updates. p. 5

Where the paper says it

In the reference collision setting with M = 40 and independent priorities, a 1% loss tolerance retains over 90% of the cost reduction achieved by unrestricted reordering. Conservative caps bound calibration loss, and the budget extends to independent stationary renewal updates.

The guarantee is spatially averaged and requires exogenous re-planning, homogeneous loading, and one-visit expiry. p. 5
Where the paper says it

Conservative caps bound calibration loss, and the budget extends to independent stationary renewal updates. The guarantee is spatially averaged and requires exogenous re-planning, homogeneous loading, and one-visit expiry.

REFERENCES

arXiv:2611.07592v1 5 Nov 2026

L. Lei, E. Lagunas, Y. p. 5

Where the paper says it

REFERENCES [1] L. Lagunas, Y.

Yuan, M. G. Kibria, S. Chatzinotas, and B. p. 5
Where the paper says it

Lagunas, Y. Chatzinotas, and B.

Ottersten, “Beam illumination pattern design in satellite networks: Learning and optimization for efficient beam hopping,” IEEE Access, vol 8 pp 136655–136667 2020

Z. Lin, Z. Ni, L. Kuang, C. Jiang, and Z. p. 5

Where the paper says it

136655–136667, 2020. Jiang, and Z.

Huang, “Multi-satellite beam hopping based on load balancing and interference avoidance for NGSO satellite communication systems,” IEEE Trans Commun vol 71 no 1 pp 282–295 Jan 2023

J. Zhu, Y. Sun, and M. p. 5

Where the paper says it

282–295, Jan. Sun, and M.

p. 5
Where the paper says it

282–295, Jan. Sun, and M.

Peng, “Beam management in low Earth orbit satellite networks with random traffic arrival and time-varying topology,” IEEE Trans Veh Technol vol 73 no 9 pp 13352–13367 Sep 2024

Y. Feng, Y. Sun, and M. Peng, “Performance analysis in satellite communication with beam hopping using discrete-time queueing theory,” IEEE Internet Things J vol 11 no 7 pp 11679–11692 Apr 2024

H. Jia, C. Jiang, L. Kuang, and J. p. 5

Where the paper says it

11679–11692, Apr. Kuang, and J.

Lu, “Adaptive access control and resource allocation for random access in NGSO satellite networks,” IEEE Trans Netw Sci Eng vol 9 no 4 pp 2721–2733 Jul. p. 5
Where the paper says it

Lu, “Adaptive access control and resource allocation for random access in NGSO satellite networks,” IEEE Trans. 2721–2733, Jul.

/Aug 2022

J.-H. Lee, H. Seo, J. Park, M. Bennis, and Y. p. 5

Where the paper says it

2721–2733, Jul. Bennis, and Y.

-C. Ko, “Learning emergent random access protocol for LEO satellite networks,” IEEE Trans Wireless Commun vol 22 no 1 pp 257–269 Jan 2023

T. Yang, J. Jiao, S. Wu, R. Lu, and Q. Zhang, “Grant free age-optimal random access protocol for satellite-based Internet of Things,” IEEE Trans Commun vol 70 no 6 pp 3947–3961 Jun 2022

W. Wei et al., “Random access control and beam management scheme for the 5G NR based beam hopping LEO satellite communication systems,” Mobile Netw Appl vol 28 no 4 pp 1531–1542 2023

D. Wang et al. p. 5

Where the paper says it

1531–1542, 2023. Wang et al.

, “Beam hopping random access scheme for the next generation LEO satellite Internet,” in Proc IEEE Int Conf Commun Technol 2024 pp 1112–1116

S. Jeon, S. Kim, G. Im, and Y.-S. Jeon, “Beam-hopping pattern design for grant-free random access in LEO satellite communications,” IEEE Trans Wireless Commun vol 25 pp 8246–8259 2026

B. Hajek, “Extremal splittings of point processes,” Math Oper Res vol 10 no 4 pp 543–556 Nov 1985

E. Altman, B. Gaujal, and A. p. 5

Where the paper says it

543–556, Nov. Gaujal, and A.

Hordijk, Discrete-Event Control of Stochastic Networks Multimodularity and Regularity Berlin Germany Springer 2003

A. Madansky, “Bounds on the expectation of a convex function of a multivariate random variable,” Ann Math Statist vol 30 no 3 pp 743–746 Sep 1959

F. Baccelli, B. p. 5

Where the paper says it

743–746, Sep. Baccelli, B.

Błaszczyszyn, and P. p. 5
Where the paper says it

Baccelli, B. Błaszczyszyn, and P.

M ¨uhlethaler, “An Aloha protocol for multihop mobile wireless networks,” IEEE Trans Inf Theory vol 52 no 2 pp 421–436 Feb 2006

M. Shaked and J. p. 5

Where the paper says it

421–436, Feb. Shaked and J.

G. Shanthikumar, Stochastic Orders New York NY USA Springer 2007

S. M. Ross, Stochastic Processes 2nd ed New York NY USA Wiley 1996

3GPP, “Study on New Radio NR to support non-terrestrial networks,” 3GPP TR 38.811 ver 15.4.

Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.

Improvements for AI systems

  1. Re-planning budgets under admission control in grant-free LEO beam-hopping access allows for deriving a largest limit on inter-frame position changes that meets a prescribed deliveryrate loss tolerance when every group is visited once per frame. This enables the system to guarantee a protected beam’s spatially averaged long-run delivery rate relative to optimized periodic service under exogenous re-planning.

  2. The improved AI system can optimize admission control for each revisit interval, which the paper states makes the per-visit reward concave under sufficient conditions on transmission success. This optimization yields a limit computable without knowing the revisit-interval distribution, allowing for deterministic budget setting.

  3. The system can utilize periodic service as optimal at a fixed mean interval, which is determined by the frame permutation class and provides an upper bound on loss. The paper states Periodic service is then optimal at a fixed mean interval.

  4. The AI can calculate the exact worst-case delivery-rate loss under a limit on every group’s position change using feasible alternating visit orders that respect every group’s displacement limit. This provides a specific budget to minimize the delivery rate loss to an acceptable tolerance, as described by the largest integer budget meeting a prescribed tolerance within the frame-permutation class.

  5. The system can extend guarantees to independent stationary renewal updates, which are modeled by independent stationary renewal updates, allowing the derived budgets to apply to scenarios where eligibility is not independent across visits.

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 papers