论文标题
大型LEO卫星网络中基于随机几何的低潜伏期路由
Stochastic Geometry-Based Low Latency Routing in Massive LEO Satellite Networks
论文作者
论文摘要
在本文中，研究了大量低地球轨道（LEO）卫星网络的路由。当卫星到卫星通信距离受到限制时，我们选择不同的继电器卫星以最大程度地减少恒定高度的星座的延迟。首先，当所有理想位置都有可用的卫星时，在理想情况下获得了全局最佳解决方案。接下来，我们建议使用有限数量的卫星的最近的邻居搜索算法，以了解现实（非理想）方案。所提出的算法可以通过有限数量的迭代和少量搜索在理想情况下在理想情况下接近全局最佳解决方案。与其他路由策略相比，所提出的算法在延迟方面显示出显着的优势。此外，我们提供两种近似技术，可以分别为所提出算法的潜伏期提供紧密的下限和上限。最后，研究了潜伏期与星座高度，卫星数量和通信距离之间的关系。
In this paper, the routing in massive low earth orbit (LEO) satellite networks is studied. When the satellite-to-satellite communication distance is limited, we choose different relay satellites to minimize the latency in a constellation at a constant altitude. Firstly, the global optimum solution is obtained in the ideal scenario when there are available satellites at all the ideal locations. Next, we propose a nearest neighbor search algorithm for realistic (non-ideal) scenarios with a limited number of satellites. The proposed algorithm can approach the global optimum solution under an ideal scenario through a finite number of iterations and a tiny range of searches. Compared with other routing strategies, the proposed algorithm shows significant advantages in terms of latency. Furthermore, we provide two approximation techniques that can give tight lower and upper bounds for the latency of the proposed algorithm, respectively. Finally, the relationships between latency and constellation height, satellites' number, and communication distance are investigated.
