Shuangwu Chen

Prof. Shuangwu Chen

orcid

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
24 May 2021 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
JYJian Yang
Jian Yang
XCXiang Chen
Xiang Chen
SCShuangwu Chen
Shuangwu Chen
XJXiaofeng Jiang
Xiaofeng Jiang
XTXiaobin Tan
Xiaobin Tan
Promptly discovering unknown network attacks is critical for reducing the risk of major loss imposed on organizations and information infrastructure. This paper aims at developing an intelligent intrusion detection system capable of classifying known attacks as well as inferring unknown ones. To achieve this, we formulate the problem of fine-grained known/unknown intrusion detection as a two-stage minimization problem, where the first stage is to seek a score measure for minimizing the empirical risk of misclassifying the known attacks, while the second stage is to find another score measure for minimizing the identification risk of inferring unknown attacks. The hierarchical nature of problem formulation allows us to employ the class conditioned auto-encoders to construct a hierarchical intrusion detection framework. Since the reconstruction errors of unknown attacks are generally higher than that of the known attacks, we further employ extreme value theory in the second stage to model the distribution of reconstruction errors for differentiating known/unknown attack. To further reduce the false positive rate, we add a benign clustering module for learning the multimodal distribution of benign traffic. We conduct an experiment on two widely used datasets for assessing intrusion detection. The results show that the proposed method improves the detection rate of unknown attacks while keeping a low false positive rate.

3 February 2023 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
JYJian Yang
Jian Yang
QYQifeng Yuan
Qifeng Yuan
SCShuangwu Chen
Shuangwu Chen
HHHuasen He
Huasen He
XJXiaofeng Jiang
Xiaofeng Jiang
XTXiaobin Tan
Xiaobin Tan
Driven by the prevalence of the computation-intensive and delay-intensive mobile applications, Mobile Edge Computing (MEC) is emerging as a promising solution. Traditional task offloading methods usually rely on centralized decision making, which inevitably involves a high computational complexity and a large state space. However, the MEC is a typical distributed system, where the edge servers are geographically separated, and independently perform the computing tasks. This fact inspires us to conceive a distributed cooperative task offloading system, where each edge server makes its own decision on how to allocate local computing resources and how to migrate tasks among the edge servers. To characterize diverse task requirements, we divide the arrival tasks into different priorities according to the tolerance time, which enables to dynamically schedule the local computing resources for reducing the task timeout. In order to coordinate the independent decision makings of geographically separate edge servers, we propose a priority driven cooperative task offloading algorithm based on multi-agent deep reinforcement learning, where the decision making of each edge server not only depends on its own state but also on the shared global information. We further develop a Variational Recurrent Neural Network (VRNN) based global state sharing model which significantly reduces the communication overhead among edge servers. The performance evaluation conducted on a movement trajectories dataset of mobile devices verifies that the proposed algorithm can reduce the task consumption time and improve the edge computing resources utilization.

5 February 2024 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
HHHuasen He
Huasen He
WYWenke Yuan
Wenke Yuan
SCShuangwu Chen
Shuangwu Chen
XJXiaofeng Jiang
Xiaofeng Jiang
FYFeng Yang
Feng Yang
JYJian Yang
Jian Yang
The deployment of UAVs as aerial base stations (BSs) has been considered as a promising supplement to the ground networks, which can quickly build an emergency communication network in a disaster area or significantly relief the communication burden imposed by hot-spots. However, the application of UAVs as aerial BSs is constrained by the limited onboard energy and communication coverage of UAVs. In particular, for a large target area, multiple UAVs should be deployed to meet the communication requirements. Therefore, designing the optimal trajectories of multiple UAVs is crucial to boost the UAV network performance. Inspired by the promising future of UAV BSs, this paper aims at proposing a distributed 3-dimensional (3D) trajectory design algorithm for multiple UAVs to optimize the system performance. We formulate the trajectory design problem as a multi-objective optimization problem to improve the user equipment (UE) access rate, ensure fair access opportunities, increase transmitted data volume and reduce energy consumption. Further inspired by the decision-making ability of deep reinforcement learning (DRL) in complex environments, we propose a DRL based trajectory design algorithm for multiple UAVs, namely DMTD, in which UAVs can explore both the optimal flight altitude and the potential UE distribution area in the iterative interactions with the environment, and then select the optimal flight trajectories to boost the network performance from multiple aspects. Extensive experimental results under different UE distributions have demonstrated that the proposed DMTD algorithm can find the optimal altitude to provide maximum coverage. Moreover, DMTD beats existing algorithms by providing high UE access rate, ensuring fair network service and increasing total transmitted data volume at the cost of a relatively low energy consumption. Especially in the scenes with dense and randomly distributed UEs, DMTD provides a UE access rate close to 0.9 and transmits 6 times of data volume than existing algorithms.

26 January 2022 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
YHYunhui Huang
Yunhui Huang
XJXiaofeng Jiang
Xiaofeng Jiang
SCShuangwu Chen
Shuangwu Chen
FYFeng Yang
Feng Yang
JYJian Yang
Jian Yang
Low Earth Orbit (LEO) satellite networking has been an indispensable and promising concept for extending the Internet coverage of future space-air-ground integrated networks to oceanic and remote airspace. However, the topology dynamics of the LEO Satellite Network (LEO-SN) for network state perception (Li et al. , 2019) and the intermittent nature of the Inter-Satellite Links (ISLs) for multipath routing discovery (Wang et al. , 2019, Jiang et al. , 2019) both induce new complicated challenges to multipath traffic scheduling for the sake of improving the utility of the LEO-SN facility (Song et al. , 2014, Zhang et al. , 2018, and Yang et al. , 2020). Motivated by these challenges, this paper aims to develop an AI aided intelligent multipath traffic scheduling approach for bolstering autonomous and efficient communications of LEO-SN. To achieve this, we formulate the multipath traffic scheduling problem into a pheromone incentivized Markov Decision Process (MDP) by considering ant routing protocol and adapting pheromone to LEO-SN. Employing enhanced pheromone characterizing network state, we propose ant-inspired multipath routing discovery, which is capable of promptly discovering routing paths available in the dynamic topology. To improve the utility of these discovered routing paths, we employ deep deterministic policy gradient into the pheromone-incentivized MDP-based scheduling problem to derive an intelligent multipath traffic scheduling strategy. The experimental results are further presented to show the achievable performance improvement.

18 November 2024 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
Yongyi RanYongyi Ran
Yongyi Ran
YDYajie Ding
Yajie Ding
SCShuangwu Chen
Shuangwu Chen
JLJizhao Lei
Jizhao Lei
JLJiangtao Luo
Jiangtao Luo
An efficient routing strategy in Low Earth Orbit (LEO) satellite networks is critical for air-space-ground integrated communication towards 6G. However, the existing terrestrial routing algorithms cannot well handle the high-speed movement issue of satellites, while the existing satellite routing algorithms usually suffer from high communication overhead or high computational complexity. To address the above issues, we propose a fully distributed dynamic packet routing algorithm based on Graph Neural Network (GNN)-enhanced Multi-Agent Deep Reinforcement Learning (MADRL), named GraphPR. In GraphPR, the satellite routing problem is modeled as a Partially Observable Markov Decision Process (POMDP), where each satellite only needs to share the information with one-hop neighbors. Then, Graph Attention Network (GAT) is leveraged to encode the perceived one-hop information and derive a hidden representation implicitly consisting of multi-hop satellite information. Subsequently, MADRL is employed to build a fully distributed optimization framework and make routing decisions. In addition, a special mechanism called Residual Shortest Path Hops (RSPH) is designed to guide the routing selection and avoid routing loops. Finally, the experimental results illustrate that GraphPR has better performance in terms of packet loss rate, average delivery time, throughput, and average queuing length than the baseline algorithms.

4 August 2021 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
JYJian Yang
Jian Yang
QZQi Zhang
Qi Zhang
XJXiaofeng Jiang
Xiaofeng Jiang
SCShuangwu Chen
Shuangwu Chen
FYFeng Yang
Feng Yang
The volatile, covert and slow multistage attack patterns of Advanced Persistent Threat (APT) present a tricky challenge of APT detection, which are vital for organisations to protect their critical assets. In this article, we aim to develop system that aggregates and uses existing systems’ alerts to detect APTs. In order to achieve this, we propose a causal correlation aided semantic analysis system, called Poirot , for detecting the multi-stage threats over a long-time span from existing systems’ alerts. Poirot is capable of autonomously mining causality between anomalous events, which instructs us in reorganizing the original alerts and in constructing alert-chains. The system further exploits the Latent Dirichlet Allocation (LDA) to model the semantic context of the alert-chains. This LDA model facilitates us to carry out the semantic analysis for capturing the latent attack intent as well as for reconstructing the APT scenario. We use an alert dataset provided by a cyber security company to verify the proposed Poirot in terms of the detection accuracy and the capability of attack scenario reconstruction. The experiment results are presented to show the achievable performance of the proposed semantic analysis based APT detection.