卫星 mega-星座中有限服务时间下的 ergodic 容量与最优切换
Ergodic Capacity and Optimal Handover in Satellite Mega-Constellations under Finite Serving Times
AI总结：
本文研究了在任意切换策略和有限服务时间下，低地球轨道 mega-星座链路的 ergodic 容量特性，提出了基于半随机卫星信道的模型，并通过非线性分数规划方法得出了最优切换策略。
摘要：
现有对卫星 mega-星座 ergodic 容量的分析通常依赖于限制性的服务时间假设或在现实切换策略下变得难以处理。本文开发了一个框架，用于表征在任意切换策略和服务时间下低地球轨道 (LEO) mega-星座链路的 ergodic 容量。用户-卫星链路被建模为阴影-Rician 闪烁，引入了一个具有持续性的半随机卫星信道，在每次切换时从非均匀二项式点过程 (NBPP) 中抽取可见卫星，并使用圆轨道动力学传播所选卫星。在无协调的切换决策下，这导致了独立的服务时期，从而能够通过再生理论推导出持续容量。该容量与先前工作的非持续容量相关，并提供了闭合形式的界限以实现高效的评估。然后，最优切换被公式化为一个非线性分数规划问题，通过 Dinkelbach 算法的变种得到显式决策规则。结果表明，一种更简单的策略，即最大化服务容量，近似最优，且在基于 SGP4 的轨道预测和 mega-星座模拟中表现最佳。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
