Jiaxin Song

Dr. Jiaxin Song

orcid

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
19 May 2025 in IEEE Transactions on Aerospace and Electronic Systems
Verified
Journal Article
Closed access
YJYing Ju
Ying Ju
JSJiaxin Song
Jiaxin Song
WLWenjin Li
Wenjin Li
YZYasheng Zhang
Yasheng Zhang
CHCi He
Ci He
Chen ChenChen Chen
Chen Chen
Low earth orbit (LEO) satellite networks have become increasingly important for providing global communication services. However, the highly dynamic topology and uneven load distribution in LEO satellite networks pose significant challenges for load-balancing routing techniques. We propose a dynamic load-balancing routing algorithm (DLBR) based on the multiagent dueling double deep Q-network (D3QN), which adopts a fully distributed local decision-making mode to adapt to the highly dynamic satellite network topology effectively. The algorithm makes optimal routing decisions based on local load information combined with predictive traffic information. To more effectively obtain predictive traffic information and guide the load-balancing routing algorithm in making accurate decisions, we further propose a traffic prediction algorithm based on graph convolutional network (GCN), long short-term memory (LSTM), and Attention mechanism, which fully utilizes the spatial and temporal features of the LEO satellite network traffic for spatiotemporal traffic prediction. Our results demonstrate that the proposed DLBR based on traffic prediction can effectively reduce the maximum and average bandwidth utilization of routing paths, thereby balancing the network load

28 May 2023 in Remote Sensing
Verified
Journal Article
Open access
PDF file
FDFeihu Dong
Feihu Dong
JSJiaxin Song
Jiaxin Song
YZYasheng Zhang
Yasheng Zhang
YWYuqi Wang
Yuqi Wang
THTao Huang
Tao Huang
Due to the rapid development of the space–air–ground integrated network (SAGIN), a satellite communication system has the advantages of wide coverage and low requirements for a geographical environment and is gradually becoming the main competitive technology for 6G. The low-earth-orbit (LEO) satellite network has the characteristics of low transmission delay, small propagation loss, and global coverage, and its exploration has become the main research object of contemporary satellite communications. However, traditional routing algorithms cannot adapt to the characteristics of the high dynamics and load-balancing requirements of LEO satellite networks. In this paper, a load-balancing routing algorithm for LEO satellites based on Deep Q-Network (DQN-LLRA) is proposed by using deep reinforcement learning. Making use of the model obtained by the DQN training, satellite nodes can select the best routing results according to the delay, bandwidth, and queue utilization of the surrounding satellite nodes. The simulation and analysis show that the path load obtained by the proposed algorithm is low. Compared with the Q-learning-based algorithm, this algorithm reduces the maximum queue utilization rate of the routing path by 5%, reduces the average queue utilization rate of the routing path by 13%, and effectively balances the load in the network.

1 January 2023 in Mathematical Foundations of Computing
Verified
Journal Article
Open access
PDF file
FKFanyu Kong
Fanyu Kong
CMCuixia Miao
Cuixia Miao
YHYujia Huo
Yujia Huo
JSJiaxin Song
Jiaxin Song
We consider the single-machine scheduling with coupled task and rejection, in which each coupled task is either accepted and processed on a single machine or rejected with a certain rejection penalty. Each accepted coupled task $ J_{j} $ is made of two tasks with processing times $ a_j $ and $ b_j $, respectively, and a fixed exactly time interval $ L_j $ between the two tasks is required. The objective is to minimize the makespan of the accepted coupled task and the total penalty of the rejected coupled task. We present $ 3 $-approximation algorithm for the cases of $ a_{j} = L_{j} = p $ and $ b_j = L_j = p $, respectively, and prove that the problems with common $ b_j $ or common $ a_j $ is polynomially solvable. Furthermore, when $ a_{j} = b_{j} = p $, we provide a $ 2 $-approximation algorithm for $ L_{j}>p $ and show that the problem with for $ L_{j}\leq p $ can be solved in polynomial time.