pith. sign in

arxiv: 2512.02449 · v2 · pith:PIRSZ7JHnew · submitted 2025-12-02 · 💻 cs.IT · math.IT

Ergodic Capacity and Optimal Handover in Satellite Mega-Constellations under Finite Serving Times

Brendon McBain , Yi Hong , Emanuele Viterbo This is my paper

Pith reviewed 2026-05-17 03:01 UTC · model grok-4.3

classification 💻 cs.IT math.IT
keywords ergodic capacitysatellite mega-constellationshandover strategyshadowed-Rician fadingrenewal theoryLEO satellitespersistent capacitynon-homogeneous binomial point process
0
0 comments X

The pith

A renewal-theoretic model derives ergodic capacity for LEO mega-constellations with finite serving times and optimal uncoordinated handovers.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper establishes a model for satellite links that accounts for realistic finite serving times by drawing visible satellites from a non-homogeneous binomial point process and propagating them with circular orbit dynamics. This produces independent serving periods for uncoordinated handovers, allowing a renewal-theoretic calculation of persistent ergodic capacity under shadowed-Rician fading. The capacity is bounded in closed form and connected to earlier non-persistent results. Optimal handover is cast as a fractional optimization problem solved by a Dinkelbach variant. Simulations indicate that maximizing serving capacity yields a close approximation to the optimum and excels in realistic SGP4 orbit predictions.

Core claim

By introducing a semi-stochastic channel with persistence, where visible satellites are selected from an NBPP at each handover instant and then propagated forward under circular orbit assumptions, the resulting serving periods become independent when handovers are uncoordinated. This independence permits a renewal reward analysis of the long-run ergodic capacity, which is shown to admit closed-form upper and lower bounds and to relate directly to the non-persistent capacity derived in prior work. The optimal handover policy is obtained by solving a non-linear fractional program whose solution is computed explicitly via a Dinkelbach-type algorithm; numerical results further establish that the

What carries the argument

The semi-stochastic satellite channel with persistence, which draws visible satellites from a non-homogeneous binomial point process at handover epochs and propagates the chosen satellite via circular orbit dynamics to produce independent serving intervals for renewal-theoretic capacity analysis.

If this is right

  • The persistent capacity admits closed-form bounds that enable efficient numerical evaluation without full stochastic simulation.
  • Optimal handover decisions can be computed explicitly by applying a variant of Dinkelbach's algorithm to the fractional program.
  • A simpler strategy that always selects the satellite maximizing serving capacity closely approximates the optimal policy.
  • This simpler strategy achieves the best performance when evaluated under SGP4-based orbit prediction in mega-constellation simulations.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Extending the independence assumption to coordinated handovers could quantify capacity gains from correlated serving periods.
  • The bounds might be tested under non-circular orbits or different fading models to check sensitivity of the renewal derivation.
  • Deploying the capacity-maximization rule with mobile users could reveal additional performance limits not captured in the static case.

Load-bearing premise

Visible satellites are drawn from a non-homogeneous binomial point process at each handover and the selected satellite is propagated using circular orbit dynamics, which produces independent serving periods when handover decisions are uncoordinated.

What would settle it

A simulation or measurement showing that serving periods remain correlated under uncoordinated handovers in real LEO orbits, or that the serving-capacity-maximizing strategy deviates substantially from the Dinkelbach-computed optimum in SGP4-driven mega-constellation runs.

Figures

Figures reproduced from arXiv: 2512.02449 by Brendon McBain, Emanuele Viterbo, Yi Hong.

Figure 1
Figure 1. Figure 1: A satellite on an orbit towards the visibility cap of a ground user. [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Heat maps of the serving capacity C(θ, ϕ, 1)/N(θ, ϕ, 1) for ascending satellites. Light grey is the highest serving capacity, dark green is the lowest serving capacity, and blue (and white) is zero capacity (outside the visibility cap). The black dot is the location of the ground user, the triangle marker is the satellite location that achieves the capacity upper bound Cpers, the thin black lines are examp… view at source ↗
Figure 3
Figure 3. Figure 3: Persistent capacity with cap serving times for a range of transmit SNRs. [PITH_FULL_IMAGE:figures/full_fig_p011_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Persistent capacity for a range of fixed serving times and a fixed transmit SNR [PITH_FULL_IMAGE:figures/full_fig_p012_4.png] view at source ↗
read the original abstract

Existing analyses of ergodic capacity in satellite mega-constellations often rely on restrictive serving time assumptions or become intractable under realistic handover strategies. This paper develops a framework for characterising the ergodic capacity of low-Earth-orbit (LEO) mega-constellation links under arbitrary handover strategies and serving times. The user--satellite link is modelled as shadowed-Rician fading, and a semi-stochastic satellite channel with persistence is introduced in which visible satellites are drawn from a non-homogeneous binomial point process (NBPP) at each handover and the selected satellite is then propagated using circular orbit dynamics. Under uncoordinated handover decisions, this yields independent serving periods and enables a renewal-theoretic derivation of persistent capacity. This capacity is related to the non-persistent capacity from prior work, and closed-form bounds are provided for efficient evaluation. Optimal handover is then formulated as a non-linear fractional program, yielding an explicit decision rule via a variant of Dinkelbach's algorithm. The results show that a simpler strategy that maximises serving capacity closely approximates the optimum while performing best under SGP4-based orbit prediction and mega-constellation simulation.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The paper develops a framework for characterizing the ergodic capacity of LEO mega-constellation links under arbitrary handover strategies and finite serving times. It models the user-satellite link with shadowed-Rician fading and introduces a semi-stochastic satellite channel with persistence, where visible satellites are drawn from a non-homogeneous binomial point process (NBPP) at each handover and propagated using circular orbit dynamics. Under uncoordinated decisions, this leads to independent serving periods, allowing a renewal-theoretic derivation of persistent ergodic capacity, which is related to non-persistent capacity with closed-form bounds. Optimal handover is formulated as a non-linear fractional program solved via a variant of Dinkelbach's algorithm. Simulations using SGP4 show that a simpler strategy maximizing serving capacity approximates the optimum.

Significance. If the derivations hold and the independence assumption is valid, this work provides a tractable analytical tool for capacity analysis and handover optimization in satellite mega-constellations, which is significant for designing efficient communication strategies in emerging LEO networks. The use of renewal theory and fractional programming offers closed-form insights, and the simulation validation with realistic orbit prediction strengthens the practical relevance. The relation to prior non-persistent capacity work is a useful bridge.

major comments (2)
  1. [Model and Renewal Derivation] The central derivation relies on the claim that uncoordinated per-handover NBPP draws produce independent serving periods (see abstract and model section). However, because satellites follow deterministic orbital dynamics, successive visibility windows share underlying geometry even under uncoordinated decisions; this dependence risks invalidating the renewal-reward theorem application that yields the closed-form relation between persistent and non-persistent capacity. A concrete test (e.g., correlation of serving intervals in the SGP4 traces) is needed to confirm the assumption holds.
  2. [Capacity Derivation and Optimization] The abstract asserts closed-form bounds and an explicit decision rule, yet the provided text does not display the full steps linking the NBPP model to the bounds or the fractional-program solution. Without these derivations or verification that the independence assumption survives in the mega-constellation simulation, it is impossible to confirm that the math supports the stated claims.
minor comments (2)
  1. [Simulation Results] Add error bars or multiple-run statistics to the SGP4 simulation results to demonstrate robustness of the strategy comparisons.
  2. [Channel Model] Clarify the precise definition and parameters of the non-homogeneous binomial point process when it is first introduced.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the constructive and detailed comments, which help improve the clarity and rigor of our work. We address each major comment below and outline the revisions we will make.

read point-by-point responses

  1. Referee: [Model and Renewal Derivation] The central derivation relies on the claim that uncoordinated per-handover NBPP draws produce independent serving periods (see abstract and model section). However, because satellites follow deterministic orbital dynamics, successive visibility windows share underlying geometry even under uncoordinated decisions; this dependence risks invalidating the renewal-reward theorem application that yields the closed-form relation between persistent and non-persistent capacity. A concrete test (e.g., correlation of serving intervals in the SGP4 traces) is needed to confirm the assumption holds.

    Authors: We appreciate the referee's concern regarding potential dependence induced by orbital geometry. In the model, visible satellites are redrawn independently from the NBPP at each uncoordinated handover epoch; the random selection of the serving satellite (independent of prior state) ensures that the resulting serving intervals are i.i.d. for the purpose of the renewal-reward theorem, even though individual visibility windows may overlap geometrically. The circular-orbit propagation is deterministic within each interval but does not carry over between independent draws. To empirically validate this, the revised manuscript will include a correlation analysis of serving-interval lengths extracted from the SGP4 traces, reporting autocorrelation coefficients that remain negligible under the uncoordinated policy. revision: yes

  2. Referee: [Capacity Derivation and Optimization] The abstract asserts closed-form bounds and an explicit decision rule, yet the provided text does not display the full steps linking the NBPP model to the bounds or the fractional-program solution. Without these derivations or verification that the independence assumption survives in the mega-constellation simulation, it is impossible to confirm that the math supports the stated claims.

    Authors: The relation between persistent and non-persistent capacity, including the closed-form bounds, is derived in Section IV by applying the renewal-reward theorem to the independent serving periods obtained from the NBPP model. The optimal handover policy is formulated as a nonlinear fractional program in Section V and solved via a Dinkelbach-type algorithm, yielding the explicit decision rule. We acknowledge that additional intermediate algebraic steps would improve readability. The revised version will expand these derivations with explicit proof outlines and will add a dedicated verification subsection that reports independence statistics (e.g., interval-length histograms and correlation metrics) from the mega-constellation SGP4 simulations. revision: yes

Circularity Check

0 steps flagged

Derivation chain is self-contained via explicit modeling assumptions and renewal theory

full rationale

The paper explicitly constructs a semi-stochastic channel model by drawing visible satellites from an NBPP at each handover instant, selecting one satellite, and propagating it forward under circular-orbit dynamics to obtain serving intervals. It then states that uncoordinated decisions produce independent serving periods, which directly licenses application of the renewal reward theorem to relate persistent ergodic capacity to the non-persistent capacity expression from prior work. Closed-form bounds and the subsequent fractional-program formulation of optimal handover follow from this relation and standard optimization techniques. No equation is shown to equal its own input by construction, no fitted parameter is relabeled as a prediction, and the SGP4-based simulations serve only for comparative validation rather than for calibrating the capacity formula itself. The derivation therefore rests on stated modeling choices and external mathematical results rather than on self-referential reduction.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The framework rests on standard stochastic geometry and renewal theory plus domain-specific assumptions about satellite visibility and orbit dynamics; no new physical entities are postulated.

axioms (2)
  • domain assumption Visible satellites are drawn from a non-homogeneous binomial point process at each handover epoch.
    Stated in the abstract as the basis for the semi-stochastic channel model.
  • domain assumption Serving periods are independent under uncoordinated handover decisions.
    Enables the renewal-theoretic derivation of persistent capacity.

pith-pipeline@v0.9.0 · 5496 in / 1292 out tokens · 31311 ms · 2026-05-17T03:01:52.492643+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

25 extracted references · 25 canonical work pages

  1. [1]

    Research on user access technologies in satellite communication networks,

    W. Liu, N. Xiao, B. Liu, and Y . Zhang, “Research on user access technologies in satellite communication networks,” in4th International Conference on Electronic Information Engineering and Computer Com- munication (EIECC), 2024, pp. 235–241

    work page 2024

  2. [2]

    Handover manage- ment in low Earth orbit (LEO) satellite networks,

    I. F. Akyildiz, M. D. Bender, and H. Uzunalioglu, “Handover manage- ment in low Earth orbit (LEO) satellite networks,”Mobile Networks and Applications, vol. 4, no. 4, pp. 301–310, December 1999

    work page 1999

  3. [3]

    Handover technique in LEO satellite networks: A review,

    Z. Liu, Z. Yang, G. Pan, H. Zhang, G. Luo, and H. Yang, “Handover technique in LEO satellite networks: A review,” in13th International Conference on Communications, Circuits and Systems (ICCCAS), 2024, pp. 364–369

    work page 2024

  4. [4]

    Handover schemes in satellite networks: state-of-the-art and future research directions,

    P. K. Chowdhury, M. Atiquzzaman, and W. Ivancic, “Handover schemes in satellite networks: state-of-the-art and future research directions,” IEEE Communications Surveys & Tutorials, vol. 8, no. 4, pp. 2–14, 2006

    work page 2006

  5. [5]

    A technical compar- ison of three low Earth orbit satellite constellation systems to provide global broadband,

    I. del Portillo, B. G. Cameron, and E. F. Crawley, “A technical compar- ison of three low Earth orbit satellite constellation systems to provide global broadband,”Acta Astronautica, vol. 159, pp. 123–135, 2019

    work page 2019

  6. [6]

    Downlink coverage and rate analysis of low Earth orbit satellite constellations using stochastic geometry,

    N. Okati, T. Riihonen, D. Korpi, I. Angervuori, and R. Wichman, “Downlink coverage and rate analysis of low Earth orbit satellite constellations using stochastic geometry,”IEEE Transactions on Com- munications, vol. 68, no. 8, pp. 5120–5134, 2020

    work page 2020

  7. [7]

    Nonhomogeneous stochastic geometry anal- ysis of massive LEO communication constellations,

    N. Okati and T. Riihonen, “Nonhomogeneous stochastic geometry anal- ysis of massive LEO communication constellations,”IEEE Transactions on Communications, vol. 70, no. 3, pp. 1848–1860, 2022

    work page 2022

  8. [8]

    Coherent capacity of satellite mega-constellations with persistence,

    B. McBain, Y . Hong, and E. Viterbo, “Coherent capacity of satellite mega-constellations with persistence,”IEEE International Conference on Communications (ICC), June, 2025

    work page 2025

  9. [9]

    Handover strategies for emerging LEO, MEO, and HEO satellite networks,

    A. M. V oicu, A. Bhattacharya, and M. Petrova, “Handover strategies for emerging LEO, MEO, and HEO satellite networks,”IEEE Access, vol. 12, pp. 31 523–31 537, 2024

    work page 2024

  10. [10]

    Satellite handover techniques for LEO networks,

    E. Papapetrou, S. Karapantazis, G. Dimitriadis, and F.-N. Pavlidou, “Satellite handover techniques for LEO networks,” International Journal of Satellite Communications and Networking, vol. 22, no. 2, pp. 231–245, 2004. [Online]. Available: https://onlinelibrary.wiley.com/doi/abs/10.1002/sat.783

    work page doi:10.1002/sat.783 2004

  11. [11]

    A graph-based satellite handover framework for LEO satellite communication networks,

    Z. Wu, F. Jin, J. Luo, Y . Fu, J. Shan, and G. Hu, “A graph-based satellite handover framework for LEO satellite communication networks,”IEEE Communications Letters, vol. 20, no. 8, pp. 1547–1550, 2016

    work page 2016

  12. [12]

    Coverage and rate analysis of mega- constellations under generalized serving satellite selection,

    N. Okati and T. Riihonen, “Coverage and rate analysis of mega- constellations under generalized serving satellite selection,” inIEEE Wireless Communications and Networking Conference (WCNC), 2022, pp. 2214–2219

    work page 2022

  13. [13]

    On user association in large-scale heterogeneous LEO satellite network,

    Y . Guo, C. Skouroumounis, S. Chatzinotas, and I. Krikidis, “On user association in large-scale heterogeneous LEO satellite network,”IEEE Transactions on Aerospace and Electronic Systems, vol. 60, pp. 5994– 6010, 2024

    work page 2024

  14. [14]

    A reliable handover strategy with second satellite selection in LEO satellite networks,

    D. Kim and J. P. Choi, “A reliable handover strategy with second satellite selection in LEO satellite networks,” in2023 IEEE Globecom Workshops, 2023, pp. 293–298

    work page 2023

  15. [15]

    Handover scheme in LEO satellite networks based on QoE for streaming media services,

    H. Feng and L. Zhu, “Handover scheme in LEO satellite networks based on QoE for streaming media services,”Sensors, vol. 25, no. 7,

    work page

  16. [16]

    Available: https://www.mdpi.com/1424-8220/25/7/2165

    [Online]. Available: https://www.mdpi.com/1424-8220/25/7/2165

    work page

  17. [17]

    Stochastic channel models for satellite mega-constellations,

    B. Mcbain, Y . Hong, and E. Viterbo, “Stochastic channel models for satellite mega-constellations,”IEEE Transactions on Communications, pp. 1–1, 2025

    work page 2025

  18. [18]

    Stochastic analysis of satellite broadband by mega-constellations with inclined LEOs,

    N. Okati and T. Riihonen, “Stochastic analysis of satellite broadband by mega-constellations with inclined LEOs,” inIEEE 31st Annual International Symposium on Personal, Indoor and Mobile Radio Com- munications (PIMRC), 2020, pp. 1–6

    work page 2020

  19. [19]

    A new simple model for land mobile satellite channels: first- and second-order statistics,

    A. Abdi, W. Lau, M.-S. Alouini, and M. Kaveh, “A new simple model for land mobile satellite channels: first- and second-order statistics,”IEEE Transactions on Wireless Communications, vol. 2, no. 3, pp. 519–528, 2003

    work page 2003

  20. [20]

    Channel capacity over generalized fading channels: A novel MGF-based approach for perfor- mance analysis and design of wireless communication systems,

    M. Di Renzo, F. Graziosi, and F. Santucci, “Channel capacity over generalized fading channels: A novel MGF-based approach for perfor- mance analysis and design of wireless communication systems,”IEEE Transactions on Vehicular Technology, vol. 59, no. 1, pp. 127–149, 2010

    work page 2010

  21. [21]

    Fading channels: Information- theoretic and communication aspects,

    E. Biglieri, J. G. Proakis, and S. Shamai, “Fading channels: Information- theoretic and communication aspects,”IEEE Trans. Inf. Theory, vol. 44, pp. 2619–2692, 1998

    work page 1998

  22. [22]

    T. M. Cover and J. A. Thomas,Elements of Information Theory, 2005

    work page 2005

  23. [23]

    An analysis of Dinkelbach’s algorithm for 0-1 fractional programming problems,

    T. Matsui, Y . Saruwatari, and Maiko, “An analysis of Dinkelbach’s algorithm for 0-1 fractional programming problems,” 1992

    work page 1992

  24. [24]

    On nonlinear fractional programming,

    W. Dinkelbach, “On nonlinear fractional programming,”Management Science, vol. 13, pp. 492–498, 1967

    work page 1967

  25. [25]

    Low-latency live video streaming over a low-Earth-orbit satellite network with DASH,

    J. Zhao and J. Pan, “Low-latency live video streaming over a low-Earth-orbit satellite network with DASH,” ser. MMSys ’24. New York, NY , USA: Association for Computing Machinery, 2024, p. 109–120. [Online]. Available: https://doi.org/10.1145/3625468.3647616

    work page doi:10.1145/3625468.3647616 2024