XJXinglong Jiang

Xinglong Jiang

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Xinglong Jiang has a total of 5 co-authors. Here are the top co-authors by number of shared publications:

  • Gaosai Liu

    Innovation Academy for Microsatellites of CAS, Shanghai 201204, China

    1 shared publication
  • Guang Liang

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

    1 shared publication
  • Haiying Hu

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

    1 shared publication
  • Jinyu Liu

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

    1 shared publication
  • Siyue Sun

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

    1 shared publication

Latest Publications

  • CoQGR: A Collaborative Routing Strategy Integrating Q-Learning and Cooperative Game Theory for Large-Scale LEO Satellite Constellations

    by Gaosai Liu, Xinglong Jiang, Jinyu Liu, Siyue Sun, Guang Liang, 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.