Suzhi Cao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Suzhi Cao has a total of 59 co-authors. Here are the top co-authors by number of shared publications:
- Junyong Wei
Department of Technology and Information, Guangxi Communications Design Group Co., Ltd., China
3 shared publications - Xue Sun
School of Computer and Control Engineering, University of the Chinese Academy of Sciences, 74519 Beijing, Beijing China
3 shared publications - Han Hao
Technology and Engineering Center for Space Utilization, Chinese Academy of Sciences, Beijing, 100094, China
2 shared publications Houpeng Wang
Key Laboratory of Space Utilization, Technology and Engineering Center for Space Utilization, Chinese Academy of Sciences, Beijing, China
2 shared publications- Houpeng Wang
China University of Chinese Academy of Sciences, China
2 shared publications Lei Yan
2 shared publications
Latest Publications
- 25 September 2026
- Published by Elsevier in Computer Communications
- Vol. 260
Joint buffer admission and contact-window-aware scheduling for heterogeneous traffic in cislunar DTNs
- 25 September 2026
- Published by Elsevier in Computer Communications
- Vol. 260
Joint buffer admission and contact-window-aware scheduling for heterogeneous traffic in cislunar DTNs
- Open Access
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Selected Areas in Sensors
- Vol. 3, 411-424
Active Inference-Enhanced DRL for UAV and Integrated Sensing, Communication, and Computing Enabled Metaverse Systems
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Selected Areas in Sensors
- Vol. 3, 411-424
Open AccessActive Inference-Enhanced DRL for UAV and Integrated Sensing, Communication, and Computing Enabled Metaverse Systems
- Open Access
- 14 September 2024
- Published by Elsevier in Computer Networks
- Vol. 254
Multi-objective joint optimization of task offloading based on MADRL in internet of things assisted by satellite networks
- 14 September 2024
- Published by Elsevier in Computer Networks
- Vol. 254
Open AccessMulti-objective joint optimization of task offloading based on MADRL in internet of things assisted by satellite networks
- 1 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in China Communications
- Vol. 21 (5) , 280-296
MTCR-CR routing strategy for connection-oriented routing over satellite networks
The high-speed movement of satellites makes it not feasible to directly apply the mature routing scheme on the ground to the satellite network. DT-DVTR in the snapshot-based connection-oriented routing strategy is one of the representative solutions, but it still has room for improvement in terms of routing stability. In this paper, we propose an improved scheme for connection-oriented routing strategy named the Minimal Topology Change Routing based on Collaborative Rules (MTCR-CR). The MTCR-CR uses continuous time static topology snapshots based on satellite status to search for intersatellite link(ISL) construction solutions that meet the minimum number of topology changes to avoid route oscillations. The simulation results in Beidou-3 show that compared with DT-DVTR, MTCR-CR reduces the number of routing changes by about 92%, the number of path changes caused by routing changes is about 38%, and the rerouting time is reduced by approximately 47%. At the same time, in order to show our algorithm more comprehensively, the same experimental index test was also carried out on the Globalstar satellite constellation.
- 1 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in China Communications
- Vol. 21 (5) , 280-296
MTCR-CR routing strategy for connection-oriented routing over satellite networks
The high-speed movement of satellites makes it not feasible to directly apply the mature routing scheme on the ground to the satellite network. DT-DVTR in the snapshot-based connection-oriented routing strategy is one of the representative solutions, but it still has room for improvement in terms of routing stability. In this paper, we propose an improved scheme for connection-oriented routing strategy named the Minimal Topology Change Routing based on Collaborative Rules (MTCR-CR). The MTCR-CR uses continuous time static topology snapshots based on satellite status to search for intersatellite link(ISL) construction solutions that meet the minimum number of topology changes to avoid route oscillations. The simulation results in Beidou-3 show that compared with DT-DVTR, MTCR-CR reduces the number of routing changes by about 92%, the number of path changes caused by routing changes is about 38%, and the rerouting time is reduced by approximately 47%. At the same time, in order to show our algorithm more comprehensively, the same experimental index test was also carried out on the Globalstar satellite constellation.
- Open Access
- 15 December 2023
- Published by Association for Computing Machinery (ACM)
- p. 22-31
An Improved Minimum Hop Count Routing for LEO Mega-Constellations
As the key technology of the sixth generation (6G) mobile communication network, low Earth orbit (LEO) satellites have the characteristics of low cost and low propagation delay. The new generation of LEO Mega-Constellations equipped with inter-satellite laser links (ISLL or ISL) can provide global High-speed network, and it can complement each other with the terrestrial network, thus facilitating the realization of the space-air-ground integrated network. Due to the large number of satellites in the LEO Mega-Constellations, the traditional centralized satellite routing algorithm is no longer suitable, so most of the LEO Mega-Constellations use distributed Minimum Hop Count Routing (MHCR) algorithm. In this paper, we propose an Improved Minimum Hop Count Routing (IMHCR) algorithm for LEO Mega-Constellations, which is based on the optimized LEO Mega-Constellations Network topology. NS2 simulation results show that compared with the MHCR, the proposed IMHCR algorithm can effectively reduce the number of hop and delay in the routing process.
- 15 December 2023
- Published by Association for Computing Machinery (ACM)
- p. 22-31
Open AccessAn Improved Minimum Hop Count Routing for LEO Mega-Constellations
As the key technology of the sixth generation (6G) mobile communication network, low Earth orbit (LEO) satellites have the characteristics of low cost and low propagation delay. The new generation of LEO Mega-Constellations equipped with inter-satellite laser links (ISLL or ISL) can provide global High-speed network, and it can complement each other with the terrestrial network, thus facilitating the realization of the space-air-ground integrated network. Due to the large number of satellites in the LEO Mega-Constellations, the traditional centralized satellite routing algorithm is no longer suitable, so most of the LEO Mega-Constellations use distributed Minimum Hop Count Routing (MHCR) algorithm. In this paper, we propose an Improved Minimum Hop Count Routing (IMHCR) algorithm for LEO Mega-Constellations, which is based on the optimized LEO Mega-Constellations Network topology. NS2 simulation results show that compared with the MHCR, the proposed IMHCR algorithm can effectively reduce the number of hop and delay in the routing process.
- Open Access
- 15 December 2023
- Published by Association for Computing Machinery (ACM)
- p. 91-98
Task Offloading Strategy in Satellite Edge Computing Based on Matching Game
The Low Earth Orbit (LEO) satellite network, serving as a vital complement to the terrestrial backbone network, has emerged as a prospective path for future mobile communication systems, owing to its extensive coverage. In this paper, a three-tier computing architecture catering for application scenarios where ground terminal has limited resources and elevated quality of service (QoS) requisites is presented. The proposed design features vertical collaboration among ground users, LEO satellites, and remote cloud servers, providing collaborative computing task offloading capabilities. We consider the delay and energy consumption of the system, formulated the offloading decision problem as a nonlinear integer programming problem, and then introduced an offloading mechanism that utilizes an improved version of the Gale-Shapley (GS) algorithm and non-cooperative game theory (MGSCO) to approximate the optimal solution under specified constraints. The outcomes of simulations indicate that this strategy can significantly mitigate system delays and energy consumption, in contrast to reference strategies.
- 15 December 2023
- Published by Association for Computing Machinery (ACM)
- p. 91-98
Open AccessTask Offloading Strategy in Satellite Edge Computing Based on Matching Game
The Low Earth Orbit (LEO) satellite network, serving as a vital complement to the terrestrial backbone network, has emerged as a prospective path for future mobile communication systems, owing to its extensive coverage. In this paper, a three-tier computing architecture catering for application scenarios where ground terminal has limited resources and elevated quality of service (QoS) requisites is presented. The proposed design features vertical collaboration among ground users, LEO satellites, and remote cloud servers, providing collaborative computing task offloading capabilities. We consider the delay and energy consumption of the system, formulated the offloading decision problem as a nonlinear integer programming problem, and then introduced an offloading mechanism that utilizes an improved version of the Gale-Shapley (GS) algorithm and non-cooperative game theory (MGSCO) to approximate the optimal solution under specified constraints. The outcomes of simulations indicate that this strategy can significantly mitigate system delays and energy consumption, in contrast to reference strategies.
- Open Access
DNFS-VNE: Deep Neuro Fuzzy System Driven Virtual Network Embedding
By decoupling substrate resources, network virtualization (NV) is a promising solution for meeting diverse demands and ensuring differentiated quality of service (QoS). In particular, virtual network embedding (VNE) is a critical enabling technology that enhances the flexibility and scalability of network deployment by addressing the coupling of Internet processes and services. However, in the existing works, the black-box nature of deep neural networks (DNNs) limits the analysis, development, and improvement of systems. In recent times, interpretable deep learning (DL) represented by deep neuro-fuzzy systems (DNFS) combined with fuzzy inference has shown promising interpretability to further exploit the hidden value in the data. Motivated by this, we propose a DNFS-based VNE algorithm that aims to provide an interpretable NV scheme. Specifically, data-driven convolutional neural networks (CNNs) are used as fuzzy implication operators to compute the embedding probabilities of candidate substrate nodes through entailment operations. And, the identified fuzzy rule patterns are cached into the weights by forward computation and gradient back-propagation (BP). Moreover, the fuzzy rule base is constructed based on Mamdani-type linguistic rules using linguistic labels. In addition, the DNFS-driven five-block structure-based policy network serves as the agent for deep reinforcement learning (DRL), which optimizes VNE decision-making through interaction with the environment. Finally, the effectiveness of evaluation indicators and fuzzy rules is verified by experiments.
Open AccessDNFS-VNE: Deep Neuro Fuzzy System Driven Virtual Network Embedding
By decoupling substrate resources, network virtualization (NV) is a promising solution for meeting diverse demands and ensuring differentiated quality of service (QoS). In particular, virtual network embedding (VNE) is a critical enabling technology that enhances the flexibility and scalability of network deployment by addressing the coupling of Internet processes and services. However, in the existing works, the black-box nature of deep neural networks (DNNs) limits the analysis, development, and improvement of systems. In recent times, interpretable deep learning (DL) represented by deep neuro-fuzzy systems (DNFS) combined with fuzzy inference has shown promising interpretability to further exploit the hidden value in the data. Motivated by this, we propose a DNFS-based VNE algorithm that aims to provide an interpretable NV scheme. Specifically, data-driven convolutional neural networks (CNNs) are used as fuzzy implication operators to compute the embedding probabilities of candidate substrate nodes through entailment operations. And, the identified fuzzy rule patterns are cached into the weights by forward computation and gradient back-propagation (BP). Moreover, the fuzzy rule base is constructed based on Mamdani-type linguistic rules using linguistic labels. In addition, the DNFS-driven five-block structure-based policy network serves as the agent for deep reinforcement learning (DRL), which optimizes VNE decision-making through interaction with the environment. Finally, the effectiveness of evaluation indicators and fuzzy rules is verified by experiments.
- Top Cited Papers
- 31 May 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 9 (1) , 695-705
Service Coverage for Satellite Edge Computing
Recently, increasing investments in satellite-related technologies make the low earth orbit (LEO) satellite constellation a strong complement to terrestrial networks. To mitigate the limitations of the traditional satellite constellation “bent-pipe” architecture, satellite edge computing (SEC) has been proposed by placing computing resources at the LEO satellite constellation. Most existing works focus on space-air-ground integrated network architecture and SEC computing framework. Beyond these works, we are the first to investigate how to efficiently deploy services on the SEC nodes to realize robustness aware service coverage with constrained resources. Facing the challenges of spatial-temporal system dynamics and service coverage-robustness conflict, we propose a novel online service placement algorithm with a theoretical performance guarantee by leveraging Lyapunov optimization and Gibbs sampling. Extensive simulation results show that our algorithm can improve the service coverage by $4.3\times $ compared with the baseline.
- 31 May 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 9 (1) , 695-705
Top Cited PapersService Coverage for Satellite Edge Computing
Recently, increasing investments in satellite-related technologies make the low earth orbit (LEO) satellite constellation a strong complement to terrestrial networks. To mitigate the limitations of the traditional satellite constellation “bent-pipe” architecture, satellite edge computing (SEC) has been proposed by placing computing resources at the LEO satellite constellation. Most existing works focus on space-air-ground integrated network architecture and SEC computing framework. Beyond these works, we are the first to investigate how to efficiently deploy services on the SEC nodes to realize robustness aware service coverage with constrained resources. Facing the challenges of spatial-temporal system dynamics and service coverage-robustness conflict, we propose a novel online service placement algorithm with a theoretical performance guarantee by leveraging Lyapunov optimization and Gibbs sampling. Extensive simulation results show that our algorithm can improve the service coverage by $4.3\times $ compared with the baseline.
- Open Access
- 30 March 2020
- Published by Springer Nature in EURASIP Journal on Wireless Communications and Networking
- Vol. 2020 (1) , 1-8
Deep learning-based computation offloading with energy and performance optimization
With the benefit of partially or entirely offloading computations to a nearby server, mobile edge computing gives user equipment (UE) more powerful capability to run computationally intensive applications. However, a critical challenge emerged: how to select the optimal set of components to offload considering the UE performance as well as its battery usage constraints. In this paper, we propose a novel energy and performance efficient deep learning based offloading algorithm. The optimal offloading schemes of components based on remaining energy and its performance can be determined by our proposed algorithm. All of these considerations are modeled as a cost function; then, a deep learning network is trained to compute the solution by which the optimal offloading scheme can be determined. Experimental results show that the proposed method is superior to existing methods in terms of energy and performance constraints.
- 30 March 2020
- Published by Springer Nature in EURASIP Journal on Wireless Communications and Networking
- Vol. 2020 (1) , 1-8
Open AccessDeep learning-based computation offloading with energy and performance optimization
With the benefit of partially or entirely offloading computations to a nearby server, mobile edge computing gives user equipment (UE) more powerful capability to run computationally intensive applications. However, a critical challenge emerged: how to select the optimal set of components to offload considering the UE performance as well as its battery usage constraints. In this paper, we propose a novel energy and performance efficient deep learning based offloading algorithm. The optimal offloading schemes of components based on remaining energy and its performance can be determined by our proposed algorithm. All of these considerations are modeled as a cost function; then, a deep learning network is trained to compute the solution by which the optimal offloading scheme can be determined. Experimental results show that the proposed method is superior to existing methods in terms of energy and performance constraints.
- 9 January 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Journal of Lightwave Technology
- Vol. 38 (8) , 2106-2113
A Routing and Wavelength Assignment Algorithm Based on Two Types of LEO Constellations in Optical Satellite Networks
Research on LEO inter-satellite laser communication based on wavelength division multiplexing inter-satellite links and its routing and wavelength assignment (RWA) technology is an important way to solve the problem of low-latency, high-capacity, high-speed transmission, and low-cost on-orbit real-time routing of free-space optical communications. Since both the transmitting and receiving sides of the inter-satellite communication are high-speed moving satellites, the network topology in the whole inter-satellite communication process is time-varying. Therefore, based on this particularity, we proposed the SpacePro constellation and combined the classical NeLS constellation for mathematical modeling, and the network topology and inter-satellite links were predicted and analyzed in their entire cycles. The RWA under the super satellite nodes with computation and storage functions algorithm (SCSA) was proposed and its effect was compared and analyzed in the wavelength resource requirement and connectivity. The results showed that the SCSA algorithm can save up to 50% in wavelength requirements, and the SpacePro constellation can achieve the same network connectivity effect with fewer on-board processors and wavelengths than NeLS. Satellite optical network node connectivity and wavelength demand were a trade-off problem. Studying the RWA problem in this scenario has a very critical reference for how the future satellite optical network performs wavelength usage configuration to help improve the performance of networks.
- 9 January 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Journal of Lightwave Technology
- Vol. 38 (8) , 2106-2113
A Routing and Wavelength Assignment Algorithm Based on Two Types of LEO Constellations in Optical Satellite Networks
Research on LEO inter-satellite laser communication based on wavelength division multiplexing inter-satellite links and its routing and wavelength assignment (RWA) technology is an important way to solve the problem of low-latency, high-capacity, high-speed transmission, and low-cost on-orbit real-time routing of free-space optical communications. Since both the transmitting and receiving sides of the inter-satellite communication are high-speed moving satellites, the network topology in the whole inter-satellite communication process is time-varying. Therefore, based on this particularity, we proposed the SpacePro constellation and combined the classical NeLS constellation for mathematical modeling, and the network topology and inter-satellite links were predicted and analyzed in their entire cycles. The RWA under the super satellite nodes with computation and storage functions algorithm (SCSA) was proposed and its effect was compared and analyzed in the wavelength resource requirement and connectivity. The results showed that the SCSA algorithm can save up to 50% in wavelength requirements, and the SpacePro constellation can achieve the same network connectivity effect with fewer on-board processors and wavelengths than NeLS. Satellite optical network node connectivity and wavelength demand were a trade-off problem. Studying the RWA problem in this scenario has a very critical reference for how the future satellite optical network performs wavelength usage configuration to help improve the performance of networks.