PWPin Wan

Pin Wan

*This is an algorithmically generated author record based on publicly available information.

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


Pin Wan has a total of 20 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Riemannian Mean Shift-Based Data Fusion Scheme for Multi-Antenna Cooperative Spectrum Sensing

    by Yongwei Zhang, Shunchao Zhang, Yonghua Wang, Jiawei Zhuang, Pin Wan

    In this article, the multi-antenna cooperative spectrum sensing problem in cognitive radio networks is investigated over Riemannian manifold. At the beginning, a signal matrix is constructed by using the sensing signals from secondary users (SUs) and the corresponding covariance matrix is calculated. Subsequently, the covariance matrices are transmitted to the fusion center and mapped to points on the manifold. In order to reduce the impact of aberrant SUs, a data fusion scheme based on Riemannian mean shift algorithm is developed. After data fusion, the representative points are obtained to train a classifier. In order to realize clustering directly over Riemannian manifold, a novel Riemannian distance based particle swarm optimization (RDPSO) algorithm, is proposed to train a classifier, which is employed to determine the state of primary user (PU). Finally, in simulation part, the validity of the proposed scheme is verified under different scenarios.


  • Open Access

    Dueling deep Q-networks for social awareness-aided spectrum sharing

    by Yonghua Wang, Xueyang Li, Pin Wan, Le Chang, Xia Deng

    In overlapping spectrum sharing, due to the complexity of cognitive environment, it is a real challenge for a secondary user (SU) to correctly sense the usage of the spectrum in real time. To tackle this challenge, a social awareness-aided transmit power control policy for SUs is developed. First, a social network composed of a group of third-party sensing nodes that do not share the spectrum with the PU is established, which helps an SU collect the power information of the PU. Then, we design a Dueling Deep Q-Network (DQN) model to achieve efficient dynamic spectrum sharing between the PU and the SU with the power information collected in the social network. Experimental results show that the spectrum sharing success rate is higher and the comprehensive performance is improved with the sensing nodes selected by the social relationship. Moreover, compared with other deep reinforcement learning (DRL) algorithms, the performance of Dueling DQN is more stable on our targeted spectrum sharing problem.


  • Open Access

    ResCaps: an improved capsule network and its application in ultrasonic image classification of thyroid papillary carcinoma

    by Xiongzhi Ai, Jiawei Zhuang, Yonghua Wang, Pin Wan, Yu Fu

    Ultrasonic image examination is the first choice for the diagnosis of thyroid papillary carcinoma. However, there are some problems in the ultrasonic image of thyroid papillary carcinoma, such as poor definition, tissue overlap and low resolution, which make the ultrasonic image difficult to be diagnosed. Capsule network (CapsNet) can effectively address tissue overlap and other problems. This paper investigates a new network model based on capsule network, which is named as ResCaps network. ResCaps network uses residual modules and enhances the abstract expression of the model. The experimental results reveal that the characteristic classification accuracy of ResCaps3 network model for self-made data set of thyroid papillary carcinoma was $$81.06\%$$ 81.06 % . Furthermore, Fashion-MNIST data set is also tested to show the reliability and validity of ResCaps network model. Notably, the ResCaps network model not only improves the accuracy of CapsNet significantly, but also provides an effective method for the classification of lesion characteristics of thyroid papillary carcinoma ultrasonic images.


  • Riemannian Distance-Based Fast K-Medoids Clustering Algorithm for Cooperative Spectrum Sensing

    by Shunchao Zhang, Yonghua Wang, Yongwei Zhang, Pin Wan, Jiawei Zhuang

    Spectrum sensing is a fundamental component in a cognitive radio network to utilize the frequency bands effectively. In this article a fast Riemannian distance-based K-medoids (FRDK)-based cooperative spectrum sensing (CSS) method is developed to identify the state of primary user (PU). In particular, two CSS scenarios are considered, one is secondary users (SUs) with a single antenna and the other is SUs with multiple antennas. In the multiantenna case, a Riemannian mean-based data fusion method is proposed to fuse sensing data from SUs with multiple antennas. To implement CSS, we propose a FRDK-based framework, where SUs collect sensing data, preprocess, and upload these data to an appointed fusion center (FC). Then, the FC transforms these data as samples on a manifold and uses the FRDK algorithm to train a classifier for identifying the state of PU. Furthermore, the convergence and the complexity analysis of training process are presented. Finally, the effectiveness of the proposed FRDK-based CSS method is verified under different conditions.


  • Intelligent Dynamic Spectrum Access Using Deep Reinforcement Learning for VANETs

    by Yonghua Wang, Xueyang Li, Pin Wan, Ruiyu Shao

    In vehicular ad hoc networks (VANETs), vehicles can communicate with other vehicles or devices through vehicle-to-X communication. However, with the rise of the Internet of Things, it is a real challenge to make the limited spectrum resource meet the increasing communication demands, i.e., the channel contention problem. To solve this problem, this paper proposes a strategy combining multi-hop forwarding through vehicles and dynamic spectrum access. Firstly, a group-based multi-hop broadcast protocol, G-hop, is proposed. G-hop classifies vehicles with similar characteristics such as moving speed and communication distance into same groups using the depth-first-search algorithm. Messages are forwarded within a group in priority and then across groups, which limits both the range and the number of relay vehicles, i.e., channel contenders. Further, we adopt deep reinforcement learning techniques to achieve dynamic spectrum access. We design a Global Optimization algorithm based on Experience Accumulation (GOEA) using deep reinforcement learning. In GOEA, a network structure combined with recurrent neural network and deep Q-network is proposed for learning the time-varying process, and then a reward method is applied to optimize the global utility. Vehicles that need to transmit messages select channels dynamically following the guidance of GOEA. The experimental results demonstrate that the G-hop protocol reduces the packet loss rate from 0.8 to about 0.1. Meanwhile, compared with Slotted Aloha and DQN, our GOEA algorithm reduces the collision probability and channel idle probability by 60%. Moreover, as the number of vehicles increases, the transmission success rate can be improved by 20%.


  • Open Access

    Information Geometry-Based Fuzzy-C Means Algorithm for Cooperative Spectrum Sensing

    by Yongwei Zhang, Canfeng Ma, Yonghua Wang, Shunchao Zhang, Pin Wan

    In this paper, the spectrum sensing problem is investigated under the context of information geometry and a novel clustering algorithm based spectrum sensing scheme is developed to obtain a classifier to estimate the channel state of primary user (PU). In order to enhance the sensing performance at complex environment, the empirical mode decomposition (EMD) algorithm is applied to wipe off the noise component of the received signals from all secondary users (SUs). Subsequently, a signal matrix composed of the reconstructed signals is constructed. Based on the information geometry (IG) theory, the covariance matrix of the signal matrix is mapped into a point on a manifold. Then, the sample points on the manifold are collected as a data set. Moreover, a novel clustering algorithm, namely Riemannian distance based Fuzzy-c means clustering (RDFCM) algorithm, is developed to cluster the samples on manifold for obtaining a classifier, which is employed to decide the PU state. The simulation results show that compared with other spectrum sensing methods, the proposed scheme improves the performance of detection.


  • A Novel Clustering Algorithm Based on Information Geometry for Cooperative Spectrum Sensing

    by Shunchao Zhang, Yonghua Wang, Yongwei Zhang, Pin Wan, Jiawei Zhuang

    Spectrum sensing is used to detect whether primary user are using authorized spectrums, which can be regarded as a key and core issue for opportunistic spectrum access in cognitive radio networks. In traditional information theory and clustering algorithm-based spectrum sensing methods, they need to evaluate noise environment for constructing a reference point. However, the reference point is fixed, which is unreasonable in dynamic cognitive radio environment. Moreover, these methods convert signal feature from manifold onto Euclidean space, which will cause to overall performance degradation, since sensing information losses. To address this problem, an information geometry (IG)-based K-means clustering algorithm, namely IGK, is developed, it clusters samples on manifold instead of Euclidean space with an unsupervised way to train a classifier for spectrum sensing. Specifically, secondary users observe and collect data from a selected authorized spectrum, which needs to be detected, and send these sensing data to a fusion center (FC). Then, the FC transforms these data into samples on the manifold to obtained a classifier by using the proposed IGK algorithm. According to the trained classifier, we can get related result of the authorized spectrum. Finally, in simulation section, the effectiveness of the proposed scheme is verified under different conditions.


  • Open Access

    Joint Channel Allocation and Power Control Based on Long Short-Term Memory Deep Q Network in Cognitive Radio Networks

    by Zifeng Ye, Yonghua Wang, Pin Wan

    Efficient spectrum resource management in cognitive radio networks (CRNs) is a promising method that improves the utilization of spectrum resource. In particular, the power control and channel allocation are of top priorities in spectrum resource management. Nevertheless, the joint design of power control and channel allocation is an NP-hard problem and the research is still in the preliminary stage. In this paper, we propose a novel joint approach based on long short-term memory deep Q network (LSTM-DQN). Our objective is to obtain the channel allocation schemes of the access points (APs) and the power control strategies of the secondary users (SUs). Specifically, the received signal strength information (RSSI) collected by the microbase stations is used as the input of LSTM-DQN. In this way, the collection of RSSI can be shared between users. After the training is completed, the APs are capable of selecting channels with small interference while the SUs may access the authorized channels in an underlay operation mode without knowing any knowledge about the primary users (PUs). Experimental results show that the channels are allocated to the APs with a lower probability of collision. Moreover, the SUs can adjust their power control strategies quickly to avoid the harmful interference to the PUs when the environment parameters change randomly. Consequently, the overall performance of CRNs and the utilization of spectrum resources are improved significantly compared to existing popular solutions.


  • Open Access

    Spectrum Sensing Method Based on Information Geometry and Deep Neural Network

    by Kaixuan Du, Pin Wan, Yonghua Wang, Xiongzhi Ai, Huang Chen

    Due to the scarcity of radio spectrum resources and the growing demand, the use of spectrum sensing technology to improve the utilization of spectrum resources has become a hot research topic. In order to improve the utilization of spectrum resources, this paper proposes a spectrum sensing method that combines information geometry and deep learning. Firstly, the covariance matrix of the sensing signal is projected onto the statistical manifold. Each sensing signal can be regarded as a point on the manifold. Then, the geodesic distance between the signals is perceived as its statistical characteristics. Finally, deep neural network is used to classify the dataset composed of the geodesic distance. Simulation experiments show that the proposed spectrum sensing method based on deep neural network and information geometry has better performance in terms of sensing precision.


  • Open Access

    Clustering Algorithm-Based Data Fusion Scheme for Robust Cooperative Spectrum Sensing

    by Shunchao Zhang, Yonghua Wang, Pin Wan, Jiawei Zhuang, Yongwei Zhang, Yi Li

    In a centralized cooperative spectrum sensing (CSS) system, it is vulnerable to malicious users (MUs) sending fraudulent sensing data, which can severely degrade the performance of CSS system. To solve this problem, we propose sensing data fusion schemes based on K-medoids and Mean-shift clustering algorithms to resist the MUs sending fraudulent sensing data in this paper. The cognitive users (CUs) send their local energy vector (EVs) to the fusion center which fuses these EVs as an EV with robustness by the proposed data fusion method. Specifically, this method takes a Medoids of all EVs as an initial value and searches for a high-density EV by iteratively as a representative statistical feature which is robust to malicious EVs from MUs. It does not need to distinguish MUs from CUs in the whole CSS process and considers constraints imposed by the CSS system such as the lack of information of PU and the number of MUs. Furthermore, we propose a global decision framework based on fast K-medoids or Mean-shift clustering algorithm, which is unaware of the distributions of primary user (PU) signal and environment noise. It is worth noting that this framework can avoid the derivation of threshold. The simulation results reflect the robustness of our proposed CSS scheme.