TY - GEN
T1 - Federated Graph Learning Aided Task Scheduling Mechanism with Reduced Transmission Latency for Satellite-Ground Integrated Networks
AU - Gong, Yongkang
AU - Wang, Jingjing
AU - Liu, Xiaonan
AU - Cheng, Xiuzhen
AU - Han, Zhu
AU - Debbah, Mérouane
AU - Yuen, Chau
N1 - Publisher Copyright:
© 2025 IEEE.
PY - 2025
Y1 - 2025
N2 - Satellite-Air-Ground Integrated Networks (SAGINs) provide ubiquitous connectivity, global coverage and flexible deployment convenience for terrestrial users, which are beneficial to optimizing network resources and achieving task scheduling functions. However, the corresponding SAGIN nodes are dynamic and complex, leading to intractable multi-modal features and high network latency when graph model is used for collaborative task completion. Therefore, we establish a directed SAGIN federated graph model to minimize the total transmission latency via computation offloading and quantization methods. Specifically, we utilize the federated graph learning to process the time-varying graph nodes and sizes, and then perform deep reinforcement learning (DRL) to optimize the computation and quantization resources. Moreover, federated learning is convoked to accelerate the convergence speed. Finally, our simulation results show that the proposed method outperforms some advanced benchmarks in terms of convergence performance and transmission latency for multiple data modals.
AB - Satellite-Air-Ground Integrated Networks (SAGINs) provide ubiquitous connectivity, global coverage and flexible deployment convenience for terrestrial users, which are beneficial to optimizing network resources and achieving task scheduling functions. However, the corresponding SAGIN nodes are dynamic and complex, leading to intractable multi-modal features and high network latency when graph model is used for collaborative task completion. Therefore, we establish a directed SAGIN federated graph model to minimize the total transmission latency via computation offloading and quantization methods. Specifically, we utilize the federated graph learning to process the time-varying graph nodes and sizes, and then perform deep reinforcement learning (DRL) to optimize the computation and quantization resources. Moreover, federated learning is convoked to accelerate the convergence speed. Finally, our simulation results show that the proposed method outperforms some advanced benchmarks in terms of convergence performance and transmission latency for multiple data modals.
KW - Federated graph learning
KW - Space-Air-Ground Integrated Networks
KW - quantization schemes
KW - task scheduling
UR - https://www.scopus.com/pages/publications/105036361816
U2 - 10.1109/GLOBECOM59602.2025.11432713
DO - 10.1109/GLOBECOM59602.2025.11432713
M3 - 会议稿件
AN - SCOPUS:105036361816
T3 - Proceedings - IEEE Global Communications Conference, GLOBECOM
SP - 847
EP - 852
BT - GLOBECOM 2025 - 2025 IEEE Global Communications Conference
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2025 IEEE Global Communications Conference, GLOBECOM 2025
Y2 - 8 December 2025 through 12 December 2025
ER -