Xiaoyu Du 0001

dblp:145/4226-1 · DBLP profile ↗
← Back
8ranked-venue papers
3as first author
8since 2021 · last 2026
0000-0001-7314-7642ORCID · conflict

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

Systems, architecture and hardware · 5 · 1 first-author · 5 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Computer networks · 1 · 1 first-author · 1 since 2021Security and privacy · 1 · 1 first-author · 1 since 2021
YearPublicationVenuePosition
2026 Industrial Internet of Things intrusion detection based on a hybrid model of Pearson-Deep Neural Network And Transformer
Aosheng Ning, Roshan Kumar, Xiaoyu Du 0001
Eng. Appl. Artif. Intell.5
2026 Blockchain-integrated storage and forwarding system
Zhijie Han 0001, Xingbo Xie, Xiaoyu Du 0001, Xin He 0021
Future Gener. Comput. Syst.3
2025 Loss-Guided Dynamic Step Adversarial Attack Algorithm for Network Intrusion Detection Systems
abstract
ABSTRACT Deep Neural Networks (DNNs) have recently achieved remarkable success in the field of network security, and deep neural network‐based Intrusion Detection Systems (IDSs) are able to automatically learn potential patterns from network traffic and detect malicious traffic. However, IDSs are vulnerable to adversarial network traffic, which weakens their defense capabilities. Therefore, IDSs need high‐quality adversarial traffic for adversarial training to improve robustness. Existing adversarial sample generation algorithms are mainly focused on image‐based applications, overlooking the textual features of network traffic and inadequately considering perturbation magnitude. In response to these challenges, this paper proposes a Loss‐Guided Dynamic Step Adversarial Attack for Network Intrusion Detection Systems (LGDA) and a Discrete Adversarial Rounding (DAR) scheme. The LGDA analyzes model loss trend and dynamically adjusts perturbation step size to balance attack effectiveness and perturbation magnitude. The DAR targets discrete text features in network traffic, using integer encoding and rounding to allow partial preservation of perturbation direction, ensuring compatibility between existing adversarial attack algorithms and network traffic. Compared with state‐of‐the‐art adversarial attacks, experimental results on the NSL‐KDD, UNSW‐NB15, and CIC‐IDS2017 datasets using five models (LR, MLP, CNN, LSTM, and Transformer) show that the LGDA improves the attack success rate by 12.9% and reduces the perturbation magnitude by 19.1%. Additionally, the DAR scheme can be incorporated into any adversarial attack algorithm in the field of network security, increasing adversarial sample's attack success rate by 6.9%.
Haodong Zhao, Xiaoyu Du 0001, Roshan Kumar
Concurr. Comput. Pract. Exp.2
2025 Efficient privacy-preserving online medical pre-diagnosis based on blockchain
Sufang Zhou, Jianing Fan, Xiaoyu Du 0001, Chunfu Jia
J. Supercomput.4
2023 Hamiltonian properties of HCN and BCN networks
Xiaoyu Du 0001, Cheng Cheng 0005, Zhijie Han 0001, Weibei Fan
J. Supercomput.1
2022 A Lightweight Honeynet Design In the Internet of Things
abstract
With the wide use of Internet of Things(IoT) devices, security problems follow. To defend and analyze the security threats of IoT, honeypot and honeynet play an increasingly important role. Existing Honeynet management methods are not suitable for the management of simple IoT due to the high cost and complicated construction environment. This paper proposes a lightweight IoT Honeynet based on the MQTT. It manages the honeypot devices in the IoT network through a custom protocol. At the same time, the number of honeypots can be dynamically adjusted according to the current attacked state of the IoT network to save its resources, and the logs of the honeypots can also be collected by the honeynet as an important basis for analyzing hacker attacks. Finally, the experimental result proved the effectiveness of the proposed framework.
Xiaoyu Du 0001, Guanying Zhou, Song Tao
TrustCom1
2022 Topology analysis and routing algorithms design for PTNet network
abstract
Summary Data center network (DCN) is used for transmission, storage, and processing of big data, which plays an important role in cloud computing and CDN distribution. Network topology and routing algorithm are its core research content and key technical issues. The traditional network topology is difficult to guarantee the quality of service in scalability and fault tolerance. The server‐centric DCN topology can ensure the scale of the DCN by recursively increasing the number of network nodes and links. Relative to the Dcell, BCube, and BCCC typical network topology, PTNet network as a typical representative of a new type of the server‐centric DCN topology, which has more advantages in scalability, fault tolerance, and so on. The PTNet network topology is theoretically analyzed in terms of network diameter, bottleneck throughput, and total number of links in the network. Based on the deep research of PTNet network, this article analyzes and studies the network topology, multicast, and broadcast routing algorithm.
Zhijie Han 0001, Qingfang Zhang, Xiaoyu Du 0001, Kun Guo 0001, Mingshu He
Concurr. Comput. Pract. Exp.3
2022 ATS-LIA: A lightweight mutual authentication based on adaptive trust strategy in flying ad-hoc networks
Xiaoyu Du 0001, Yinyin Li, Sufang Zhou, Yi Zhou 0004
Peer-to-Peer Netw. Appl.1