Author
Listed:
- 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)
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.
Suggested Citation
Hengfei Cheng & Zhaobin Xu & Xiaoxu Guo & Jia Yang & Kedi Xu & Shuqin Liu & Zhonghe Jin & Xiaojun Jin, 2022.
"Research on Routing Equalization Algorithm of Inter-Satellite Partition for Low-Orbit Micro-Satellites,"
Future Internet, MDPI, vol. 14(7), pages 1-18, July.
Handle:
RePEc:gam:jftint:v:14:y:2022:i:7:p:207-:d:855095
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jftint:v:14:y:2022:i:7:p:207-:d:855095. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.