Research on Hopping Routing of Periodic Multiorbit LEO Satellites

In recent years, the low Earth orbit microsatellite network technology has experienced rapid development due to its advantages of low latency, low cost, and short development cycles. However, building an efficient and reliable satellite network routing system faces many challenges due to the charact...

Full description

Saved in:
Bibliographic Details
Main Authors: Hengfei Cheng, Zhaobin Xu, Zhonghe Jin, Xiaojun Jin, Dading Zhang, Sicheng Song
Format: Article
Language:English
Published: Wiley 2024-01-01
Series:International Journal of Aerospace Engineering
Online Access:http://dx.doi.org/10.1155/2024/9586757
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In recent years, the low Earth orbit microsatellite network technology has experienced rapid development due to its advantages of low latency, low cost, and short development cycles. However, building an efficient and reliable satellite network routing system faces many challenges due to the characteristics of satellite networks, such as fast-changing topology, large variations in link latency, higher probabilities of node and link failures, and limited resources. Routing algorithms have a significant impact on intersatellite communication and have become a research hotspot. The current mainstream algorithms focus on reducing information propagation delays between satellites to enable faster transmission. However, many satellite networks, such as meteorological observation satellite networks, are not sensitive to propagation delays but emphasize reducing hardware costs, especially for the receiving and transmitting signal systems of satellites. This means minimizing the single-step signal transmission distance of satellites. This article proposes a routing algorithm based on time slot planning and the shortest path step length. Experimental simulation results demonstrate that this algorithm significantly reduces the step length of signal transmission and lowers hardware costs.
ISSN:1687-5974