Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Zhenrui Cao

dblp:350/6016 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
4since 2021 · last 2026
—ORCID · conflict

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

Computer networks · 3 · 2 first-author · 3 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Embedded and real-time systems · 68% Cloud and datacenter computing · 32%
Artificial intelligence
1 paper
Reinforcement learning · 100%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing › datacenter network
flow scheduling
1.922026
Contrastive Imitation Learning-Based Scheduling Toward Deterministic Coordination of Parallel Flows in TSN-Enabled IIoT · IEEE Trans. Netw. 2026
Adaptive Flow Scheduling for Teleoperation: A Communication and Control Co-Optimization Framework Over Time-Sensitive Networks · IEEE J. Sel. Areas Commun. 2025
Embedded and real-time systems › real-time communication › real-time networks
time-sensitive networking
1.922026
Contrastive Imitation Learning-Based Scheduling Toward Deterministic Coordination of Parallel Flows in TSN-Enabled IIoT · IEEE Trans. Netw. 2026
Adaptive Flow Scheduling for Teleoperation: A Communication and Control Co-Optimization Framework Over Time-Sensitive Networks · IEEE J. Sel. Areas Commun. 2025
Embedded and real-time systems
real-time scheduling
1.012026
Contrastive Imitation Learning-Based Scheduling Toward Deterministic Coordination of Parallel Flows in TSN-Enabled IIoT · IEEE Trans. Netw. 2026
Machine learning › Reinforcement learning
imitation learning
0.312026
Contrastive Imitation Learning-Based Scheduling Toward Deterministic Coordination of Parallel Flows in TSN-Enabled IIoT · IEEE Trans. Netw. 2026
Embedded and real-time systems
industrial control systems
0.312025
Adaptive Flow Scheduling for Teleoperation: A Communication and Control Co-Optimization Framework Over Time-Sensitive Networks · IEEE J. Sel. Areas Commun. 2025

Methods — techniques the papers use, named apart from their topics

reinforcement learning · 2.0contrastive imitation learning · 2.0feature extraction · 0.9deep reinforcement learning · 0.9
YearPublicationVenuePosition
2026 Contrastive Imitation Learning-Based Scheduling Toward Deterministic Coordination of Parallel Flows in TSN-Enabled IIoT
Zhenrui Cao, Tie Qiu 0001, Xiaobo Zhou 0003, Min Huang 0001, Xingwei Wang 0001
IEEE Trans. Netw.1
2025 A Message Expansion Method Driven by Device Interaction for Industrial Protocol Understanding
abstract
In the Industrial Internet of Things (IIoT), Protocol Reverse Engineering (PRE) is a technique that analyzes protocol message samples to facilitate the understanding of unknown protocol specifications, enabling intercommunication between heterogeneous devices using industrial control protocols (ICPs). However, capturing message samples from the IloT environment is time-consuming, and the collected samples may lack sufficient diversity to comprehensively cover the protocol specifications, thereby affecting PRE's effectiveness in understanding protocol specifications. To address this limitation, we propose a message expansion method driven by device interaction to efficiently generate message samples that offer comprehensive feature coverage, ultimately enhancing the protocol understanding. Our approach operates in two stages. During the exploration stage, it modifies the initial input messages captured from the network and, through interactions with the device, determines which fields should be excluded from further exploration, thereby narrowing the exploration space. In the expansion stage, we design a neighborhood particle swarm optimization (NPSO) algorithm to thoroughly explore the remaining search space, generating diverse messages and validating them through interaction with the device to comprehensively cover the protocol's structure and functionality. Experimental results show that our method surpasses existing algorithms in both message generation speed and message quality.
Zhenrui Cao, Xiaobo Zhou 0003, Songwei Zhang, Tie Qiu 0001
CSCWD2
2025 A Fine-Grained Resource Allocation Strategy for Industrial TSN-5G Networks
Zhenrui Cao, Fang Cui, Xiaobo Zhou 0003, Tie Qiu 0001
WASA (3)2
2025 Adaptive Flow Scheduling for Teleoperation: A Communication and Control Co-Optimization Framework Over Time-Sensitive Networks
abstract
Time-Sensitive Networking (TSN), renowned for its deterministic properties, has become a pivotal technology under-pinning real-time industrial control in Cyber-Physical Systems. Existing research emphasizes enhancing the transmission services of TSN networks for control applications by improving flow schedulability and minimizing end-to-end delay. However, these studies abstract the performance requirements of control applications into rigid, impractical constraints for flow scheduling, disrupting the connection between control optimization and transmission enhancement, and eventually undermining genuine progress in industrial control. Within a co-optimization framework of communication and control, this paper proposes AFS-RT, an Adaptive TSN Flow Scheduling method for Robotic arm Teleoperation, a representative industrial control application. Specifically, through a comprehensive analysis of the teleoperation case, we first integrate slot allocation-based flow scheduling with remote control to formulate a control-driven co-optimization model. To tackle the complexities arising from the implicit mapping between communication and control, we augment the Deep Reinforcement Learning agent responsible for slot allocation with slot-correlation-guided feature extraction, improving feature comprehension by leveraging inherent correlations between slots and thereby boosting the agent’s decision-making capabilities. Extensive testbed and simulation experiments demonstrate that AFS-RT significantly improves teleoperation performance under diverse network conditions compared to SOTA algorithms.
Zhenrui Cao, Tie Qiu 0001, Xiaobo Zhou 0003, Min Huang 0001, Dapeng Lan, Xingwei Wang 0001
IEEE J. Sel. Areas Commun.1