Wenxing Wu
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
Wenxing Wu has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Liqin Tian
School of Computer Science, Qinghai Normal University, Xining, China
3 shared publications - Lianhai Lin
School of Computer, Qinghai Normal University, Xining 810000, China
2 shared publications - Yinghua Tong
School of Computer, Qinghai Normal University, Xining 810008, China
2 shared publications - Zhigang Wang
School of Automation Engineering, University of Electronic Science and Technology of China, Chengdu 611731, China
2 shared publications - Jianfei Xie
North China Institute of Science Technology,Department of Internet of Things Engineering,Hebei,China
1 shared publication - Junyi Wu
School of Computer Science, Qinghai Normal University, Xining 810008, China
1 shared publication
Latest Publications
- Open Access
- 12 December 2025
- Published by Association for Computing Machinery (ACM)
- p. 445-450
Domain-Specific Datasets with Abundant Layout Categories for Accident Investigation
- 12 December 2025
- Published by Association for Computing Machinery (ACM)
- p. 445-450
Open AccessDomain-Specific Datasets with Abundant Layout Categories for Accident Investigation
- Open Access
- 14 October 2025
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 20 (10) , e0331713
Multi-objective dung beetle optimization algorithm: A novel algorithm for solving complex multi-objective optimization problems
Many increasingly complex multi-objective optimization problems are emerging, and there is an urgent need to develop new multi-objective optimization algorithms to meet the challenges. This study introduces the Multi-Objective Dung Beetle Optimization Algorithm (MODBO), which integrates competitive and neighborhood mechanisms to tackle such problems, Thanks to the dung beetle optimization algorithm’s fast convergence and robust optimization finding ability in single-objective optimization algorithms. The introduction of non-dominated sorting allows the Dung Beetle Optimization Algorithm to solve multi-objective optimization problems (MOPs). To make the Dung Beetle Optimization Algorithm maintain good search ability in searching, we introduce a Competition mechanism to guide the particles’ global optimal search and a Neighborhood mechanism to guide the particles’ local optimal value search. An external archive is introduced to make each generation positionally optimal. Finally, to analyze whether the MODBO algorithm’s improved strategy is effective, a comparison with the nine algorithms on CEC2020 was made, and the 3D sensor deployment problem was used to demonstrate that the MODBO algorithm can solve realistic problems.
- 14 October 2025
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 20 (10) , e0331713
Open AccessMulti-objective dung beetle optimization algorithm: A novel algorithm for solving complex multi-objective optimization problems
Many increasingly complex multi-objective optimization problems are emerging, and there is an urgent need to develop new multi-objective optimization algorithms to meet the challenges. This study introduces the Multi-Objective Dung Beetle Optimization Algorithm (MODBO), which integrates competitive and neighborhood mechanisms to tackle such problems, Thanks to the dung beetle optimization algorithm’s fast convergence and robust optimization finding ability in single-objective optimization algorithms. The introduction of non-dominated sorting allows the Dung Beetle Optimization Algorithm to solve multi-objective optimization problems (MOPs). To make the Dung Beetle Optimization Algorithm maintain good search ability in searching, we introduce a Competition mechanism to guide the particles’ global optimal search and a Neighborhood mechanism to guide the particles’ local optimal value search. An external archive is introduced to make each generation positionally optimal. Finally, to analyze whether the MODBO algorithm’s improved strategy is effective, a comparison with the nine algorithms on CEC2020 was made, and the 3D sensor deployment problem was used to demonstrate that the MODBO algorithm can solve realistic problems.
- 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.
- 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.