Kan Wang

Dr. Kan Wang

School of Computer Science and Engineering, Xi'an University of Technology, Xi'an, China
orcid
Associate Professor

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
18 March 2019 in IEEE Access
Verified
Journal Article
Open access
JLJun-Huai Li
Jun-Huai Li
LTLing Tian
Ling Tian
WHWang Huaijun
Wang Huaijun
YAYang An
Yang An
Kan WangKan Wang
Kan Wang
LYLei Yu
Lei Yu
Human activity recognition (HAR) is a hot research topic which aims to understand human behavior and can be applied in various applications. However, transitions between activities are usually disregarded due to their low incidence and short duration when compared against other activities, while in fact, transitions can affect the performance of the recognition system if not dealt with properly. In this paper, we propose and implement a systematic human activity recognition method to recognize basic activities (BA) and transitional activities (TA) in a continuous sensor data stream. First, raw sensor data are segmented into fragments with sliding window and the features are constructed based on window segmentation. Then, cluster analysis with K-Means is used to aggregate activity fragments into periods. Next, generally, realize the classification of BA and TA according to the shortest duration of the BA, and then deal with the hidden phenomenon of BA. Third, the fragments between adjacent BA are evaluated to decide whether they are TA or disturbance process. Finally, random forest classifier is used to accurately recognize BA and TA. The proposed method is evaluated on the public dataset SBHAR. The results demonstrate that our method effectively recognizes different activities and can deliver high accuracy with all activities considered.

24 May 2022 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
JLJunhuai Li
Junhuai Li
RWRuijie Wang
Ruijie Wang
Kan WangKan Wang
Kan Wang
Owing to network function virtualization (NFV), each industrial application is constructed as a service function chain (SFC), concatenating the ordered service functions, to offer applications more flexibly in industrial Internet of Things (IIoT). When it comes to the emerging edge intelligence, the integration of NFV with edge in IIoT would enable more close-proximity services, yet also posing new challenges owing to more complicated environment. Although some efforts have been made to service function chaining in IIoT, the radio resource dynamics are not fully perceived. In this article, we investigate the radio-aware SFC deployment in the edge-enabled IIoT. First, a radio-aware deployment formulation is exhibited, steering the flow traversing both wireless and wired links. Next, Markov decision process is exhibited to track dynamics in both IIoT and radio resources. Afterwards, the natural gradient-based actor-critic SFC paradigm is introduced to adapt to network variation, by incorporating the curvature of parameter space into gradient information. To resolve the high-dimensionality in action space, we then recur to the norm penalty approach, reducing the space size by two orders of magnitude. Finally, numerical experiments are executed to uncover superiority of presented method, disclosing that the latency performance benefits from both the SFC routing between IIoT servers and elaborated wireless resource orchestration.

18 March 2024 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
JLJunhuai Li
Junhuai Li
Kan WangKan Wang
Kan Wang
XHXiangwang Hou
Xiangwang Hou
DLDapeng Lan
Dapeng Lan
YWYunwen Wu
Yunwen Wu
Shahid MumtazShahid Mumtaz
Shahid Mumtaz
With recent advents of industrial Internet of Things (IIoT), the connectivity and data collection capabilities of industrial equipment have be significantly enhanced, yet bringing new challenges for the remaining useful life (RUL) prediction. To fulfill the RUL predicting demand in multivariate time series, this work proposes an encoder-decoder model termed as dual-scale transformer model (DSFormer), built upon the Transformer architecture. First, in the encoder part, a dual-attention module is designed for the weight feature extraction from both dimensions of the sensor and time series, aiming to compensate for the diverse impacts of different sensors on the prediction. Next, a temporal convolutional network (TCN) module is introduced to capture sequence features and alleviate the loss of positional information incurred by stacking blocks. Then, the feature decomposition module is integrated into the decoder for trend feature extraction from sequences, providing the model with additional sequence information. Finally, compared to existing models, the proposed method can obtain the superior performance in terms of the root mean square error (RMSE) and Score metrics on the FD001, FD002 and FD003 subsets of the C-MAPSS dataset, with an average improvement of 3.2% and 2.5% respectively. In particular, the ablation experiment further validates the effectiveness of proposed modules in handling multivariate time series and extracting features.

9 January 2019 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
Kan WangKan Wang
Kan Wang
FYF. Richard Yu
F. Richard Yu
LWLei Wang
Lei Wang
JLJunhuai Li
Junhuai Li
NZNan Zhao
Nan Zhao
QWQiong Wu
Qiong Wu

31 January 2019 in Electronics
Verified
Journal Article
Open access
PDF file
QWQiong Wu
Qiong Wu
LHLiu hanxu
Liu hanxu
CZCui Zhang
Cui Zhang
QFQiang Fan
Qiang Fan
ZLZhengquan Li
Zhengquan Li
Kan WangKan Wang
Kan Wang
With the proliferation of the Internet-of-Things (IoT), the users’ trajectory data containing privacy information in the IoT systems are easily exposed to the adversaries in continuous location-based services (LBSs) and trajectory publication. Existing trajectory protection schemes generate dummy trajectories without considering the user mobility pattern accurately. This would cause that the adversaries can easily exclude the dummy trajectories according to the obtained geographic feature information. In this paper, the continuous location entropy and the trajectory entropy are defined based on the gravity mobility model to measure the level of trajectory protection. Then, two trajectory protection schemes are proposed based on the defined entropy metrics to protect the trajectory data in continuous LBSs and trajectory publication, respectively. Experimental results demonstrate that the proposed schemes have a higher level than the enhanced dummy-location selection (enhance-DLS) scheme and the random scheme.

26 June 2024 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
YWYingkun Wen
Yingkun Wen
LLLei Liu
Lei Liu
JLJunhuai Li
Junhuai Li
YLYilan Li
Yilan Li
Kan WangKan Wang
Kan Wang
Mohsen GuizaniMohsen Guizani
Mohsen Guizani
This paper examines integrating jamming and secondary signals for covert communications in cognitive radio networks (CRNs), aiming to enhance covertness by using jamming and secondary signals in an overlay cooperative CRN. The scenario involves a primary base station (PBS) transmitting to a primary user (PU), with a secondary user transmitter (SU-Tx) acting as a cooperative jammer to obscure the message from a malevolent secondary user named “Willie.” During idle intervals on the primary channel, the SU-Tx opportunistically accesses it to transmit secondary signals, reinforcing the covert communication of primary signals. The study quantifies the detection error probability (DEP) experienced by Willie, considering perfect and statistical channel state information (CSI) scenarios. In the perfect CSI scenario, optimization has two phases. Phase I aims to maximize the signals-to-interference-plus-noise ratio (SINR) of the PU, subject to the warden DEP exceeding a specified threshold. Phase II uses an iterative search algorithm to optimize beamforming vectors, enhancing SINR. In the statistical CSI scenario, the goal is to maximize effective transmission throughput (ETT), measuring the information transmitted from PBS to PU under covert constraints. Numerical results validate the theoretical analysis.