Zhigang 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
Research Subjects
Research Interests
Zhigang Wang has a total of 33 co-authors. Here are the top co-authors by number of shared publications:
- Lianhai Lin
School of Computer, Qinghai Normal University, Xining 810000, China
4 shared publications - Houjun Wang
School of Automation Engineering, University of Electronic Science and Technology of China, Chengdu, China
3 shared publications - Jiawei Cao
University of Electronic Science and Technology of China
3 shared publications - Liqin Tian
School of Computer Science, Qinghai Normal University, Xining, China
3 shared publications - Yinghua Tong
School of Computer, Qinghai Normal University, Xining 810008, China
3 shared publications - Guangkun Luo
Univ Elect Sci & Technol China, Sch Automat Engn, Chengdu 611731, Peoples R China
2 shared publications
Latest Publications
- Open Access
- 19 January 2024
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 19 (1) , e0297066
A PSO-based energy-efficient data collection optimization algorithm for UAV mission planning
With the development of the Internet of Things (IoT), the use of UAV-based data collection systems has become a very popular research topic. This paper focuses on the energy consumption problem of this system. Genetic algorithms and swarm algorithms are effective approaches for solving this problem. However, optimizing UAV energy consumption remains a challenging task due to the inherent characteristics of these algorithms, which make it difficult to achieve the optimum solution. In this paper, a novel particle swarm optimization (PSO) algorithm called Double Self-Limiting PSO (DSLPSO) is proposed to minimize the energy consumption of the unmanned aerial vehicle (UAV). DSLPSO refers to the operational principle of PSO and incorporates two new mechanisms. The first mechanism is to restrict the particle movement, improving the local search capability of the algorithm. The second mechanism dynamically adjusts the search range, which improves the algorithm’s global search capability. DSLPSO employs a variable population strategy that treats the entire population as a single mission plan for the UAV and dynamically adjusts the number of stopping points. In addition, the proposed algorithm was also simulated using public and random datasets. The effectiveness of the proposed DSLPSO and the two new mechanisms has been verified through experiments. The DSLPSO algorithm can effectively improve the lifetime of the UAV, and the two newly proposed mechanisms have potential for optimization work.
- 19 January 2024
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 19 (1) , e0297066
Open AccessA PSO-based energy-efficient data collection optimization algorithm for UAV mission planning
With the development of the Internet of Things (IoT), the use of UAV-based data collection systems has become a very popular research topic. This paper focuses on the energy consumption problem of this system. Genetic algorithms and swarm algorithms are effective approaches for solving this problem. However, optimizing UAV energy consumption remains a challenging task due to the inherent characteristics of these algorithms, which make it difficult to achieve the optimum solution. In this paper, a novel particle swarm optimization (PSO) algorithm called Double Self-Limiting PSO (DSLPSO) is proposed to minimize the energy consumption of the unmanned aerial vehicle (UAV). DSLPSO refers to the operational principle of PSO and incorporates two new mechanisms. The first mechanism is to restrict the particle movement, improving the local search capability of the algorithm. The second mechanism dynamically adjusts the search range, which improves the algorithm’s global search capability. DSLPSO employs a variable population strategy that treats the entire population as a single mission plan for the UAV and dynamically adjusts the number of stopping points. In addition, the proposed algorithm was also simulated using public and random datasets. The effectiveness of the proposed DSLPSO and the two new mechanisms has been verified through experiments. The DSLPSO algorithm can effectively improve the lifetime of the UAV, and the two newly proposed mechanisms have potential for optimization work.
- 13 October 2023
- Published by Elsevier in Digital Signal Processing
- Vol. 143
A real-time dynamic range expansion approach of multi-channel sampling system
- 13 October 2023
- Published by Elsevier in Digital Signal Processing
- Vol. 143
A real-time dynamic range expansion approach of multi-channel sampling system
- Open Access
- 25 June 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (13) , 2846
A Novel Performance Bound for Massive MIMO Enabled HetNets
Massive multiple-input and multiple-output (MIMO) networks with higher throughput rates, where a base station (BS) with a large-scale antenna array serves multiple users, have been widely employed in next-generation wireless communication test systems. Massive MIMO-enabled dense heterogeneous networks (HetNets) have also emerged as a promising architecture to increase the system spectrum efficiency and improve the system reliability. Massive MIMO-enabled HetNets have been successfully exploited in sustainable Internet of Thing networks (IoTs). In order to facilitate the testing and performance estimation of IoTs communication systems, this paper studies the achievable rate performance of massive MIMO and HetNets. Differing from the existing literature, we first consider an interference power model for massive MIMO-enabled HetNets. We next obtain an expression for the signal-to-interference-plus-noise ratio (SINR) by introducing an interference power. Furthermore, we derive a new closed-form lower bound expression for the achievable rate. The proposed closedform expression shows that the achievable rate is an explicit expression of the number of transmit antennas. In simulation results, the impact of the number of transmit antennas on the achievable rate performance is investigated.
- 25 June 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (13) , 2846
Open AccessA Novel Performance Bound for Massive MIMO Enabled HetNets
Massive multiple-input and multiple-output (MIMO) networks with higher throughput rates, where a base station (BS) with a large-scale antenna array serves multiple users, have been widely employed in next-generation wireless communication test systems. Massive MIMO-enabled dense heterogeneous networks (HetNets) have also emerged as a promising architecture to increase the system spectrum efficiency and improve the system reliability. Massive MIMO-enabled HetNets have been successfully exploited in sustainable Internet of Thing networks (IoTs). In order to facilitate the testing and performance estimation of IoTs communication systems, this paper studies the achievable rate performance of massive MIMO and HetNets. Differing from the existing literature, we first consider an interference power model for massive MIMO-enabled HetNets. We next obtain an expression for the signal-to-interference-plus-noise ratio (SINR) by introducing an interference power. Furthermore, we derive a new closed-form lower bound expression for the achievable rate. The proposed closedform expression shows that the achievable rate is an explicit expression of the number of transmit antennas. In simulation results, the impact of the number of transmit antennas on the achievable rate performance is investigated.
- Open Access
- 20 February 2023
- Published by Hindawi Limited in Journal of Advanced Transportation
- Vol. 2023 (1) , 1-21
Data Collection System of IoT Based on the Coordination of Drones and Unmanned Surface Vehicle
With the continuous renewal and rise of various flight equipment, this article designs a method of water data collection, which is realized through the coordination of an unmanned surface vehicle (USV) carrying unmanned aerial vehicles (UAVs, commonly called drones). In reality, multiple UAVs take-off and landing sites, energy consumption, and other complex issues closely related to USV recovery, UAVs must be considered. If mixed integer linear programming (MILP) is used directly, it is difficult to get satisfactory results in an acceptable time range. Therefore, a heuristic algorithm is proposed to solve the problem of data collection by these devices, which can not only quickly solve the large-scale collaborative optimization problem, but also rationally utilize the total energy consumption of the equipment. The effectiveness of the proposed algorithm is verified and analyzed by experimenting a different number of monitoring nodes, different number of UAVs and different task time. It can not only shorten the cycle of data acquisition task, but also reduce the waiting time of the UAV and USV.
- 20 February 2023
- Published by Hindawi Limited in Journal of Advanced Transportation
- Vol. 2023 (1) , 1-21
Open AccessData Collection System of IoT Based on the Coordination of Drones and Unmanned Surface Vehicle
With the continuous renewal and rise of various flight equipment, this article designs a method of water data collection, which is realized through the coordination of an unmanned surface vehicle (USV) carrying unmanned aerial vehicles (UAVs, commonly called drones). In reality, multiple UAVs take-off and landing sites, energy consumption, and other complex issues closely related to USV recovery, UAVs must be considered. If mixed integer linear programming (MILP) is used directly, it is difficult to get satisfactory results in an acceptable time range. Therefore, a heuristic algorithm is proposed to solve the problem of data collection by these devices, which can not only quickly solve the large-scale collaborative optimization problem, but also rationally utilize the total energy consumption of the equipment. The effectiveness of the proposed algorithm is verified and analyzed by experimenting a different number of monitoring nodes, different number of UAVs and different task time. It can not only shorten the cycle of data acquisition task, but also reduce the waiting time of the UAV and USV.
- 26 January 2023
- Published by Elsevier in Digital Signal Processing
- Vol. 136
Proportional fairness secrecy beamforming for massive MIMO-SWIPT systems with low-resolution ADCs
- 26 January 2023
- Published by Elsevier in Digital Signal Processing
- Vol. 136
Proportional fairness secrecy beamforming for massive MIMO-SWIPT systems with low-resolution ADCs
- Open Access
- 12 May 2022
- Published by Hindawi Limited in Wireless Communications and Mobile Computing
- Vol. 2022, 1-23
A Metaheuristic Algorithm for Coverage Enhancement of Wireless Sensor Networks
When wireless sensors are randomly deployed in natural environments such as ecological monitoring, military monitoring, and disaster monitoring, the initial position of sensors is generally formed through deployment methods such as air-drop, and then, the second deployment is carried out through the existing optimization methods, but these methods will still lead to serious coverage holes. In order to solve this problem, this paper proposes an algorithm to improve the coverage rate for wireless sensor networks based on an improved metaheuristic algorithm. The sensor deployment coverage model was firstly established, and the sensor network coverage problem was transformed into a high-dimensional multimodal function optimization problem. Secondly, the global searching ability and searching range of the algorithm are enhanced by the reverse expansion of the initial populations. Finally, the firefly principle is introduced to reduce the local binding force of sparrows and avoid the local optimization problem of the population in the search process. The experimental results showed that compared with ALO, GWO, BES, RK, and SSA algorithms, the EFSSA algorithm is better than other algorithms in benchmark function tests, especially in the test of high-dimensional multimodal function. In the tests of different monitoring ranges and number of nodes, the coverage of EFSSA algorithm is higher than other algorithms. The result can tell that EFSSA algorithm can effectively enhance the coverage of sensor deployment.
- 12 May 2022
- Published by Hindawi Limited in Wireless Communications and Mobile Computing
- Vol. 2022, 1-23
Open AccessA Metaheuristic Algorithm for Coverage Enhancement of Wireless Sensor Networks
When wireless sensors are randomly deployed in natural environments such as ecological monitoring, military monitoring, and disaster monitoring, the initial position of sensors is generally formed through deployment methods such as air-drop, and then, the second deployment is carried out through the existing optimization methods, but these methods will still lead to serious coverage holes. In order to solve this problem, this paper proposes an algorithm to improve the coverage rate for wireless sensor networks based on an improved metaheuristic algorithm. The sensor deployment coverage model was firstly established, and the sensor network coverage problem was transformed into a high-dimensional multimodal function optimization problem. Secondly, the global searching ability and searching range of the algorithm are enhanced by the reverse expansion of the initial populations. Finally, the firefly principle is introduced to reduce the local binding force of sparrows and avoid the local optimization problem of the population in the search process. The experimental results showed that compared with ALO, GWO, BES, RK, and SSA algorithms, the EFSSA algorithm is better than other algorithms in benchmark function tests, especially in the test of high-dimensional multimodal function. In the tests of different monitoring ranges and number of nodes, the coverage of EFSSA algorithm is higher than other algorithms. The result can tell that EFSSA algorithm can effectively enhance the coverage of sensor deployment.
- Open Access
Web User Trust Evaluation: A Novel Approach Using Fuzzy Petri Net and Behavior Analysis
With the development of society and information technology, people’s dependence on the Internet has gradually increased, including online shopping, downloading files, reading books, and online banking. However, how to ensure the safety and legitimacy of these network user behaviors has become the focus of attention. As we all know, cybersecurity and system resilience originate from symmetry. Due to the diversity and unpredictability of cyber-attacks, absolute cybersecurity is difficult to achieve; system resilience indicates that protecting system security should shift from resisting attacks to ensuring system continuity. The trust evaluation of network users is a research hotspot in improving network system security. Aiming at the defects of incomplete evaluation processes and inaccurate evaluation results in current online user behavior trust evaluation methods, this paper combines the basic principles of online user trust evaluation and proposes a trust evaluation model that combines fuzzy Petri nets with user behavior analysis. First, for “unfamiliar” users, we used fuzzy Petri nets to calculate the user’s recommended trust value as the system’s indirect trust value; next, we used the user’s behavior record as evidence to conduct direct trust evaluation on the user to obtain the system’s direct trust in the user’s value; finally, the two calculation results were combined to obtain the user’s comprehensive trust value. In terms of experimental verification, the experimental data came from a self-developed e-book management system. Through theoretical analysis and simulation results, it was shown that the model met the optimization conditions of subjective and objective relative balance, the evaluation process was more complete, and the trust evaluation values of network users could be obtained more accurately. This evaluation method provides solid theory and research ideas for user credibility judgment of key network basic application platforms such as online shopping malls, online transactions, and online banking.
Open AccessWeb User Trust Evaluation: A Novel Approach Using Fuzzy Petri Net and Behavior Analysis
With the development of society and information technology, people’s dependence on the Internet has gradually increased, including online shopping, downloading files, reading books, and online banking. However, how to ensure the safety and legitimacy of these network user behaviors has become the focus of attention. As we all know, cybersecurity and system resilience originate from symmetry. Due to the diversity and unpredictability of cyber-attacks, absolute cybersecurity is difficult to achieve; system resilience indicates that protecting system security should shift from resisting attacks to ensuring system continuity. The trust evaluation of network users is a research hotspot in improving network system security. Aiming at the defects of incomplete evaluation processes and inaccurate evaluation results in current online user behavior trust evaluation methods, this paper combines the basic principles of online user trust evaluation and proposes a trust evaluation model that combines fuzzy Petri nets with user behavior analysis. First, for “unfamiliar” users, we used fuzzy Petri nets to calculate the user’s recommended trust value as the system’s indirect trust value; next, we used the user’s behavior record as evidence to conduct direct trust evaluation on the user to obtain the system’s direct trust in the user’s value; finally, the two calculation results were combined to obtain the user’s comprehensive trust value. In terms of experimental verification, the experimental data came from a self-developed e-book management system. Through theoretical analysis and simulation results, it was shown that the model met the optimization conditions of subjective and objective relative balance, the evaluation process was more complete, and the trust evaluation values of network users could be obtained more accurately. This evaluation method provides solid theory and research ideas for user credibility judgment of key network basic application platforms such as online shopping malls, online transactions, and online banking.
- Open Access
- 1 January 2021
- Published by Wiley in Journal of Sensors
- Vol. 2021 (1)
Lattice‐Based 3‐Dimensional Wireless Sensor Deployment
With the wide application of wireless sensor networks (WSNs) in real space, there are numerous studies on 3D sensor deployments. In this paper, the k‐connectivity theoretical model of fixed and random nodes in regular lattice‐based deployment was proposed to study the coverage and connectivity of sensor networks with regular lattice in 3D space. The full connectivity range and cost of the deployment with sensor nodes fixed in the centers of four regular lattices were quantitatively analyzed. The optimal single lattice coverage model and the ratio of the communication range to the sensing range (rc/rs) were investigated when the deployment of random nodes satisfied the k‐connectivity requirements for full coverage. In addition, based on the actual sensing model, the coverage, communication link quality, and reliability of different lattice‐based deployment models were determined in this study.
- 1 January 2021
- Published by Wiley in Journal of Sensors
- Vol. 2021 (1)
Open AccessLattice‐Based 3‐Dimensional Wireless Sensor Deployment
With the wide application of wireless sensor networks (WSNs) in real space, there are numerous studies on 3D sensor deployments. In this paper, the k‐connectivity theoretical model of fixed and random nodes in regular lattice‐based deployment was proposed to study the coverage and connectivity of sensor networks with regular lattice in 3D space. The full connectivity range and cost of the deployment with sensor nodes fixed in the centers of four regular lattices were quantitatively analyzed. The optimal single lattice coverage model and the ratio of the communication range to the sensing range (rc/rs) were investigated when the deployment of random nodes satisfied the k‐connectivity requirements for full coverage. In addition, based on the actual sensing model, the coverage, communication link quality, and reliability of different lattice‐based deployment models were determined in this study.
- Open Access
A Study of Applying Pulsed Remote Field Eddy Current in Ferromagnetic Pipes Testing
Pulsed Remote Field Eddy Current Testing (PRFECT) attracts the attention in the testing of ferromagnetic pipes because of its continuous spectrum. This paper simulated the practical PRFECT of pipes by using ANSYS software and employed Least Squares Support Vector Regression (LSSVR) to extract the zero-crossing time to analyze the pipe thickness. As a result, a secondary peak is found in zero-crossing time when transmitter passed by a defect. The secondary peak will lead to wrong quantification and the localization of defects, especially when defects are found only at the transmitter location. Aiming to eliminate the secondary peaks, double sensing coils are set in the transition zone and Wiener deconvolution filter is applied. In the proposed method, position dependent response of the differential signals from the double sensing coils is calibrated by employing zero-mean normalization. The methods proposed in this paper are validated by analyzing the simulation signals and can improve the practicality of PRFECT of ferromagnetic pipes.
Open AccessA Study of Applying Pulsed Remote Field Eddy Current in Ferromagnetic Pipes Testing
Pulsed Remote Field Eddy Current Testing (PRFECT) attracts the attention in the testing of ferromagnetic pipes because of its continuous spectrum. This paper simulated the practical PRFECT of pipes by using ANSYS software and employed Least Squares Support Vector Regression (LSSVR) to extract the zero-crossing time to analyze the pipe thickness. As a result, a secondary peak is found in zero-crossing time when transmitter passed by a defect. The secondary peak will lead to wrong quantification and the localization of defects, especially when defects are found only at the transmitter location. Aiming to eliminate the secondary peaks, double sensing coils are set in the transition zone and Wiener deconvolution filter is applied. In the proposed method, position dependent response of the differential signals from the double sensing coils is calibrated by employing zero-mean normalization. The methods proposed in this paper are validated by analyzing the simulation signals and can improve the practicality of PRFECT of ferromagnetic pipes.
- 17 June 2014
- Published by Springer Nature in Circuits, Systems, and Signal Processing
- Vol. 33 (12) , 3697-3712
Analysis of Channel Mismatch Errors in Frequency-Interleaved ADC System
- 17 June 2014
- Published by Springer Nature in Circuits, Systems, and Signal Processing
- Vol. 33 (12) , 3697-3712
Analysis of Channel Mismatch Errors in Frequency-Interleaved ADC System