Zheheng Rao

dblp:205/3625 · DBLP profile ↗
← Back
11ranked-venue papers
7as first author
10since 2021 · last 2025
0000-0003-2913-7732ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 8 · 7 first-author · 7 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021
YearPublicationVenuePosition
2025 A LEO Satellite Routing Method Based on Incremental Evolutionary Graph Reinforcement Learning
abstract
With the advent of sixth-generation (6G) technologies and growing communication demands, Low Earth Orbit (LEO) satellite networks have become essential in modern communications. However, due to the dynamic topology and complex network state of LEO environments, existing routing methods often fail to make effective decisions, limiting transmission performance. This paper proposes a LEO satellite routing method based on incremental evolutionary graph reinforcement learning (IEGRL). To address network state perception challenges, we introduce a topological learning model using deep graph attention (DGA), which captures complex inter-satellite connectivity and resource states. Additionally, by integrating incremental evolution strategies (IES) into deep reinforcement learning (DRL), we replace sequential interactive proximal policy optimization (PPO) with global parallel ES, achieving efficient routing convergence in the highly dynamic LEO environment. Experimental results demonstrate that our IEGRL approach enhances LEO network load balancing by reducing end-to-end (E2E) network latency, decreasing packet loss, and improving throughput compared with the benchmark approaches.
Zheheng Rao, Wei Yang Bryan Lim, Ye Yao 0003, Yanyan Xu 0003, Manabu Tsukada, Yanyu Cheng
ICC1
2025 Intelligent routing methods for low-Earth orbit satellite networks based on machine learning: A comprehensive survey
Zheheng Rao, Shitong Xiao, Ye Yao 0003, Yanyan Xu 0003, Weizhi Meng 0001
Ad Hoc Networks2
2025 Dynamic LEO Satellite Routing Approach Based on Deep Graph Attention and Incremental Evolutionary Reinforcement Learning
abstract
Low Earth orbit (LEO) satellite networks are an important component of future 6G. However, due to the unique characteristics of the space environment—such as the complexity in modeling network states and the rapid dynamics of the network topology—existing routing methods often struggle to make appropriate routing decisions in the LEO satellite network context, which significantly limits network transmission performance. In this paper, we propose a dynamic satellite routing method based on deep graph attention and incremental evolution strategy (DGA-IES). Firstly, to address the challenge of accurately perceiving satellite network information, we introduce a topological perception learning model based on deep graph attention. By combining an enhanced message passing process with a self-attention mechanism, this model effectively captures complex features of the LEO network state, including inter-satellite connectivity relationships, as well as the resource states of satellites and links. Secondly, to tackle the problem of inefficient routing re-convergence in rapidly changing topologies, this paper integrates evolution strategies (ES) into deep reinforcement learning (DRL) approaches. We use the global parallel processing capabilities of ES to replace the sequential interactive proximal policy optimization (PPO) strategy in existing DRL. Moreover, we design an incremental evolutionary process based on satellite motion patterns, facilitating efficient routing convergence in highly dynamic satellite environments. Experimental results demonstrate that our DGA-IES approach enhances LEO network load balancing by reducing end-to-end (E2E) network latency by 10.3% 58.1%, decreasing packet loss by 3.8% 20.0%, and improving throughput by 11.1% 57.0% compared with the benchmark approaches.
Zheheng Rao, Dusit Niyato, Ye Yao 0003, Yanyan Xu 0003, Yanyu Cheng
IEEE Internet Things J.1
2025 Computation-Offloading Optimization for Satellite Edge Computing via Diffusion and Lyapunov-Based Deep Reinforcement Learning
abstract
Satellite edge computing (SEC) extends the capabilities of edge computing technology to satellite networks, facilitating rapid local processing of global task requirements. Deep reinforcement learning (DRL) has emerged as a promising approach for SEC scenarios due to its inherent dynamic adaptability, complex state modeling capability, and long-term optimization potential. However, existing DRL-based computing offloading techniques continue to encounter challenges including low sample efficiency, poor decision quality, and insufficient long-term stability, which constrain their performance in real satellite network environments. To address these challenges, this study proposes a diffusion and DRL-based approach for computation offloading in SEC networks called the generative artificial intelligence-DRL (GenAI-DRL). First, by implementing the cooperative computing model of the multi-SEC, this study comprehensively considers the heterogeneous computing and communication capabilities of satellite nodes, diversity of task types, and dynamic distribution of resources in an offloading strategy, thereby ensuring long-term system sustainability under dynamic resource constraints and provides a solid foundation for computation offloading in satellite networks with time-varying resource. Second, we integrate generative diffusion modeling (GDM) into the DRL framework to enhance policy generation by producing contextually relevant and high-quality action samples. This not only reduces the dependence on large-scale training data but also improves decision precision and generalization in complex, high-dimensional environments. Finally, a Lyapunov optimization framework is introduced to transform the offloading problem into an online per-slot optimization process, thereby ensuring the long-term stability of the SEC system under dynamic and unpredictable task arrivals and environmental conditions. The experimental results demonstrate that the method proposed offers significant advantages over the existing approaches in reducing task latency and enhancing system stability.
Zheheng Rao, Ye Yao 0003, Yanyan Xu 0003, Yanyu Cheng, Hongyang Du 0001
IEEE Internet Things J.1
2024 DAR-DRL: A dynamic adaptive routing method based on deep reinforcement learning
Zheheng Rao, Yanyan Xu 0003, Ye Yao 0003, Weizhi Meng 0001
Comput. Commun.1
2024 Reversible data hiding for color images based on prediction-error value ordering and adaptive embedding
Hui Wang 0020, Detong Wang, Zhihui Chu, Zheheng Rao, Ye Yao 0003
J. Vis. Commun. Image Represent.4
2023 Cellular Traffic Prediction: A Deep Learning Method Considering Dynamic Nonlocal Spatial Correlation, Self-Attention, and Correlation of Spatiotemporal Feature Fusion
abstract
Cellular traffic prediction will play a key role in the deployment of future smart cities. Although the current traffic prediction methods based on deep learning show better performance than traditional prediction methods, they still have the following problems: (1) In spatial domain, the correlations between cellular traffic features cannot be captured accurately in non-local (including “geographic adjacency” and long-distance) spatial areas. (2) In temporal domain, the correlation of different time-grained features is failed to consider. To address these problems, a deep learning method considering dynamic non-local spatial correlation, self-attention, and correlation of spatio-temporal feature fusion is proposed. In spatial domain, our method can accurately capture the spatial correlation and highlight the contribution of more relevant traffic in the non-local area by designing a NLG-NLAM model. In temporal domain, the correlations of time-periodic features with different granularities are considered to clarify the key roles of different periodic features and eliminate the influence of irrelevant cellular traffic features on the prediction by designing a calibration layer. Experimental results indicate that the proposed method shows better performance than other mainstream prediction methods on three real-world cellular traffic datasets.
Zheheng Rao, Yanyan Xu 0003, Shaoming Pan, Jiabao Guo, Yuejing Yan
IEEE Trans. Netw. Serv. Manag.1
2023 Privacy-Preserving Multi-Source Image Retrieval in Edge Computing
abstract
Users outsource images to edge servers physically closer to their location for real time applications because of the low latency and low transmission overhead. Outsourcing to these edge servers however, increases the risks to data privacy. Almost all existing privacy preserving image retrieval schemes utilize a single cloud server to execute retrieval tasks and provide centralized image retrieval but at high computational costs, thus are not suitable for the distributed edge environments with limited computing resources. We propose a lightweight privacy-preserving multi-source image retrieval scheme adapted specifically for the distributed edge environment. We apply high efficiency orthogonal decomposition and learning with errors (LWE) strategy to encrypt image features and construct cipher indexes and trapdoors, guaranteeing the security of the data, while reducing computational costs. The orthogonality of data ensures that the accuracy of retrieval results is not compromised by the random numbers used in the scheme. In addition, the proxy re-encryption technology is adopted to support the retrieval of multi-source images encrypted by unique data owners with different keys. A detailed performance analysis and comprehensive experiments demonstrate that our scheme guarantees data security with very high retrieval accuracy and a low computational burden, consistent with the demands of edge environments.
Yuejing Yan, Yanyan Xu 0003, Xue Ouyang 0002, Zheheng Rao
IEEE Trans. Serv. Comput.6
2022 Privacy-preserving indoor localization based on inner product encryption in a cloud environment
Yanyan Xu 0003, Yuejing Yan, Zheheng Rao, Xue Ouyang 0002
Knowl. Based Syst.5
2021 A deep learning-based constrained intelligent routing method
Zheheng Rao, Yanyan Xu 0003, Shaoming Pan
Peer-to-Peer Netw. Appl.1
2020 An intelligent routing method based on network partition
Zheheng Rao, Yanyan Xu 0003, Shaoming Pan
Comput. Commun.1