Chengwei Zhang
Chengwei Zhang has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Yun Wang
School of Computer Science and Engineering, Southeast University, Nanjing 211189, China
2 shared publications - Jiali Zhu
Nanjing Marine Radar Research Institute, Nanjing 210000, China
1 shared publication - Ning Zhang
Nanjing Marine Radar Research Institute, Nanjing 210000, China
1 shared publication - Weiwei Qi
School of Computer Science and Engineering, Southeast University, Nanjing 211189, China
1 shared publication - Yang Yang
Nanjing Marine Radar Research Institute, Nanjing 210000, China
1 shared publication
Latest Publications
- Open Access
Joint Access Authentication and Task Collaboration for Dynamic Cross-Domain Resource Management in Satellite Networks
Low Earth Orbit (LEO) satellite systems provide wide-area Earth coverage and constitute an important component of the integrated space–air–ground network. With the increasing demand for near-data real-time task processing at the near-data end, constructing a reliable resource management solution is crucial to guaranteeing efficient task execution. Considering the frequent networking due to high-speed movement, unbalanced dynamic task allocation, and unknown resource requirements, we propose a hierarchical dynamic cross-domain collaborative resource management architecture considering satellite access. To enable low-cost access authentication over narrowband inter-satellite links, this work proposes a non-interactive privacy-preserving authentication scheme. Each satellite aggregates four committed orbital attributes into one compact proof, which can be verified by multiple authorized satellites within a domain and epoch. Concurrent access requests are handled via verifier-side batch verification of independent proofs. Additionally, considering the imbalance and dynamics of satellite task allocation, a hierarchical resource management scheme combining multi-agent reinforcement learning intra-domain resource allocation and inter-domain early-exit matching game task collaboration is proposed to alleviate the differences in inter-domain task allocation and enable efficient task execution under limited satellite resources. Simulation results show that the proposed scheme has lower overall communication overhead and an improved task completion rate in dynamic scenarios.
Open AccessJoint Access Authentication and Task Collaboration for Dynamic Cross-Domain Resource Management in Satellite Networks
Low Earth Orbit (LEO) satellite systems provide wide-area Earth coverage and constitute an important component of the integrated space–air–ground network. With the increasing demand for near-data real-time task processing at the near-data end, constructing a reliable resource management solution is crucial to guaranteeing efficient task execution. Considering the frequent networking due to high-speed movement, unbalanced dynamic task allocation, and unknown resource requirements, we propose a hierarchical dynamic cross-domain collaborative resource management architecture considering satellite access. To enable low-cost access authentication over narrowband inter-satellite links, this work proposes a non-interactive privacy-preserving authentication scheme. Each satellite aggregates four committed orbital attributes into one compact proof, which can be verified by multiple authorized satellites within a domain and epoch. Concurrent access requests are handled via verifier-side batch verification of independent proofs. Additionally, considering the imbalance and dynamics of satellite task allocation, a hierarchical resource management scheme combining multi-agent reinforcement learning intra-domain resource allocation and inter-domain early-exit matching game task collaboration is proposed to alleviate the differences in inter-domain task allocation and enable efficient task execution under limited satellite resources. Simulation results show that the proposed scheme has lower overall communication overhead and an improved task completion rate in dynamic scenarios.
- Open Access
- 22 July 2025
- Published by MDPI AG in Future Internet
- Vol. 17 (8) , 321
Scalable and Efficient GCL Scheduling for Time-Aware Shaping in Autonomous and Cyber-Physical Systems
The evolution of the internet towards supporting time-critical applications, such as industrial cyber-physical systems (CPSs) and autonomous systems, has created an urgent demand for networks capable of providing deterministic, low-latency communication. Autonomous vehicles represent a particularly challenging use case within this domain, requiring both reliability and determinism for massive data streams—a requirement that traditional Ethernet technologies cannot satisfy. This paper addresses this critical gap by proposing a comprehensive scheduling framework based on Time-Aware Shaping (TAS) within the Time-Sensitive Networking (TSN) standard. The framework features two key contributions: (1) a novel baseline scheduling algorithm that incorporates a sub-flow division mechanism to enhance schedulability for high-bandwidth streams, computing Gate Control Lists (GCLs) via an iterative SMT-based method; (2) a separate heuristic-based computation acceleration algorithm to enable fast, scalable GCL generation for large-scale networks. Through extensive simulations, the proposed baseline algorithm demonstrates a reduction in end-to-end latency of up to 59% compared to standard methods, with jitter controlled at the nanosecond level. The acceleration algorithm is shown to compute schedules for 200 data streams in approximately one second. The framework’s effectiveness is further validated on a real-world TSN hardware testbed, confirming its capability to achieve deterministic transmission with low latency and jitter in a physical environment. This work provides a practical and scalable solution for deploying deterministic communication in complex autonomous and cyber-physical systems.
- 22 July 2025
- Published by MDPI AG in Future Internet
- Vol. 17 (8) , 321
Open AccessScalable and Efficient GCL Scheduling for Time-Aware Shaping in Autonomous and Cyber-Physical Systems
The evolution of the internet towards supporting time-critical applications, such as industrial cyber-physical systems (CPSs) and autonomous systems, has created an urgent demand for networks capable of providing deterministic, low-latency communication. Autonomous vehicles represent a particularly challenging use case within this domain, requiring both reliability and determinism for massive data streams—a requirement that traditional Ethernet technologies cannot satisfy. This paper addresses this critical gap by proposing a comprehensive scheduling framework based on Time-Aware Shaping (TAS) within the Time-Sensitive Networking (TSN) standard. The framework features two key contributions: (1) a novel baseline scheduling algorithm that incorporates a sub-flow division mechanism to enhance schedulability for high-bandwidth streams, computing Gate Control Lists (GCLs) via an iterative SMT-based method; (2) a separate heuristic-based computation acceleration algorithm to enable fast, scalable GCL generation for large-scale networks. Through extensive simulations, the proposed baseline algorithm demonstrates a reduction in end-to-end latency of up to 59% compared to standard methods, with jitter controlled at the nanosecond level. The acceleration algorithm is shown to compute schedules for 200 data streams in approximately one second. The framework’s effectiveness is further validated on a real-world TSN hardware testbed, confirming its capability to achieve deterministic transmission with low latency and jitter in a physical environment. This work provides a practical and scalable solution for deploying deterministic communication in complex autonomous and cyber-physical systems.