Du Xu

Du Xu

Auto-generated profile, based on publicly available information

Du Xu

University of Electronic Science and Technology of China, Chengdu, Sichuan, China

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
20 July 2019 in Peer-to-Peer Networking and Applications
Verified
Journal Article
Closed access
PDF file
HLHui Li
Hui Li
LPLishuang Pei
Lishuang Pei
DLDan Liao
Dan Liao
GSGang Sun
Gang Sun
DXDu Xu
Du Xu

13 December 2023 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
CWCaihong Wang
Caihong Wang
DXDu Xu
Du Xu
ZLZonghang Li
Zonghang Li
DNDusit Niyato
Dusit Niyato
Since the advent of the Internet of Things (IoT), exchanging vast amounts of information has increased the number of security threats in networks. As a result, intrusion detection based on deep learning (DL) has been developed to achieve high throughput and high precision. Unlike general DL-based scenarios, IoT networks contain benign traffic far more than abnormal traffic, with some rare attacks. However, most existing studies have been focused on sacrificing the detection rate of the majority class in order to improve the detection rate of the minority class in class-imbalanced IoT networks. Although this way can reduce the false negative rate of minority classes, it both wastes resources and reduces the credibility of the intrusion detection systems. To address this issue, we propose a lightweight framework named S2CGAN- acrshort IDS. The proposed framework leverages the distribution characteristics of network traffic to expand the number of minority categories in both data space and feature space, resulting in a substantial increase in the detection rate of minority categories while simultaneously ensuring the detection precision of majority categories. To reduce the impact of sparsity on the experiments, the CICIDS2017 numeric data set is utilized to demonstrate the effectiveness of the proposed method. The experimental results indicate that our proposed approach outperforms the superior method in both Precision and Recall, particularly with a 10.2% improvement in the F1-score.

21 June 2023 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
XMXuyang Ma
Xuyang Ma
DXDu Xu
Du Xu
Federated learning has received considerable attention because it allows multiple devices to train models locally without revealing sensitive data. Well-trained local models are transmitted to a parameter server for further aggregation. The dependence on a trusted central server makes federated learning vulnerable to the single point of failure or attack. Blockchain is regarded as a state-of-the-art solution to decentralize the central server and provide attractive features simultaneously, such as immutability, traceability and accountability. However, current popular blockchain systems cannot be combined with federated learning seamlessly. Since all local models should be collected before aggregation, the latency of federated learning is determined by the slowest device. The consensus process required by blockchain will increase the latency further especially when a large block is required for including the model. Moreover, forever-growing blockchain together with models will take up a lot of storage space, making it impractical to be deployed on lightweight devices. To address these problems, we propose a lightweight blockchain TORR for federated learning. A novel consensus protocol Proof of Reliability is designed to achieve fast consensus while mitigating the impact of stragglers. A storage protocol is designed based on erasure coding and periodic storage refreshing policy. With erasure coding we take full advantage of the limited storage space of devices. With periodic storage refreshing policy we reduce the requirement for storage. Compared to the common blockchain-based federated learning system, TORR reduces the system latency, overall storage overhead and peak storage overhead by up to 62%, 75.44% and 51.77%, respectively.

27 February 2024 in Information Sciences
Verified
Journal Article
Closed access
XMXuyang Ma
Xuyang Ma
DXDu Xu
Du Xu
KWKatinka Wolter
Katinka Wolter

1 January 2007
Verified
Conference Paper
Closed access
TZTao Zhong
Tao Zhong
SWSheng Wang
Sheng Wang
SXShizhong Xu
Shizhong Xu
HYHongfang Yu
Hongfang Yu
DXDu Xu
Du Xu
In this paper we present a novel efficient energy-aware approach for clustering nodes in wireless sensor networks. We use different cluster head (CH) declaration delays for each node to characterize the qualification to be a CH. The approach guarantees the fairly uniform cluster distribution while incurring low overheads. Additionally, we do not make any assumptions about the distribution or node capabilities, e.g., location-awareness. The simulation results show that our clustering approach outperforms LEACH both in cluster characteristics and in the efficiency of prolonging the network lifetime.

8 June 2007 in ETRI Journal
Verified
Journal Article
Open access
PDF file
HWHong Wang
Hong Wang
DXDu Xu
Du Xu
LLLemin Li
Lemin Li
GWG Wang
G Wang
A globally adaptive load-balanced routing algorithm for torus interconnection networks is proposed. Unlike previously published algorithms, this algorithm employs a new scheme based on collision detection to handle deadlock, and has higher routing adaptability than previous algorithms. Simulation results show that our algorithm outperforms previous algorithms by 16% on benign traffic patterns, and by 10% to 21% on adversarial traffic patterns.