Satellite visibility in Northern Europe based on digital maps

Bråten, Lars Erling

doi:10.1002/(sici)1099-1247(200001/02)18:1<47::aid-sat650>3.0.co;2-l

Cited by 1 publication

(1 citation statement)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the process of satellite constellation networking, the first step is to determine whether the satellites are visible before establishing a network link between the satellites. Traditional analysis algorithms are based on research on satellites that meet the visibility conditions in a short time and under accuracy constraints [13,14]. This requires multiple floating-point operations involving the orbital parameters in order to solve the orbital equations, which is inefficient and requires computing resources [4,11].…”

Section: Introductionmentioning

confidence: 99%

A Space-Interconnection Algorithm for Satellite Constellation Based on Spatial Grid Model

Hou

Cheng

et al. 2020

Remote Sensing

View full text Add to dashboard Cite

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.

show abstract

Section: Introductionmentioning

confidence: 99%