A renewal-theoretic framework derives persistent ergodic capacity for LEO mega-constellations under finite serving times and arbitrary handovers, with optimal handover decisions obtained via a fractional program solved by Dinkelbach's algorithm.
An analysis of Dinkelbach’s algorithm for 0-1 fractional programming problems,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Ergodic Capacity and Optimal Handover in Satellite Mega-Constellations under Finite Serving Times
A renewal-theoretic framework derives persistent ergodic capacity for LEO mega-constellations under finite serving times and arbitrary handovers, with optimal handover decisions obtained via a fractional program solved by Dinkelbach's algorithm.