Local-State Routing in Satellite Constellation Networks from the Perspective of Complex Network

作     者：Xin Xu Jun Cai Aijun Liu Chaoying Dong Chen Han Xin Xu;Jun Cai;Aijun Liu;Chaoying Dong;Chen Han

作者机构：Institute of Communication EngineeringArmy Engineering University of PLANanjing 210007China The Unit 94973 of the Chinese People’s Liberation ArmyHangzhou 310000China The Sixty-Third Research InstituteNational University of Defense TechnologyNanjing 210007China 

出 版 物：《China Communications》 (中国通信（英文版）)

年 卷 期：2023年第20卷第7期

页      面：72-88页

核心收录：

学科分类：0810[工学-信息与通信工程] 08[工学] 0804[工学-仪器科学与技术] 080402[工学-测试计量技术及仪器] 

基　　金：supported in part by the National Natural Science Foundation of China under Grant 62171466 and the National Natural Science Foundation of China under Grant 61971440 the National Key R&D Program of China under Grant 2018YFB1801103 the Natural Science Foundation on Frontier Leading Technology Basic Research Project of Jiangsu under Grant BK20192002。 

主　　题：satellite constellation local state routing traffic dynamics complex networks robustness 

摘      要：Routing algorithms in satellite constellation networks usually make use of the local state information to adapt to the topology and traffic dynamics,since it’s difficult to obtain the global states in time due to the spatial large-scale feature of constellation networks.Furthermore,they use different range of local states and give these states distinct weights.However,the behind design criterion is ambiguous and often based on experience.This paper discusses the problem from the perspective of complex network.A universal local-state routing model with tunable parameters is presented to generalize the common characteristics of local-state routing algorithms for satellite constellation networks.Based on this,the impacts of localstate routing algorithms on performance and the correlation between routing and traffic dynamics are analyzed in detail.Among them,the tunable parameters,the congestion propagation process,the critical packet sending rate,and the network robustness are discussed respectively.Experimental results show that routing algorithms can achieve a satisfactory performance by maintaining a limited state awareness capability and obtaining the states in a range below the average path length.This provides a valuable design basis for routing algorithms in satellite constellation networks.