Shan Wang
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
Shan Wang has a total of 36 co-authors. Here are the top co-authors by number of shared publications:
- Fanglin Gu
College of Electronic Science and Engineering, National University of Defense Technology, Changsha, China
2 shared publications - Haitao Zhao
College of Electronic Science and Technology, National University of Defense Technology, Changsha, China
2 shared publications - Hang Zhang
College of Communications Engineering, Army Engineering University of PLA, Nanjing, China
2 shared publications - Quan Peng2 shared publications
- Shi Hu2 shared publications
- Wenwu Wang
School of Computer Science and Electronic Engineering, University of Surrey, Guildford GU2 7XH, UK
2 shared publications
Latest Publications
- Open Access
- 18 August 2026
- Published by Elsevier in Computer Networks
- Vol. 289
ADAD: AI-driven detector for Fake Base Station and signal overshadowing attacks in radio access networks
- 18 August 2026
- Published by Elsevier in Computer Networks
- Vol. 289
Open AccessADAD: AI-driven detector for Fake Base Station and signal overshadowing attacks in radio access networks
- Open Access
- 5 November 2025
- Published by Elsevier in Computers & Security
- Vol. 160
SigOverlay: A security evaluation model based on reference signals
- 5 November 2025
- Published by Elsevier in Computers & Security
- Vol. 160
Open AccessSigOverlay: A security evaluation model based on reference signals
- Open Access
- 27 September 2023
- Published by MDPI AG in Electronics
- Vol. 12 (19) , 4056
MASA: Multi-Application Scheduling Algorithm for Heterogeneous Resource Platform
Heterogeneous architecture-based systems-on-chip enable the development of flexible and powerful multifunctional RF systems. In complex and dynamic environments where applications arrive continuously and stochastically, real-time scheduling of multiple applications to appropriate processor resources is crucial for fully utilizing the heterogeneous SoC’s resource potential. However, heterogeneous resource-scheduling algorithms still face many problems in practical situations, including generalized abstraction of applications and heterogeneous resources, resource allocation, efficient scheduling of multiple applications in complex mission scenarios, and how to ensure the effectiveness combining with real-world applications of scheduling algorithms. Therefore, in this paper, we design the Multi-Application Scheduling Algorithm, named MASA, which is a two-phase scheduler architecture based on Deep Reinforcement Learning. The algorithm is made up of neural network scheduler-based task prioritization for dynamic encoding of applications and heuristic scheduler-based task mapping for solving the processor resource allocation problem. In order to achieve stable and fast training of the network scheduler based on the actor–critic strategy, we propose optimization methods for the training of MASA: reward dynamic alignment (RDA), earlier termination of the initial episodes, and asynchronous multi-agent training. The performance of the MASA is tested with classic directed acyclic graph and six real-world application datasets, respectively. Experimental results show that MASA outperforms other neural scheduling algorithms and heuristics, and ablation experiments illustrate how these training optimizations improve the network’s capacity.
- 27 September 2023
- Published by MDPI AG in Electronics
- Vol. 12 (19) , 4056
Open AccessMASA: Multi-Application Scheduling Algorithm for Heterogeneous Resource Platform
Heterogeneous architecture-based systems-on-chip enable the development of flexible and powerful multifunctional RF systems. In complex and dynamic environments where applications arrive continuously and stochastically, real-time scheduling of multiple applications to appropriate processor resources is crucial for fully utilizing the heterogeneous SoC’s resource potential. However, heterogeneous resource-scheduling algorithms still face many problems in practical situations, including generalized abstraction of applications and heterogeneous resources, resource allocation, efficient scheduling of multiple applications in complex mission scenarios, and how to ensure the effectiveness combining with real-world applications of scheduling algorithms. Therefore, in this paper, we design the Multi-Application Scheduling Algorithm, named MASA, which is a two-phase scheduler architecture based on Deep Reinforcement Learning. The algorithm is made up of neural network scheduler-based task prioritization for dynamic encoding of applications and heuristic scheduler-based task mapping for solving the processor resource allocation problem. In order to achieve stable and fast training of the network scheduler based on the actor–critic strategy, we propose optimization methods for the training of MASA: reward dynamic alignment (RDA), earlier termination of the initial episodes, and asynchronous multi-agent training. The performance of the MASA is tested with classic directed acyclic graph and six real-world application datasets, respectively. Experimental results show that MASA outperforms other neural scheduling algorithms and heuristics, and ablation experiments illustrate how these training optimizations improve the network’s capacity.
- 1 August 2021
- Published by Elsevier in Sensors and Actuators A: Physical
- Vol. 327, 112724
An optimization method of planar array capacitance imaging
- 1 August 2021
- Published by Elsevier in Sensors and Actuators A: Physical
- Vol. 327, 112724
An optimization method of planar array capacitance imaging
- 18 June 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 254-258
Construction of Internet Innovative Design Course System with Digital Media Characteristics
The Internet is the digital media that has the most extensive and profound impact on human society. Innovative design around the Internet media is one of the important teaching directions of digital media majors in colleges and universities. The rapid development of science and technology and the continuous penetration of the Internet have enabled mankind to open a new era of mobile Internet and artificial intelligence. In this context, this paper puts forward the idea of building an Internet innovative design course system that not only meets the needs of today's society for innovative design talents, but also meets the goals of digital media talent training and discipline construction. Taking Beihang University as example, we introduce how to build the course system in digital media major from the aspects of course objectives, content, structure and practice models through optimization and integration, top-level design, and reasonable configuration on the basis of existing related courses and the exploration and practice in teaching.
- 18 June 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 254-258
Construction of Internet Innovative Design Course System with Digital Media Characteristics
The Internet is the digital media that has the most extensive and profound impact on human society. Innovative design around the Internet media is one of the important teaching directions of digital media majors in colleges and universities. The rapid development of science and technology and the continuous penetration of the Internet have enabled mankind to open a new era of mobile Internet and artificial intelligence. In this context, this paper puts forward the idea of building an Internet innovative design course system that not only meets the needs of today's society for innovative design talents, but also meets the goals of digital media talent training and discipline construction. Taking Beihang University as example, we introduce how to build the course system in digital media major from the aspects of course objectives, content, structure and practice models through optimization and integration, top-level design, and reasonable configuration on the basis of existing related courses and the exploration and practice in teaching.
- Open Access
- 12 June 2020
- Published by Frontiers Media SA in Frontiers in Bioengineering and Biotechnology
- Vol. 8, 493
Recognizing Ion Ligand–Binding Residues by Random Forest Algorithm Based on Optimized Dihedral Angle
The prediction of ion ligand–binding residues in protein sequences is a challenging work that contributes to understand the specific functions of proteins in life processes. In this article, we selected binding residues of 14 ion ligands as research objects, including four acid radical ion ligands and 10 metal ion ligands. Based on the amino acid sequence information, we selected the composition and position conservation information of amino acids, the predicted structural information, and physicochemical properties of amino acids as basic feature parameters. We then performed a statistical analysis and reclassification for dihedral angle and proposed new methods on the extraction of feature parameters. The methods mainly included applying information entropy on the extraction of polarization charge and hydrophilic–hydrophobic information of amino acids and using position weight matrices on the extraction of position conservation information. In the prediction model, we used the random forest algorithm and obtained better prediction results than previous works. With the independent test, the Matthew's correlation coefficient and accuracy of 10 metal ion ligand–binding residues were larger than 0.07 and 52%, respectively; the corresponding evaluation values of four acid radical ion ligand–binding residues were larger than 0.15 and 86%, respectively. Further, we classified and combined the phi and psi angles and optimized prediction model for each ion ligand–binding residue.
- 12 June 2020
- Published by Frontiers Media SA in Frontiers in Bioengineering and Biotechnology
- Vol. 8, 493
Open AccessRecognizing Ion Ligand–Binding Residues by Random Forest Algorithm Based on Optimized Dihedral Angle
The prediction of ion ligand–binding residues in protein sequences is a challenging work that contributes to understand the specific functions of proteins in life processes. In this article, we selected binding residues of 14 ion ligands as research objects, including four acid radical ion ligands and 10 metal ion ligands. Based on the amino acid sequence information, we selected the composition and position conservation information of amino acids, the predicted structural information, and physicochemical properties of amino acids as basic feature parameters. We then performed a statistical analysis and reclassification for dihedral angle and proposed new methods on the extraction of feature parameters. The methods mainly included applying information entropy on the extraction of polarization charge and hydrophilic–hydrophobic information of amino acids and using position weight matrices on the extraction of position conservation information. In the prediction model, we used the random forest algorithm and obtained better prediction results than previous works. With the independent test, the Matthew's correlation coefficient and accuracy of 10 metal ion ligand–binding residues were larger than 0.07 and 52%, respectively; the corresponding evaluation values of four acid radical ion ligand–binding residues were larger than 0.15 and 86%, respectively. Further, we classified and combined the phi and psi angles and optimized prediction model for each ion ligand–binding residue.
- 30 November 2018
- Published by Korean Society for Internet Information (KSII) in KSII Transactions on Internet and Information Systems
- Vol. 12 (11) , 5425-5448
An Intelligent MAC Protocol Selection Method based on Machine Learning in Wireless Sensor Networks
- 30 November 2018
- Published by Korean Society for Internet Information (KSII) in KSII Transactions on Internet and Information Systems
- Vol. 12 (11) , 5425-5448
An Intelligent MAC Protocol Selection Method based on Machine Learning in Wireless Sensor Networks
- 1 March 2018
- Published by Zhejiang University Press in Frontiers of Information Technology & Electronic Engineering
- Vol. 19 (3) , 388-397
Standard-independent I/Q imbalance estimation and compensation scheme inOFDM
Direct-conversion transceivers are gaining increasing attention due to their low power consumption. However, they suffer from a serious in- and quadrature-
- 1 March 2018
- Published by Zhejiang University Press in Frontiers of Information Technology & Electronic Engineering
- Vol. 19 (3) , 388-397
Standard-independent I/Q imbalance estimation and compensation scheme inOFDM
Direct-conversion transceivers are gaining increasing attention due to their low power consumption. However, they suffer from a serious in- and quadrature-
- 4 December 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cognitive Communications and Networking
- Vol. 4 (1) , 1-14
Impact of Heterogeneous Fading Channels in Power Limited Cognitive Radio Networks
The tradeoff between decreasing the interference to primary user (PU) and increasing secondary users’ (SUs’) achievable throughput is an important problem in cognitive radio networks. Heterogeneous fading channels from PU to multiple SUs, PU’s traffic distribution, limited SU’s power and multiple SUs’ access contention impact both these two conflicting objectives. In this paper, we study the joint impact of these four factors on the tradeoff. More specifically, we consider that the channels from PU to SUs are exposed to non-identically independent free space path losses, PU’s traffic randomly arrives and departs from the channel, every SU’s average power consumption is limited, while multiple SUs contend to transmit. We first model the impact of these factors on SUs’ spectrum sensing and data transmission. Then, we formulate the tradeoff aiming at maximizing SUs’ aggregated throughput under two constraints: (i) interference probability to PU and (ii) SUs’ average power consumption. To solve the optimization problem, we design a novel cluster based particle swarm optimization (C-PSO) algorithm. By iteratively updating the particles in a cluster based on the comparison of their fitnesses, the cluster converges to the optimal solution rapidly. Simulation results validate the feasibility of the C-PSO algorithm and the outperformance of our proposal compared against related contributions which consider the homogeneous fading channel. They also show how the optimal solution varies with path losses and PU’s traffic distribution.
- 4 December 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cognitive Communications and Networking
- Vol. 4 (1) , 1-14
Impact of Heterogeneous Fading Channels in Power Limited Cognitive Radio Networks
The tradeoff between decreasing the interference to primary user (PU) and increasing secondary users’ (SUs’) achievable throughput is an important problem in cognitive radio networks. Heterogeneous fading channels from PU to multiple SUs, PU’s traffic distribution, limited SU’s power and multiple SUs’ access contention impact both these two conflicting objectives. In this paper, we study the joint impact of these four factors on the tradeoff. More specifically, we consider that the channels from PU to SUs are exposed to non-identically independent free space path losses, PU’s traffic randomly arrives and departs from the channel, every SU’s average power consumption is limited, while multiple SUs contend to transmit. We first model the impact of these factors on SUs’ spectrum sensing and data transmission. Then, we formulate the tradeoff aiming at maximizing SUs’ aggregated throughput under two constraints: (i) interference probability to PU and (ii) SUs’ average power consumption. To solve the optimization problem, we design a novel cluster based particle swarm optimization (C-PSO) algorithm. By iteratively updating the particles in a cluster based on the comparison of their fitnesses, the cluster converges to the optimal solution rapidly. Simulation results validate the feasibility of the C-PSO algorithm and the outperformance of our proposal compared against related contributions which consider the homogeneous fading channel. They also show how the optimal solution varies with path losses and PU’s traffic distribution.
- 1 November 2017
- Published by Zhejiang University Press in Frontiers of Information Technology & Electronic Engineering
- Vol. 18 (11) , 1900-1912
Optimal signal design strategy with improper Gaussian signaling in the Z-interference channel
We propose a thoroughly optimal signal design strategy to achieve the Pareto boundary (boundary of the achievable rate region) with improper Gaussian signaling (IGS) on the Z-interference channel (Z-I
- 1 November 2017
- Published by Zhejiang University Press in Frontiers of Information Technology & Electronic Engineering
- Vol. 18 (11) , 1900-1912
Optimal signal design strategy with improper Gaussian signaling in the Z-interference channel
We propose a thoroughly optimal signal design strategy to achieve the Pareto boundary (boundary of the achievable rate region) with improper Gaussian signaling (IGS) on the Z-interference channel (Z-I