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.

Zhenguo Bi

dblp:284/8592 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2025
—ORCID · conflict

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

Computer networks · 2 · 2 since 2021Systems, architecture and hardware · 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 networks
1 paper
Routing and switching · 39% Vehicular, aerial and satellite networks · 30% Wireless networking · 30%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Routing and switching › routing
hierarchical routing
0.712023
ELITE: An Intelligent Digital Twin-Based Hierarchical Routing Scheme for Softwarized Vehicular Networks · IEEE Trans. Mob. Comput. 2023
Wireless networking
relay selection
0.712023
ELITE: An Intelligent Digital Twin-Based Hierarchical Routing Scheme for Softwarized Vehicular Networks · IEEE Trans. Mob. Comput. 2023
Vehicular, aerial and satellite networks › vehicular networks
software-defined vehicular networks
0.712023
ELITE: An Intelligent Digital Twin-Based Hierarchical Routing Scheme for Softwarized Vehicular Networks · IEEE Trans. Mob. Comput. 2023

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

policy generation · 0.7multi-agent reinforcement learning · 0.7digital twin · 0.7
YearPublicationVenuePosition
2025 Occlusion-Aware Multi-Model ReID via Skeleton-Based Dynamic Inference
abstract
Person re-identification (Re-ID) is a fundamental service for AI-driven human centric computing and smart cities. Occlusion is one of the major challenges for the practical use of ReID. Existing work either use compute-intensive models or enhanced dataset to deal with occlusion. However, the single-model-driven works fail to find a reasonable balance between ReID accuracy and efficiency. To address this, we propose a Structured Occlusion Perception (SOP) framework based on multi-model collaboration. SOP first determines the occlusion level and then dynamically switches between lightweight and compute-intensive Re-ID models for Re-ID with light/heavy occlusion. SOP's occlusion decision extracts skeleton keypoints and calculates two weighted factors (spatial interaction and body part visibility) to distinguish occlusion levels, incurring little extra overhead. This design effectively reduces redundant computation while preserving recognition performance. Experiments on the DukeMTMC and Occluded-Duke datasets demonstrate that SOP reduces mAP by only 1.2 % and 1.5 %, respectively, while achieving computational saving of approximately 38.9 % and$\mathbf{4 1. 2 \%} \boldsymbol{.}$Furthermore, on the occlusion-labeled Occ-ReID dataset, SOP attains 84.8 % occlusion detection accuracy, demonstrating its effectiveness and robustness in cross-model inference and occlusion perception.
Bairong Liu, Zhenguo Bi
ICPADS2
2023 ELITE: An Intelligent Digital Twin-Based Hierarchical Routing Scheme for Softwarized Vehicular Networks
abstract
Software-Defined Vehicular Network (SDVN) is a networking architecture that can provide centralized control for vehicular networks. However, the design for routing policies in SDVNs is generally influenced by several limitations, such as frequent topological changes, complex service requests, and long model training time. Intelligent Digital Twin-based Software-Defined Vehicular Networks (IDT-SDVN) can overcome these weaknesses and maximize the advantages of the conventional SDVN architecture by enabling the controller to construct virtual network spaces and provide virtual instances of corresponding physical objects within the Digital Twin (DT). In this paper, we propose a junction-based hierarchical routing scheme in IDT-SDVN, namely, intelligent digital twin hierarchical (ELITE) routing. The proposed scheme is conducted in four phases: policy training and generation in the virtual network, and deployment and relay selection in physical networks. First, the policy learning phase employs several parallel agents in DT networks and derives multiple single-target policies. Second, the generation phase combines the learned policies and generates new policies based on complex communication requirements. Third, the deployment phase selects the most suitable generated policy according to the real-time network status and message types. A road path is calculated by the controller based on the selected policy and then sent to the requester vehicle. Finally, the relay selection phase is utilized to determine relay vehicles in a hop-by-hop process along the selected path. Simulation results demonstrate that ELITE achieves substantial improvements in terms of packet delivery ratio, end-to-end delay, and communication overhead compared with its counterparts.
Liang Zhao 0004, Zhenguo Bi, Ammar Hawbani, Keping Yu, Yan Zhang 0004, Mohsen Guizani
IEEE Trans. Mob. Comput.2
2021 An intelligent fuzzy-based routing scheme for software-defined vehicular networks
Liang Zhao 0004, Zhenguo Bi, Mingwei Lin, Ammar Hawbani, Yunchong Guan
Comput. Networks2