Lei Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Lei Chen has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Na Xia
Hefei University of Technology
7 shared publications - Sizhou Wei
School of Computer Science and Information Engineering, Hefei University of Technology, Hefei, China
5 shared publications - Meng Li
Hefei University of Technology, Hefei, China
3 shared publications - Xu Liu
Hefei University of Technology, Hefei, China
3 shared publications - Yin Wang
School of Computer Science and Information Engineering, Hefei University of Technology, Hefei, China
3 shared publications - Yutao Yin
School of Computer and Information Engineering, Hefei University of Technology, Hefei, China
3 shared publications
Latest Publications
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Sensors Journal
- Vol. 26 (22) , 35220-35234
Multiobjective Privacy-Aware AUV Path Planning in Underwater Acoustic Sensor Networks Using Diffusion-Based TD3
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Sensors Journal
- Vol. 26 (22) , 35220-35234
Multiobjective Privacy-Aware AUV Path Planning in Underwater Acoustic Sensor Networks Using Diffusion-Based TD3
- 28 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (8) , 16169-16182
DACL: Double-Anchor Contrastive Learning for IoT Network Intrusion Detection
In the Internet of Things, openness significantly increases security risks. Therefore, detecting such attacks through anomaly traffic monitoring is crucial for ensuring network security. Although existing intrusion detection systems (IDSs) have made some progress in detection performance using deep learning techniques (e.g., graph learning and meta-learning), the class imbalance problem remains a major challenge that needs to be addressed. To this end, we propose a double-anchor contrastive learning (DACL) framework. First, we introduce a positive–negative sample construction module. Compared to traditional contrastive learning methods, this module directly constructs sample pairs, preserving more flow information and thereby enhancing the effectiveness. Second, we design a feature embedding and extraction module. By utilizing convolutional neural networks (CNNs) to extract spatial correlations among raw features, we generate more discriminative feature representations. Subsequently, we propose the DACL module, introducing a double-anchor mechanism to impose double constraints on interclass distances, further enhancing feature representation capabilities and clustering effects. Finally, we map the learned features to a low-dimensional space via a classification network, achieving precise detection of abnormal traffic. Extensive experiments demonstrate that DACL outperforms existing works in terms of accuracy on datasets such as CIC-DDoS2017, CIC-IDS2018, and CIC-DDoS2019.
- 28 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (8) , 16169-16182
DACL: Double-Anchor Contrastive Learning for IoT Network Intrusion Detection
In the Internet of Things, openness significantly increases security risks. Therefore, detecting such attacks through anomaly traffic monitoring is crucial for ensuring network security. Although existing intrusion detection systems (IDSs) have made some progress in detection performance using deep learning techniques (e.g., graph learning and meta-learning), the class imbalance problem remains a major challenge that needs to be addressed. To this end, we propose a double-anchor contrastive learning (DACL) framework. First, we introduce a positive–negative sample construction module. Compared to traditional contrastive learning methods, this module directly constructs sample pairs, preserving more flow information and thereby enhancing the effectiveness. Second, we design a feature embedding and extraction module. By utilizing convolutional neural networks (CNNs) to extract spatial correlations among raw features, we generate more discriminative feature representations. Subsequently, we propose the DACL module, introducing a double-anchor mechanism to impose double constraints on interclass distances, further enhancing feature representation capabilities and clustering effects. Finally, we map the learned features to a low-dimensional space via a classification network, achieving precise detection of abnormal traffic. Extensive experiments demonstrate that DACL outperforms existing works in terms of accuracy on datasets such as CIC-DDoS2017, CIC-IDS2018, and CIC-DDoS2019.
- 17 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Emerging Topics in Computational Intelligence
- Vol. 10 (2) , 1999-2008
Toward Temporal Efficient Spiking Neural Network via Dynamic Training and Inference
Spiking Neural Networks (SNNs) have emerged as a promising alternative to traditional Artificial Neural Networks (ANNs) due to their biological interpretability. SNNs process input information in both spatial and temporal dimensions using binary spikes, offering advantages such as low energy consumption and compatibility with neural devices. Previous works have demonstrated that directly training SNNs from scratch has great potential. It can achieve performance comparable to traditional ANNs while significantly reducing energy consumption and the number of required time steps. Moreover, it outperforms ANN-SNN conversion methods. However, prior studies typically employ a fixed timestep during both training and inference, leading to two main problems: 1) During training, it results in complex gradient propagation and gradient estimation errors. 2) During inference, it causes energy waste and performance bottlenecks. To address these issues, we propose a novel strategy called Momentum Performance Queue Training and Confidence Score Inference (MPQ-CS). Firstly, MPQ-CS dynamically adjusts the timestep during the training stage based on the current training performance of the SNN using a Momentum Performance Queue (MPQ). Additionally, MPQ-CS dynamically adjusts the timestep during the inference stage using a Confidence Score (CS) based on the difficulty of input samples. Extensive experiments on multiple datasets and different SNN architectures demonstrate that MPQ-CS significantly enhances the overall performance of SNNs during both training and inference stages.
- 17 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Emerging Topics in Computational Intelligence
- Vol. 10 (2) , 1999-2008
Toward Temporal Efficient Spiking Neural Network via Dynamic Training and Inference
Spiking Neural Networks (SNNs) have emerged as a promising alternative to traditional Artificial Neural Networks (ANNs) due to their biological interpretability. SNNs process input information in both spatial and temporal dimensions using binary spikes, offering advantages such as low energy consumption and compatibility with neural devices. Previous works have demonstrated that directly training SNNs from scratch has great potential. It can achieve performance comparable to traditional ANNs while significantly reducing energy consumption and the number of required time steps. Moreover, it outperforms ANN-SNN conversion methods. However, prior studies typically employ a fixed timestep during both training and inference, leading to two main problems: 1) During training, it results in complex gradient propagation and gradient estimation errors. 2) During inference, it causes energy waste and performance bottlenecks. To address these issues, we propose a novel strategy called Momentum Performance Queue Training and Confidence Score Inference (MPQ-CS). Firstly, MPQ-CS dynamically adjusts the timestep during the training stage based on the current training performance of the SNN using a Momentum Performance Queue (MPQ). Additionally, MPQ-CS dynamically adjusts the timestep during the inference stage using a Confidence Score (CS) based on the difficulty of input samples. Extensive experiments on multiple datasets and different SNN architectures demonstrate that MPQ-CS significantly enhances the overall performance of SNNs during both training and inference stages.
- 23 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (20) , 42184-42197
Sniffer Channel Selection Based on Value Decomposition Networks in CRNs
In Cognitive Radio Networks (CRNs), network fault analysis, traffic tracing, and resource optimization are challenging tasks. With the increasing number of wireless applications and the conflict with limited wireless spectrum resources, the Sniffers Channel Assignment problem in CRNs has become particularly important. To address this issue, we propose a Value Decomposition Networks-based channel selection (CSVDN) algorithm. During centralized training, the Monitoring Quality Network (MQN) is trained based on observed data, using global information to calculate the Quality of Monitoring (QoM), which is then used as a reward to guide sniffers in selecting the optimal channels. During decentralized execution, sniffers share model parameters and independently run the MQN, sequentially selecting the optimal channels. This process ensures that sniffers collectively maximize network coverage while maintaining distributed control, thereby improving efficiency and scalability in dynamic environments. The results from NS-3 simulations show that CSVDN provides a distributed and implementable channel selection solution with high scalability and practicality, making it particularly suitable for large-scale CRNs.
- 23 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (20) , 42184-42197
Sniffer Channel Selection Based on Value Decomposition Networks in CRNs
In Cognitive Radio Networks (CRNs), network fault analysis, traffic tracing, and resource optimization are challenging tasks. With the increasing number of wireless applications and the conflict with limited wireless spectrum resources, the Sniffers Channel Assignment problem in CRNs has become particularly important. To address this issue, we propose a Value Decomposition Networks-based channel selection (CSVDN) algorithm. During centralized training, the Monitoring Quality Network (MQN) is trained based on observed data, using global information to calculate the Quality of Monitoring (QoM), which is then used as a reward to guide sniffers in selecting the optimal channels. During decentralized execution, sniffers share model parameters and independently run the MQN, sequentially selecting the optimal channels. This process ensures that sniffers collectively maximize network coverage while maintaining distributed control, thereby improving efficiency and scalability in dynamic environments. The results from NS-3 simulations show that CSVDN provides a distributed and implementable channel selection solution with high scalability and practicality, making it particularly suitable for large-scale CRNs.
- 27 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Green Communications and Networking
- Vol. 10, 218-235
CoMARS: Coordinated Multi-Agent Rollout Strategy for Distributed Channel Access in Clustered IoT Networks
The proliferation of Machine-to-Machine (M2M) communications in Internet of Things (IoT) networks intensifies interference management and resource allocation challenges for clustered devices. Existing solutions face limitations in scalability and fairness, particularly under dynamic conditions. We propose CoMARS, a bio-inspired framework integrating artificial immune systems with multi-agent reinforcement learning, designed to address these challenges through coordinated two-tier optimization. The architecture employs immune-inspired mechanisms at the device layer for autonomous cluster maintenance and interference-aware power control. At the network layer, a predictive rollout algorithm enables cluster heads to develop coordinated transmission strategies through model-based reinforcement learning. OMNeT++ simulations demonstrate CoMARS’s superior performance, achieving 5.71 Mbps/J energy efficiency with significantly improved throughput and lower latency compared to benchmark protocols. The framework maintains stable performance during topology changes and exhibits accelerated convergence under saturated traffic, proving effective for dynamic IoT environments.
- 27 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Green Communications and Networking
- Vol. 10, 218-235
CoMARS: Coordinated Multi-Agent Rollout Strategy for Distributed Channel Access in Clustered IoT Networks
The proliferation of Machine-to-Machine (M2M) communications in Internet of Things (IoT) networks intensifies interference management and resource allocation challenges for clustered devices. Existing solutions face limitations in scalability and fairness, particularly under dynamic conditions. We propose CoMARS, a bio-inspired framework integrating artificial immune systems with multi-agent reinforcement learning, designed to address these challenges through coordinated two-tier optimization. The architecture employs immune-inspired mechanisms at the device layer for autonomous cluster maintenance and interference-aware power control. At the network layer, a predictive rollout algorithm enables cluster heads to develop coordinated transmission strategies through model-based reinforcement learning. OMNeT++ simulations demonstrate CoMARS’s superior performance, achieving 5.71 Mbps/J energy efficiency with significantly improved throughput and lower latency compared to benchmark protocols. The framework maintains stable performance during topology changes and exhibits accelerated convergence under saturated traffic, proving effective for dynamic IoT environments.
- 17 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 22 (3) , 2412-2426
Joint Double Auction-Based Channel Selection in Wireless Monitoring Networks
In wireless networks, utilizing sniffers for fault analysis, traffic traceback, and resource optimization is a crucial task. However, existing centralized algorithms cannot be applied to high-density wireless networks. Therefore, distributed optimization of channel selection to maximize the monitoring rate of sensors in Wireless Monitoring Networks (WMNs) is a challenge. This paper proposes a joint double auction-based distributed channel selection algorithm (J2A-CS) to maximize overall quality of monitoring (QoM). First, sniffers are redundantly deployed in WMNs, and an initial channel allocation strategy is formulated. Subsequently, sniffers collectively act as buyers and sellers at different stages. Finally, buyers bid asynchronously, and sellers settle synchronously to maximize the seller’s marginal revenue and update the channel selection scheme. As a distributed channel selection algorithm, J2A-CS addresses the highest overall QoM issue in WMNs, demonstrating high scalability and fault tolerance. Simulation results show that J2A-CS significantly improves QoM compared to existing distributed algorithms and outperforms centralized algorithms in high-density scenarios.
- 17 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 22 (3) , 2412-2426
Joint Double Auction-Based Channel Selection in Wireless Monitoring Networks
In wireless networks, utilizing sniffers for fault analysis, traffic traceback, and resource optimization is a crucial task. However, existing centralized algorithms cannot be applied to high-density wireless networks. Therefore, distributed optimization of channel selection to maximize the monitoring rate of sensors in Wireless Monitoring Networks (WMNs) is a challenge. This paper proposes a joint double auction-based distributed channel selection algorithm (J2A-CS) to maximize overall quality of monitoring (QoM). First, sniffers are redundantly deployed in WMNs, and an initial channel allocation strategy is formulated. Subsequently, sniffers collectively act as buyers and sellers at different stages. Finally, buyers bid asynchronously, and sellers settle synchronously to maximize the seller’s marginal revenue and update the channel selection scheme. As a distributed channel selection algorithm, J2A-CS addresses the highest overall QoM issue in WMNs, demonstrating high scalability and fault tolerance. Simulation results show that J2A-CS significantly improves QoM compared to existing distributed algorithms and outperforms centralized algorithms in high-density scenarios.
- 24 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 22 (1) , 846-859
Flow Adjustment and Scale-Free Reliable Topology Control for Underwater Acoustic Sensor Networks
To improve the reliability and efficiency of underwater acoustic sensor networks (UASNs) under limited node energy and network attacks, a joint scheme of enhancing robustness and extending network lifetime is proposed in this paper. Scale-free networks exhibit strong robustness against random failures, and because of the lower number of link connections, nodes consume energy more slowly. We first introduce a new scale-free topology evolution model that adjusts the initial number of nodes according to the characteristics of UASNs. This model incorporates factors such as flow load, energy consumption, and distance into the preferential attachment mechanism, balancing the network load and enhancing its resistance to attacks. Further, based on this topology, we propose a network flow adjustment algorithm that features the joint selection of paths and corresponding power levels. Energy consumption is balanced among nodes in proportion to their residual energy, rather than by minimizing the absolute consumed power. Numerical simulations show that different topologies significantly affect network lifetime, which is the longest when the number of links added is 2. The network lifetime of the proposed scheme surpasses the state-of-the-art schemes, such as ETFLA, Initial-BA, and VODA, by up to 37.18%, 46.23%, and 128.80%, respectively.
- 24 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 22 (1) , 846-859
Flow Adjustment and Scale-Free Reliable Topology Control for Underwater Acoustic Sensor Networks
To improve the reliability and efficiency of underwater acoustic sensor networks (UASNs) under limited node energy and network attacks, a joint scheme of enhancing robustness and extending network lifetime is proposed in this paper. Scale-free networks exhibit strong robustness against random failures, and because of the lower number of link connections, nodes consume energy more slowly. We first introduce a new scale-free topology evolution model that adjusts the initial number of nodes according to the characteristics of UASNs. This model incorporates factors such as flow load, energy consumption, and distance into the preferential attachment mechanism, balancing the network load and enhancing its resistance to attacks. Further, based on this topology, we propose a network flow adjustment algorithm that features the joint selection of paths and corresponding power levels. Energy consumption is balanced among nodes in proportion to their residual energy, rather than by minimizing the absolute consumed power. Numerical simulations show that different topologies significantly affect network lifetime, which is the longest when the number of links added is 2. The network lifetime of the proposed scheme surpasses the state-of-the-art schemes, such as ETFLA, Initial-BA, and VODA, by up to 37.18%, 46.23%, and 128.80%, respectively.
- 19 December 2021
- Published by Wiley in Zeitschrift für anorganische und allgemeine Chemie
- Vol. 648 (9)
A metal‐organic framework ZJU‐136‐Ce for combined chemotherapy and chemodynamic therapy
A metal‐organic framework ZJU‐136‐Ce with ideal water stability was synthesized. It was adopted to load Mn2+ and DOX for chemo/chemodynamic therapy of tumor, the loading capacity of Mn2+ and DOX was 0.87 wt % and 10.19 wt % in ZJU‐136‐Ce, respectively. DOX&Mn@ZJU‐136‐Ce exhibited significant effects of inhibition of Hela cell growth, which confirmed it had a potential application prospect in the multimodal cancer therapy.
- 19 December 2021
- Published by Wiley in Zeitschrift für anorganische und allgemeine Chemie
- Vol. 648 (9)
A metal‐organic framework ZJU‐136‐Ce for combined chemotherapy and chemodynamic therapy
A metal‐organic framework ZJU‐136‐Ce with ideal water stability was synthesized. It was adopted to load Mn2+ and DOX for chemo/chemodynamic therapy of tumor, the loading capacity of Mn2+ and DOX was 0.87 wt % and 10.19 wt % in ZJU‐136‐Ce, respectively. DOX&Mn@ZJU‐136‐Ce exhibited significant effects of inhibition of Hela cell growth, which confirmed it had a potential application prospect in the multimodal cancer therapy.