Xinglong Jiang

Xinglong Jiang

Auto-generated profile, based on publicly available information

Xinglong Jiang

Innovation Academy for Microsatellites of Chinese Academy of Sciences, University of Chinese Academy of Sciences, Shanghai, China

Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

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

Representative Publications

View All Publications
5 November 2025 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
GLGaosai Liu
Gaosai Liu
XJXinglong Jiang
Xinglong Jiang
JLJinyu Liu
Jinyu Liu
SSSiyue Sun
Siyue Sun
GLGuang Liang
Guang Liang
HHHaiying Hu
Haiying Hu
Traditional routing techniques face considerable challenges in large-scale low Earth orbit (LEO) satellite networks for Internet of Things (IoT) data backhaul, such as slow convergence speed, excessive end-to-end hops, and high latency. Recent intelligent routing algorithms have achieved some progress in improving routing performance; however, significant potential remains in enhancing convergence efficiency, hop-count management, and latency optimization. To overcome the insufficient adaptability of existing approaches in large-scale LEO constellation environments, this article proposes a collaborative routing algorithm that integrates $Q$ -learning and game theory, termed collaborative $Q$ -learning and game-theoretic routing (CoQGR). By fully exploiting satellite network topology characteristics, CoQGR deeply integrates and adapts $Q$ -learning models with game-theoretic models. Specifically, in the $Q$ -learning module, a greedy strategy dynamically optimizes the $Q$ -table to accelerate convergence and establish basic routing paths. In the game-theoretic module, dynamic coalitions among satellites along the basic paths are formed based on maximum trusted communication distances, thereby enhancing the initial routes. Ultimately, under an identical maximum trusted distance constraint, unnecessary relay satellites are bypassed, reducing routing hops and further decreasing end-to-end latency. Simulation experiments are conducted based on the Starlink constellation, comparing CoQGR with recent $Q$ -learning routing algorithms designed for large-scale constellations. The simulation results indicate that CoQGR significantly outperforms existing schemes by reducing routing convergence time, end-to-end hop counts, and average transmission latency by approximately 50%, 55.84%, and 41.39%, respectively.