Research on Routing Equalization Algorithm of Inter-Satellite Partition for Low-Orbit Micro-Satellites

Hengfei Cheng, Zhaobin Xu, Xiaoxu Guo, Jia Yang, Kedi Xu, Shuqin Liu, Zhonghe Jin and Xiaojun Jin
Additional contact information
Hengfei Cheng: Micro-Satellite Research Center, Zhejiang University, Hangzhou 310007, China
Zhaobin Xu: Micro-Satellite Research Center, Zhejiang Micro-Satellite Research Laboratory, Zhejiang University, Hangzhou 310007, China
Xiaoxu Guo: Micro-Satellite Research Center, Zhejiang University, Hangzhou 310007, China
Jia Yang: Micro-Satellite Research Center, Zhejiang University, Hangzhou 310007, China
Kedi Xu: Micro-Satellite Research Center, Zhejiang University, Hangzhou 310007, China
Shuqin Liu: Micro-Satellite Research Center, Zhejiang University, Hangzhou 310007, China
Zhonghe Jin: Micro-Satellite Research Center, Zhejiang Micro-Satellite Research Laboratory, Zhejiang University, Hangzhou 310007, China
Xiaojun Jin: Micro-Satellite Research Center, Zhejiang Micro-Satellite Research Laboratory, Zhejiang University, Hangzhou 310007, China

Future Internet, 2022, vol. 14, issue 7, 1-18

Abstract: Low-orbit micro-satellite technology has developed rapidly in recent years due to its advantages of low time delay, low cost and short research period. However, among the existing inter-satellite routing algorithms, the classical flooding and greedy algorithms and their derivatives also have some limitations. The path delay calculated by the flooding algorithm is small but the calculation is large, while the greedy algorithm is the opposite. In this paper, a balanced inter-satellite routing algorithm based on partition routing is proposed. This paper presents the simulation experiments for the following indexes of the classic inter-satellite routing algorithms and the balanced partition routing algorithm: computation complexity, single-node computation pressure, routing path delay, path delay variance (data in Topo table satisfy μ = 5 , σ 2 = 10 ). The results reveal that the balanced partition routing algorithm achieves better performance. In this paper, two optimization directions of the balanced partition routing algorithm are simulated under conditions that the data in the Topo table satisfy μ = 5 , σ 2 = 6, σ 2 = 10 and σ 2 = 15 , respectively, when comparing their performance indicators. The experiments show that these two optimization methods can be adapted to various application scenarios and can further reduce the hardware cost of satellite nodes.

Keywords: low orbit; micro-satellite technology; star chain; routing algorithm; partitioning algorithm (search for similar items in EconPapers)
JEL-codes: O3 (search for similar items in EconPapers)
Date: 2022
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/1999-5903/14/7/207/pdf (application/pdf)
https://www.mdpi.com/1999-5903/14/7/207/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jftint:v:14:y:2022:i:7:p:207-:d:855095

Access Statistics for this article

Future Internet is currently edited by Ms. Grace You

More articles in Future Internet from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().