Abstract
Navigation augmentation using low-orbit satellites is a low-cost, high-precision technique. Efficient transmission of data between the satellites and ground station is a prerequisite to ensure that this technique can be achieved. Satellite-ground link planning directly affects the transmission efficiency. In addition, appropriate planning of the links enables the reduction in the routing calculation and link switching overhead. In view of the data transmission characteristics of a satellite navigation augmentation network, this paper optimizes the ground-satellite link planning with respect to three aspects: link switching frequency, routing update frequency, and relay satellite configuration. By focusing on the above three aspects, we propose a link planning algorithm with the minimum number of link switching times, minimum number of route updates, and relay satellite configuration constraints. Finally, the simulation results are presented to demonstrate the performance of the proposed algorithm.
Highlights
Rapid geometric position variation and short propagation delay are characteristics of low-earth orbit (LEO) satellites, which make them a low-cost and high-precision solution for navigation augmentation
LEO satellites move quickly relative to the ground, thereby resulting in rapid geometric position variation, which facilitates the rapid determination of carrier ambiguity parameters and improves the use of carrier data
We propose maximum service time algorithm (MST), graph-based minimum handover times algorithm (GMH), MINIMUM ROUTING UPDATE FREQUENCY ALGORITHM (MRU), and SHAPE-CONSTRAINT MINIMUM ROUTING UPDATE FREQUENCY ALGORITHM (SC-MRU) for each of the above three aspects, wherein MST, GMH, and MRU can guarantee the optimality in theory
Summary
Rapid geometric position variation and short propagation delay are characteristics of low-earth orbit (LEO) satellites, which make them a low-cost and high-precision solution for navigation augmentation. A valid link plan slice must be within the visibility time window of the ground station and the corresponding satellite. According to the visibility relationship between the satellites and the ground station, the network directed graph is constructed On this basis, SGLP is transformed into the minimum cost maximum flow problem, and the link plan with the least number of handover times is obtained. SGLP is transformed into the minimum cost maximum flow problem, and the link plan with the least number of handover times is obtained This method theoretically guarantees the optimality of the results
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
