Yajie Ding

Yajie Ding

Auto-generated profile, based on publicly available information

Yajie Ding

School of Communication and Information Engineering, Chongqing University of Posts and Telecommunications, Chongqing, China

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

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

Representative Publications

View All Publications
18 November 2024 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
Yongyi RanYongyi Ran
Yongyi Ran
YDYajie Ding
Yajie Ding
SCShuangwu Chen
Shuangwu Chen
JLJizhao Lei
Jizhao Lei
JLJiangtao Luo
Jiangtao Luo
An efficient routing strategy in Low Earth Orbit (LEO) satellite networks is critical for air-space-ground integrated communication towards 6G. However, the existing terrestrial routing algorithms cannot well handle the high-speed movement issue of satellites, while the existing satellite routing algorithms usually suffer from high communication overhead or high computational complexity. To address the above issues, we propose a fully distributed dynamic packet routing algorithm based on Graph Neural Network (GNN)-enhanced Multi-Agent Deep Reinforcement Learning (MADRL), named GraphPR. In GraphPR, the satellite routing problem is modeled as a Partially Observable Markov Decision Process (POMDP), where each satellite only needs to share the information with one-hop neighbors. Then, Graph Attention Network (GAT) is leveraged to encode the perceived one-hop information and derive a hidden representation implicitly consisting of multi-hop satellite information. Subsequently, MADRL is employed to build a fully distributed optimization framework and make routing decisions. In addition, a special mechanism called Residual Shortest Path Hops (RSPH) is designed to guide the routing selection and avoid routing loops. Finally, the experimental results illustrate that GraphPR has better performance in terms of packet loss rate, average delivery time, throughput, and average queuing length than the baseline algorithms.