arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2204.03802cs.NI
收藏

大规模LEO卫星网络中基于随机几何的低延迟路由

Stochastic Geometry-Based Low Latency Routing in Massive LEO Satellite Networks

Ruibo Wang, Mustafa A. Kishk, Mohamed-Slim Alouini

摘要:

研究了大规模低轨卫星网络中的路由问题。当星间通信距离受限时,在一个等高度的星座中,选择不同的中继卫星来最小化延迟。首先,在理想情况下,当所有理想位置都有可用卫星时,得到全局最优解。接下来,我们提出了一个最近邻搜索算法的现实(非理想)的情况下,有限数量的卫星。该算法可以通过有限的迭代次数和极小的搜索范围,在理想情况下逼近全局最优解。与其他路由策略相比,该算法在延迟方面具有明显的优势。此外,我们提供了两个近似技术,可以给出严格的下限和上限的延迟所提出的算法,分别。最后,研究了延迟与星座高度、卫星数目和通信距离的关系。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑