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

Xiujuan Wu

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

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

Computer networks · 2 · 2 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
2 papers
Internet of things and sensor networks · 29% Network performance modeling · 29% Routing and switching · 25%

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

TopicWeightPapersLastEvidence papers
Network performance modeling
network reliability
1.012026
Enhancing Network Reliability in UASNs: A Collision-Aware Critical Node Identification Algorithm · IEEE Trans. Mob. Comput. 2026
Internet of things and sensor networks › underwater sensor networks
underwater acoustic sensor networks
1.012026
Enhancing Network Reliability in UASNs: A Collision-Aware Critical Node Identification Algorithm · IEEE Trans. Mob. Comput. 2026
Routing and switching › fault-tolerant routing
reliable routing
0.912025
A High Reliable Routing Protocol Based on Spatial-Temporal Graph Model for Multiple Unmanned Underwater Vehicles Network · IEEE Trans. Mob. Comput. 2025
Wireless networking
packet collision
0.312026
Enhancing Network Reliability in UASNs: A Collision-Aware Critical Node Identification Algorithm · IEEE Trans. Mob. Comput. 2026

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

topological connectivity model · 1.0network load model · 1.0collision probability model · 1.0spatial-temporal graph model · 0.9q-learning · 0.9
YearPublicationVenuePosition
2026 Enhancing Network Reliability in UASNs: A Collision-Aware Critical Node Identification Algorithm
abstract
Critical node identification is essential for Underwater Acoustic Sensor Networks (UASNs) to ensure network connectivity and reliability. Existing methods identify critical nodes by evaluating their contributions to network connectivity and node communication count. However, these methods identify critical nodes inaccurately due to neglecting the influence of packet collisions, leading to unreliable network. Packet collisions disrupt connected links and cause communication failures, resulting in unreliable network connectivity and improper communication count. To this end, we propose the Collision-Aware Critical Node Identification Algorithm (CCNIA), which accounts for the impact of packet collisions to improve the accuracy of critical node identification and enhance network reliability. CCNIA identifies critical nodes with high connectivity, large collision probability, and heavy network load, through building the three following interdependent models. Specifically, Topological Connectivity Model (TCM) evaluates link reachability by analyzing connectivity and density within a node's local network. Based on TCM, Collision Probability Model (CPM) further ensures packet reliability by quantifying the impact of packet collisions on critical node identification. Through CPM's reliable packet transmissions, Network Load Model (NLM) assesses network efficiency by analyzing node occurrence count within global end-to-end communication paths. Experiments show that CCNIA outperforms existing methods across diverse network configurations, enhancing network reliability in terms of packet delivery ratio, delay, and energy efficiency.
Xiujuan Wu, Cangzhu Xu, Miao Pan, Guangjie Han
IEEE Trans. Mob. Comput.2
2025 A High Reliable Routing Protocol Based on Spatial-Temporal Graph Model for Multiple Unmanned Underwater Vehicles Network
abstract
Increasing demands for versatile applications have spurred the rapid development of Unmanned Underwater Vehicle (UUV) networks. Nevertheless, multi-UUV movements exacerbates the spatial-temporal variability, leading to serious intermittent connectivity of underwater acoustic channel. Such phenomena challenge the identification of reliable paths for high-dynamic network routing. Existing routing protocols overlook the effects of UUV movements on forwarding path, typically selecting forwarders based solely on the current network state, which lead to instability in packet transmission. To address these challenges, we propose a Routing protocol based on Spatial-Temporal Graph model with Q-learning for multi-UUV networks (STGR), achieving high reliable and energy effective transmission. Specifically, a distributed Spatial-Temporal Graph model (STG) is proposed to depict the evolving variation characteristics (neighbor relationships, link quality, and connectivity duration) among underwater nodes over periodic intervals. Then we design a Q-learning-based forwarder selection algorithm integrated with STG to calculate reward function, ensuring adaptability to the ever-changing conditions. We have performed extensive simulations of STGR on the Aqua-Sim-tg platform and compared with the state-of-the-art routing protocols in terms of Packet Delivery Rate (PDR), latency, energy consumption and energy balance with different network settings. The results show that STGR yields 24.32 percent higher PDR on average than them in multi-UUV networks.
Cangzhu Xu, Xiujuan Wu, Guangjie Han, Miao Pan, Gaochao Xu, Jun-Hong Cui
IEEE Trans. Mob. Comput.3