With the rapid development of large-scale satellite constellations and the increasing demand for rapid communication and emergency rescue using global satellite-based Internet, there have been new requirements for efficient algorithms for inter-communication between satellites. As the constellations of low-orbit satellites become larger, the complexities of real-time inter-satellite calculation and path planning are becoming more complicated and are increasing geometrically. To address the bottlenecks in large-scale node space computing, we introduced a global space grid. Based on this grid, an efficient calculation method of spatial inter-connection between satellite constellations is proposed, according to the concept of “storage for computing” and the high computational efficiency of the spatial grid model. This strategy includes the following parts: (1) the introduction of the GeoSOT-3D global grid model into aerospace and the construction of the aerospace grid indexing BigTable; (2) a set of algorithms for satellite visibility analysis according to the visible grid look-up table and the secondary grid index; and (3) planning inter-satellite routing by querying the grid’s inherent visibility. The idea at the basis of this method is to employ the “space for time” concept to convert the high-dimensional floating operations into one-dimensional matching operations by querying the inherent “visible” attribute of the grid. In our study, we simulated thousands of satellites, discretized their trajectories into grids, and pre-calculated the visibility between grid cells to plan the routing path for the ground data transmission. The theoretical analysis and experimental verification show that the algorithm is feasible and efficient, and it can significantly improve the computational efficiency of inter-satellite connection. We hope that the method can be used in emergency communications, disaster warning, and maritime rescue, and can contribute to the next generation of satellite internet and “satellite-ground” integrated networks.

中文翻译：

---

基于空间网格模型的卫星星座空间互联算法

随着大规模卫星星座的快速发展以及对使用基于全球卫星的Internet的快速通信和紧急救援的需求不断增长，对用于卫星之间相互通信的有效算法提出了新的要求。随着低轨道卫星的星座变大，实时卫星间计算和路径规划的复杂性变得越来越复杂，并且几何形状也在增加。为了解决大规模节点空间计算中的瓶颈，我们引入了全局空间网格。在此网格的基础上，根据“计算存储”的概念和空间网格模型的高计算效率，提出了一种有效的卫星星座之间空间互连的计算方法。该策略包括以下部分：（1）将GeoSOT-3D全球网格模型引入航空航天，并构建索引BigTable的航空航天网格；（2）根据可见网格查询表和二次网格索引，进行卫星能见度分析的算法集；（3）通过查询网格的固有可见性来规划卫星间路由。该方法的思想是采用“时间空间”的概念，通过查询网格固有的“可见”属性将高维浮动运算转换为一维匹配运算。在我们的研究中，我们模拟了数千颗卫星，将它们的轨迹离散为网格，并预先计算了网格单元之间的可见性，以规划用于地面数据传输的路由路径。理论分析和实验验证表明，该算法可行，高效，可以显着提高星际连接的计算效率。我们希望该方法可用于紧急通信，灾难预警和海上救援，并有助于下一代卫星互联网和“卫星地面”集成网络。