RGRonghao Gao

Ronghao Gao

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Ronghao Gao has a total of 9 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Large Language Models for Task-Oriented Intelligent Large-Scale Satellite Networks: Architectures, Challenges, and Solutions

    by Ronghao Gao, Bo Zhang, Qinyu Zhang, Zhihua Yang

    Large-Scale Satellite Network (LSSN) has become one of the most essential components for the Internet of Everything (IoE) architecture in the upcoming Sixth-Generation (6G) era with highly dynamic topologies and diversified data transmission requirements, offering ubiquitous connectivity for global data from various sources. However, the current data-driven framework in LSSNs could not burden the ever-increasing specialized data transmission demands including reliability, timeliness, and lightweightness in the complex time-varying topology. Recently, Large Language Model (LLM) with excellent decision-making, personalized target-oriented services, and adaptive learning and optimization, expands rapidly into the IoE networks. With these remarkable advantages, LLM exhibits exploitable coordination with LSSNs for the comprehensive applications in next-generation networks since it could cope with massive multi-source data transmission and adaptive topology optimization. In this article, a comprehensive perspective of LLMs when exploited in LSSNs for IoE structures, including architectures, challenges, and solutions, is extensively discussed with prospective scenarios. A case study with Task-oriented Intelligent DeliverY (TIDY) framework for LSSNs is proposed and compared with the current advanced State-Of-The-Art (SOTA) methods. The simulation results are given to verify the efficiency of our proposed TIDY framework.


  • Cooperatively Caching Mechanism in Large-Scale LEO Satellite Networks: An Age-Driven Multiagent Deep Reinforcement Learning Approach

    by Han Li, Ronghao Gao, Yue Li, Zhihua Yang

    In large-scale low Earth orbit (LEO) satellite networks, cache placement and update are facing challenges such as limited cache volume, update capacity, frequently interrupted intersatellite links (ISLs), and sudden changes in content popularity, leading to the difficulty for obtaining fresh data for existing algorithms by optimizing average user access delay instead of timeliness and adaptability. To address this issue, in this work, we propose an age-driven multiagent deep reinforcement learning (MADRL)-based cooperative cache and update mechanism called as age-driven cooperative cache and update (ADCCU) algorithm, in which we establish an age-driven cache gain function to evaluate the effective value of holding a data item from the cache’s perspective. In particular, we formulate the age-driven cooperatively cache scheduling issue as an integer programming (IP) problem and solve it by exploiting a Markov decision process (MDP). The simulation results demonstrate that, under a cache capacity constraint of $c_{i}$ = 3, the ADCCU algorithm significantly outperforms baseline caching strategies: the average cache gain is increased by approximately 1.09 compared to the deep deterministic policy gradient (DDPG)-based cache, 2.88 compared to the least frequently used (LFU), and 4.92 compared to the least recently used (LRU), respectively, and the cache hit ratio is improved by approximately 5.31% over the DDPG-based cache, 56.4% over LFU, and 65.9% over LRU, respectively.

  • Toward the Age of Semantic Information: A Deep Learning-Enabled Generalized Deduplication-Based Semantic Transmission Mechanism

    by Yunlai Xu, Ronghao Gao, Qinyu Zhang, Zhihua Yang

    In the upcoming global-coverage 6G networks, high packet loss and long latency in long-distance transmissions exacerbate the trade-off between data timeliness and integrity, particularly in time-sensitive applications involving time-series data with stringent integrity requirements. This challenge exposes the limitations of existing transmission systems, such as source-channel coding and semantic communication, which fail to jointly address both dimensions. In this paper, we propose a deep learning (DL)-enabled generalized deduplication (GD)-based semantic transmission (DLGD-ST) mechanism for time-series data. By leveraging GD to address the impact of semantic ambiguity on data integrity, DLGD-ST exploits the semantic recovery and temporal discreteness of the data to effectively mitigate the conflict between integrity and timeliness. In particular, a well-designed long-short-term memory (LSTM)-based GD algorithm is developed to separate shallow semantic components and supplementary components, ensuring the integrity of semantic transmission. A deep semantic encoding process is then performed using a double-layer progressive dimension reduction (DPDR) and adaptive quantization (AQ) scheme, which capitalizes on the channel robustness of semantics to reduce transmission rounds and improve timeliness. Furthermore, an incremental dimension hybrid automatic repeat request (ID-HARQ) mechanism is introduced to improve semantic reliability by retransmitting high-dimensional semantics, thereby further minimizing end-to-end transmission rounds. To accurately evaluate performance, we introduce the Age of Semantic Information (AoSI), which incorporates integrity constraints into the generalized Age of Information (AoI) to jointly assess integrity and timeliness. Simulation results demonstrate that the proposed DLGD-ST mechanism, enabled by accurate data recovery and reduced transmission rounds, achieves better AoSI performance compared to existing communication systems under both high and low signal-to-noise ratio (SNR) conditions.


  • Task-Oriented Semantic Delivery in Large-Scale Heterogeneous Satellite Networks: A Local Topological Information-Dependable Deep Learning Approach

    by Ronghao Gao, Bo Zhang, Qinyu Zhang, Zhihua Yang

    In the Large-Scale Heterogeneous Satellite Networks (LSHSNs) integrating Low Earth Orbit (LEO) and Medium Earth Orbit (MEO) satellites, data delivery faces complex topology and dynamic connectivity, which poses a significant challenge to current graph-dependable transmission strategies requiring global topological information, incurring huge computational cost and interactive overhead. To address this issue, in this paper, we propose a Local Information-dependable Semantic Delivery Mechanism (LISDM) by exploiting topological features at the semantic level, in which we develop a Task-oriented Semantic-aware Topology Compression Network (TSTCN) to condense the global topology according to specific task demands. Besides, we develop a Deep Q-Network enabled Semantic Coded Routing (DQNSCR) algorithm for the semantic delivery in the LISDM by designing a novel metric called Semantic Delivery Efficiency (SDE). The simulation results indicate that the proposed mechanism performs better in improving the required topology scale and throughput compared with typical data delivery mechanisms such as the conventional Open Shortest Path First (OSPF) routing algorithm, the DQN-based Intelligent Routing (DQN-IR) algorithm, and Real-Time Hop-by-Hop Routing (RTHop) algorithm with Space-Time Graph (STG) model, respectively.


  • Toward the Age in Forwarding: A Deep Reinforcement Learning Enabled Routing Mechanism for Large-Scale Satellite Networks via Spatial–Temporal Graph Neural Networks

    by Ronghao Gao, Bo Zhang, Qinyu Zhang, Zhihua Yang

    In large-scale satellite networks, end-to-end data delivery confronts long propagation latency and dynamical connectivity, heavily challenging current routing strategies due to the time-changing topology. For the tasks with high timeliness requirements, especially, it will cause obviously low freshness of data since huge computational cost and transmission overhead are required for implementing optimal routing decisions. To address this issue, in this paper, we propose an Age-driven Deep Reinforcement Learning (DRL) enabled Routing Mechanism (ADRLRM) for the large-scale satellite network by considering the impact of time-varying topology on the timeliness of data, in which a Parameter-adjustable Two-step Slotting Algorithm (PTSA)-assisted Spatial-Temporal Graph Neural Network (STGNN) is well-designed to extract the topological features both in temporal and spatial dimensions. In particular, we develop a novel metric of data freshness called Routing-aware Age of Information (RAoI) to evaluate the timeliness of data delivery, which is incorporated into the customized reward function of the proposed mechanism as an optimization objective. The simulation results indicate that the proposed mechanism performs better in reducing the end-to-end delivery latency, number of forwarding hops, and average RAoI compared with the conventional Open Shortest Path First (OSPF) routing algorithm, Deep Q-Networks based Intelligent Routing (DQN-IR), and GNN-based GraphPR routing algorithm, respectively.


  • Interference-Suppressed Joint Channel and Power Allocation for Downlinks in Large-Scale Satellite Networks: A Dynamic Hypergraph Neural Network Approach

    by Bo Zhang, Ronghao Gao, Pengyu Gao, Ye Wang, Zhihua Yang

    In the Large-scale Satellite Network (LSN), inter-beam interference significantly hinders the transmission performance of Low Earth Orbit (LEO) satellite downlinks. This interference exhibits notable time-varying characteristics due to the relatively rapid movements between LEO satellites and ground users, posing a substantial challenge to existing transmission resource allocation techniques. To tackle this issue, we introduce the Hypergraph Neural Network (HGNN)-enabled Resource Allocation (HGNNRA) algorithm for the downlinks of LSN. This algorithm aims to solve a transmission-rate maximization problem, effectively handling the time-varying interference among multiple beams in the downlink through a well-tailored Dynamic Hypergraph Neural Network (DynHGNN). Specifically, considering the coupling complexity of satellite beam coverage and user participation, we have developed a Dynamic Hypergraph-based interference model, along with a customized construction algorithm, to describe their time-varying relationships precisely. Simulation results indicate that our proposed HGNNRA outperforms both Graph Convolutional Network (GCN) [14], HGNN [15], GNN-DDQN [48], and GCNRA in terms of transmission rate and the satisfaction degree of user transmission requirement metrics.


  • Topology-Compressed Data Delivery in Large-Scale Heterogeneous Satellite Networks: An Age-Driven Spatial-Temporal Graph Neural Network Approach

    by Ronghao Gao, Bo Zhang, Qinyu Zhang, Zhihua Yang

    In Large-Scale Heterogeneous Satellite Networks (LSHSNs) integrating Low Earth Orbit (LEO) and Medium Earth Orbit (MEO) satellites, high-timeliness data delivery confronts dynamical connectivity and obvious latency, which heavily challenges existing graph-dependable transmission strategies requiring to obtain global topological information with huge computational cost and signaling overhead. To address this issue, in this paper, we propose an Age-predicting Local Information Dependable Transmission (ALIDT) mechanism for the LSHSN by considering the impact of time-varying topology on the timeliness of data, in which a novel metric of data freshness called Forwarding-aware Age of Information (FAoI) is well-designed to evaluate the timeliness in data forwarding at node. In particular, we develop a satellite Coverage-based Local Information Sharing (CLIS)-assisted Spatial-Temporal Graph Neural Network (STGNN) to extract the topological features in both temporal and spatial dimensions and a Graph Matching Network (GMN)-based topology compression algorithm to improve computation efficiency. The simulation results indicate that the proposed mechanism performs better in improving the storage overhead, throughput and average FAoI compared with the conventional Open Shortest Path First (OSPF) routing algorithm with Time-Varying Graph (TVG) model, GNN-based Multipath Routing (GMR) algorithm, and Gated Recurrent Units (GRU) based metric prediction algorithm in hybrid satellite networks, respectively.


  • Semantic-Aware Jointed Coding and Routing Design in Large-Scale Satellite Networks: A Deep Learning Approach

    by Ronghao Gao, Yunlai Xu, Han Li, Qinyu Zhang, Zhihua Yang

    In large-scale satellite networks, data delivery confronts obvious challenges such as high loss rate and long propagation delay leading to low Packet Delivery Ratio (PDR) and huge delivery latency over intermittent Inter-Satellite Links (ISLs), making the current routing algorithms exploiting typical Automatic Repeat reQuest (ARQ) mechanisms extremely inefficient and even incapable. To address this issue, in this paper, we propose a semantic-aware coding and routing joint mechanism called Semantic Adaptive Coding and Routing (SACR) by considering both the semantic correlations in the context-dependent data and the link status knowledge. In particular, the proposed SACR achieves excellent error-tolerant and routing-agile capabilities by an elaborately interactive design consisting of a customized routing-aware Semantic Adaptive Coding Hybrid ARQ (SAC-HARQ) mechanism and a Semantic Coding-based Routing Mechanism (SCRM). The simulation results indicate that the proposed SACR mechanism performs better in reducing the average delivery latency and improving the effective throughput compared with typical routing mechanisms such as Open Shortest Path First (OSPF) routing, Deep Q-Networks based Intelligent Routing (DQN-IR), and Real-Time Hop-by-hop routing (RTHop), integrating with typical semantic coding methods, i.e., Deep Learning-based Joint Channel-Source Coding (DL-JSCC), Deep learning-based Semantic Communication system (DeepSC), and Semantic Coding HARQ (SCHARQ), respectively.