Hua Yang
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
Hua Yang has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
Xing Wei
School of Computer Science and Engineering, GuiLin University of Aerospace Technology, GuiLin, China
6 shared publications- Xing Wei
Guangxi Key Laboratory of Low-Altitude Unmanned Autonomous Systems, Guilin University of Aerospace Technology, Guilin, China and School of Computer Science and Engineering, Guilin University of Aerospace Technology, Guilin, China
3 shared publications Zhiyong Liu
Guangxi Colleges and Universities Key Laboratory of Robot and Welding, Guilin University of Aerospace Technology, Guilin, China
3 shared publications- Dennis Wong
Macao Polytechnic University
2 shared publications Wentao Huang
School of Computer Science and Engineering, Guangxi Normal University, Guilin, China
2 shared publications- Bin Qu
School of Computer and Artificial Intelligence, Huanghuai University, Zhumadian, Henan, China
1 shared publication
Latest Publications
- 30 October 2026
- Published by World Scientific Pub Co Pte Ltd in International Journal of Pattern Recognition and Artificial Intelligence
Adaptive FANET Clustering Integrating PSO-Optimized DBSCAN for 3D Dynamic Topologies
In Flying Ad Hoc Networks (FANETs), building a stable and efficient communication backbone faces significant challenges due to the highly dynamic three-dimensional topology, rapid node mobility, and frequent link interruptions. To overcome the inherent limitations of density-based spatial clustering algorithms like Density-based Spatial Clustering of Applications with Noise (DBSCAN), which heavily rely on two static parameters, the neighborhood radius [Formula: see text] and the minimum number of points MinPts, PSO-DBSCAN proposes a novel adaptive clustering protocol that integrates the Particle Swarm Optimization (PSO) algorithm with DBSCAN. The proposed method consists of three stages: First, PSO dynamically optimizes DBSCAN parameters based on the current network topology before each clustering period. Second, DBSCAN is executed using the optimized parameters to form density-based clusters. Finally, a second round of PSO is run within each cluster to elect the optimal cluster head based on a multi-objective fitness function that comprehensively considers residual energy, mobility, node degree, and distance to the cluster center. Simulations conducted on the NS-3 platform demonstrate that PSO-DBSCAN offers significant advantages over benchmark algorithms such as Weighted Clustering Algorithm (WCA) and DBSCAN in terms of clustering quality, cluster stability, control overhead, energy efficiency, and network lifetime. More importantly, the proposed scheme exhibits excellent adaptability to sudden topological changes, providing a robust and scalable solution for dynamic three-dimensional FANET environments.
- 30 October 2026
- Published by World Scientific Pub Co Pte Ltd in International Journal of Pattern Recognition and Artificial Intelligence
Adaptive FANET Clustering Integrating PSO-Optimized DBSCAN for 3D Dynamic Topologies
In Flying Ad Hoc Networks (FANETs), building a stable and efficient communication backbone faces significant challenges due to the highly dynamic three-dimensional topology, rapid node mobility, and frequent link interruptions. To overcome the inherent limitations of density-based spatial clustering algorithms like Density-based Spatial Clustering of Applications with Noise (DBSCAN), which heavily rely on two static parameters, the neighborhood radius [Formula: see text] and the minimum number of points MinPts, PSO-DBSCAN proposes a novel adaptive clustering protocol that integrates the Particle Swarm Optimization (PSO) algorithm with DBSCAN. The proposed method consists of three stages: First, PSO dynamically optimizes DBSCAN parameters based on the current network topology before each clustering period. Second, DBSCAN is executed using the optimized parameters to form density-based clusters. Finally, a second round of PSO is run within each cluster to elect the optimal cluster head based on a multi-objective fitness function that comprehensively considers residual energy, mobility, node degree, and distance to the cluster center. Simulations conducted on the NS-3 platform demonstrate that PSO-DBSCAN offers significant advantages over benchmark algorithms such as Weighted Clustering Algorithm (WCA) and DBSCAN in terms of clustering quality, cluster stability, control overhead, energy efficiency, and network lifetime. More importantly, the proposed scheme exhibits excellent adaptability to sudden topological changes, providing a robust and scalable solution for dynamic three-dimensional FANET environments.
- 6 July 2026
- Published by World Scientific Pub Co Pte Ltd in International Journal of Pattern Recognition and Artificial Intelligence
Topology-Aware Genetic Clustering with Elite Opposition-Based Learning for High-Mobility FANETs
To address the frequent cluster structure reconfiguration caused by the high mobility and dynamic topological changes in Flying Ad Hoc Networks (FANETs), this paper proposes an optimal Cluster Head (CH) selection mechanism based on an adaptive genetic clustering algorithm (AGCA). Traditional clustering methods often struggle with multi-objective conflicts and fixed-length encoding limitations in highly dynamic environments. The proposed AGCA dynamically characterizes the cluster topology using a variable-length genetic encoding scheme to adaptively respond to network scale variations. Furthermore, a comprehensive multi-objective fitness function is constructed to jointly optimize energy balance, communication distance, and topological stability. To enhance cluster quality and accelerate convergence, an Elite Opposition-Based Learning (EOL) strategy and a chaotic initialization method are integrated into the algorithm. Extensive simulation experiments demonstrate that, compared with the classical Weighted Clustering Algorithm (WCA), the proposed AGCA achieves superior performance in highly dynamic FANET environments. Specifically, the ACGA extends the average cluster head lifetime by 22%, reduces end-to-end delay by 23%, increases network throughput by 18%, and decreases control overhead by 30%, thereby verifying its scientific validity and robustness.
- 6 July 2026
- Published by World Scientific Pub Co Pte Ltd in International Journal of Pattern Recognition and Artificial Intelligence
Topology-Aware Genetic Clustering with Elite Opposition-Based Learning for High-Mobility FANETs
To address the frequent cluster structure reconfiguration caused by the high mobility and dynamic topological changes in Flying Ad Hoc Networks (FANETs), this paper proposes an optimal Cluster Head (CH) selection mechanism based on an adaptive genetic clustering algorithm (AGCA). Traditional clustering methods often struggle with multi-objective conflicts and fixed-length encoding limitations in highly dynamic environments. The proposed AGCA dynamically characterizes the cluster topology using a variable-length genetic encoding scheme to adaptively respond to network scale variations. Furthermore, a comprehensive multi-objective fitness function is constructed to jointly optimize energy balance, communication distance, and topological stability. To enhance cluster quality and accelerate convergence, an Elite Opposition-Based Learning (EOL) strategy and a chaotic initialization method are integrated into the algorithm. Extensive simulation experiments demonstrate that, compared with the classical Weighted Clustering Algorithm (WCA), the proposed AGCA achieves superior performance in highly dynamic FANET environments. Specifically, the ACGA extends the average cluster head lifetime by 22%, reduces end-to-end delay by 23%, increases network throughput by 18%, and decreases control overhead by 30%, thereby verifying its scientific validity and robustness.
- 6 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Consumer Electronics
- Vol. 72 (1) , 353-360
Continuous Hopfield Neural Network (CHNN)-Based Clustering Optimization Scheme for FANETs
With the rapid development of UAV technology, Flying Ad hoc Network (FANET) has become a core network architecture in military, disaster relief, and other fields due to its potential for efficient communication and collaboration in dynamic environments. However, existing clustering algorithms exhibit significant drawbacks in dynamic adaptability, parameter adjustment complexity, and network robustness. To address these challenges, this paper proposes a clustering optimization algorithm CHNN-CA based on a continuous Hopfield neural network (CHNN). The goal is to enhance the stability and efficiency of FANETs through multi-objective dynamic balance optimization. A CHNN optimization model that incorporates node mobility prediction and energy sensing is constructed to cope with the network’s time-varying characteristics. Additionally, a dynamic penalty function is designed to strengthen cluster size and connectivity constraints, ensuring the convergence of the algorithm under topology uncertainty. Simulation results demonstrate that CHNN-CA achieves a 23.6% improvement in cluster stability and an 18.9% reduction in control overhead compared to the traditional weighted clustering algorithm (WCA) under highly dynamic scenarios. The algorithm also simplifies parameter tuning through a lightweight adaptive function and combines link quality and multi-hop coverage mechanisms to effectively address the problem of cluster head over-density in large-scale networks. This provides an innovative solution for efficient management of dynamic FANETs.
- 6 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Consumer Electronics
- Vol. 72 (1) , 353-360
Continuous Hopfield Neural Network (CHNN)-Based Clustering Optimization Scheme for FANETs
With the rapid development of UAV technology, Flying Ad hoc Network (FANET) has become a core network architecture in military, disaster relief, and other fields due to its potential for efficient communication and collaboration in dynamic environments. However, existing clustering algorithms exhibit significant drawbacks in dynamic adaptability, parameter adjustment complexity, and network robustness. To address these challenges, this paper proposes a clustering optimization algorithm CHNN-CA based on a continuous Hopfield neural network (CHNN). The goal is to enhance the stability and efficiency of FANETs through multi-objective dynamic balance optimization. A CHNN optimization model that incorporates node mobility prediction and energy sensing is constructed to cope with the network’s time-varying characteristics. Additionally, a dynamic penalty function is designed to strengthen cluster size and connectivity constraints, ensuring the convergence of the algorithm under topology uncertainty. Simulation results demonstrate that CHNN-CA achieves a 23.6% improvement in cluster stability and an 18.9% reduction in control overhead compared to the traditional weighted clustering algorithm (WCA) under highly dynamic scenarios. The algorithm also simplifies parameter tuning through a lightweight adaptive function and combines link quality and multi-hop coverage mechanisms to effectively address the problem of cluster head over-density in large-scale networks. This provides an innovative solution for efficient management of dynamic FANETs.
- 16 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Consumer Electronics
- Vol. 71 (2) , 3903-3912
Q-Learning Enabled Ant Colony (Q-ANT)-Based Navigation Optimization Framework for UAVs
Flying ad-hoc networks (FANETs) composed of unmanned aerial vehicles (UAVs) which are serving in both military as well as civilian domains. The environmental changes and alterations in network topology present considerable challenges to communication among drone swarms. Consequently, there is an imperative need to investigate a high-performance routing scheme for UAV based FANETs. In this study, a routing scheme is introduced that employs the reinforcement Q-learning algorithm to enhance the ant colony optimization routing protocol (Q-ANT). The primary innovation of this scheme lies in the implementation of a neighborhood link selection mechanism that incorporates link residual time and link signal strength. This approach addresses the inadequacy of relying solely on a single indicator for assessing link residual survival time and expedites the convergence velocity of the ant colony routing algorithm. Q-ANT possesses the capability to optimize its routing strategy in accordance with the prevailing network environment by utilizing the Q-learning algorithm to attain the ideal option strategy in response to environmental fluctuations. The proposed scheme is implemented within the NS3 simulation environment and scenario-based simulation experiments have been conducted on three critical network metrics: network lifetime, end-to-end delay, and packet delivery rate. The experimental results exhibit the superiority of Q-ANT in terms of minimal energy consumption, minimal latency, and an enhanced packet delivery rate to the existing approaches such as FAnt-HocNet and Q-learning based QRF.
- 16 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Consumer Electronics
- Vol. 71 (2) , 3903-3912
Q-Learning Enabled Ant Colony (Q-ANT)-Based Navigation Optimization Framework for UAVs
Flying ad-hoc networks (FANETs) composed of unmanned aerial vehicles (UAVs) which are serving in both military as well as civilian domains. The environmental changes and alterations in network topology present considerable challenges to communication among drone swarms. Consequently, there is an imperative need to investigate a high-performance routing scheme for UAV based FANETs. In this study, a routing scheme is introduced that employs the reinforcement Q-learning algorithm to enhance the ant colony optimization routing protocol (Q-ANT). The primary innovation of this scheme lies in the implementation of a neighborhood link selection mechanism that incorporates link residual time and link signal strength. This approach addresses the inadequacy of relying solely on a single indicator for assessing link residual survival time and expedites the convergence velocity of the ant colony routing algorithm. Q-ANT possesses the capability to optimize its routing strategy in accordance with the prevailing network environment by utilizing the Q-learning algorithm to attain the ideal option strategy in response to environmental fluctuations. The proposed scheme is implemented within the NS3 simulation environment and scenario-based simulation experiments have been conducted on three critical network metrics: network lifetime, end-to-end delay, and packet delivery rate. The experimental results exhibit the superiority of Q-ANT in terms of minimal energy consumption, minimal latency, and an enhanced packet delivery rate to the existing approaches such as FAnt-HocNet and Q-learning based QRF.
- 14 April 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 10 (21) , 18837-18843
Low-Delay Routing Scheme for UAV Communications in Smart Cities
UAV, particularly UAV self-assembly network or flying ad hoc network, is one of the most promising wireless network technologies in smart cities and the future 6G era. To satisfy the low delay demands of communication routing in FANETs, we offer an optimized routing scheme based on OLSR routing to overcome additional routing overhead caused by link interruptions due to node movement. With the use of the NS3 network simulation platform, the performance metrics of OLSRs improved and original algorithms are evaluated. Simulations demonstrate that this improved algorithm is significantly more usable and scalable with respect to a number of important metrics, including routing overhead, average delay, and packet delivery rate.
- 14 April 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 10 (21) , 18837-18843
Low-Delay Routing Scheme for UAV Communications in Smart Cities
UAV, particularly UAV self-assembly network or flying ad hoc network, is one of the most promising wireless network technologies in smart cities and the future 6G era. To satisfy the low delay demands of communication routing in FANETs, we offer an optimized routing scheme based on OLSR routing to overcome additional routing overhead caused by link interruptions due to node movement. With the use of the NS3 network simulation platform, the performance metrics of OLSRs improved and original algorithms are evaluated. Simulations demonstrate that this improved algorithm is significantly more usable and scalable with respect to a number of important metrics, including routing overhead, average delay, and packet delivery rate.
- Open Access
- 15 February 2023
- Published by Frontiers Media SA in Frontiers in Energy Research
- Vol. 11
Effects of dynamic characteristics of a pipe network on indoor temperature of households
District heating has always been regarded as a convenient and environmentally friendly heating method. However, the district heating process involves a considerable amount of wasted energy. To improve the operational strategies of heating networks and heating quality, reduce energy waste, promote the sustainable development of resources and cities, it is necessary to investigate the dynamic characteristics of pipe networks. This paper describes the dynamic characteristics of a pipe network in which the intermittent operation of the primary pipe network were adjusted. The effects of the dynamic characteristics of the pipe network on the indoor temperature of households are numerically analyzed. When the primary network stops and the secondary network continues working, the indoor temperature begins to decrease, slowly at first, and then more quickly. The indoor temperature of households in the system remains unchanged for a short period before starting to drop with the increase of the time. It takes about 150–245 min for the indoor temperature in the heating system to drop to 16°C. The smaller the room area, the larger the area of the envelope structure, and the faster the room temperature drops. The higher the intermittent heating temperature, the longer it takes for the indoor temperature to drop to 16°C. An intermittent heating temperature of 5°C or above ensures that every household in the heating system retains an indoor temperature above 16°C after 2 h.
- 15 February 2023
- Published by Frontiers Media SA in Frontiers in Energy Research
- Vol. 11
Open AccessEffects of dynamic characteristics of a pipe network on indoor temperature of households
District heating has always been regarded as a convenient and environmentally friendly heating method. However, the district heating process involves a considerable amount of wasted energy. To improve the operational strategies of heating networks and heating quality, reduce energy waste, promote the sustainable development of resources and cities, it is necessary to investigate the dynamic characteristics of pipe networks. This paper describes the dynamic characteristics of a pipe network in which the intermittent operation of the primary pipe network were adjusted. The effects of the dynamic characteristics of the pipe network on the indoor temperature of households are numerically analyzed. When the primary network stops and the secondary network continues working, the indoor temperature begins to decrease, slowly at first, and then more quickly. The indoor temperature of households in the system remains unchanged for a short period before starting to drop with the increase of the time. It takes about 150–245 min for the indoor temperature in the heating system to drop to 16°C. The smaller the room area, the larger the area of the envelope structure, and the faster the room temperature drops. The higher the intermittent heating temperature, the longer it takes for the indoor temperature to drop to 16°C. An intermittent heating temperature of 5°C or above ensures that every household in the heating system retains an indoor temperature above 16°C after 2 h.
- 25 April 2022
- Published by Springer Nature in Soft Computing
- Vol. 26 (22) , 12385-12391
A Boltzmann machine optimizing dynamic routing for FANETs
- 25 April 2022
- Published by Springer Nature in Soft Computing
- Vol. 26 (22) , 12385-12391
A Boltzmann machine optimizing dynamic routing for FANETs
- Open Access
- 29 November 2021
- Published by Springer Nature in Research Square
A Boltzmann Machine Optimizing Dynamic Routing for FANETs
Routing optimization for FANETs is a kind of NP-hard in the field of combinatorial optimization that describes simple and difficult to handle. The quality of routing has a direct impact on the network quality of FANETs, and the design of routing protocols becomes a very challenging topic in FANETs. In this paper, we study the characteristics of dynamic routing, combine the characteristics of FANETs themselves, use the energy of nodes, bandwidth, link stability, etc. as the metric of routing, and use Boltzmann machine for routing search to form an optimized dynamic routing protocol. The NS3 simulation simulator is used to compare and study with traditional MANET dynamic routing AODV and DSR, and the simulation results show that the routes obtained by using Boltzmann machine search are better than AODV and DSR in many aspects such as end-to-end average delay, average route survival time and control overhead.
- 29 November 2021
- Published by Springer Nature in Research Square
Open AccessA Boltzmann Machine Optimizing Dynamic Routing for FANETs
Routing optimization for FANETs is a kind of NP-hard in the field of combinatorial optimization that describes simple and difficult to handle. The quality of routing has a direct impact on the network quality of FANETs, and the design of routing protocols becomes a very challenging topic in FANETs. In this paper, we study the characteristics of dynamic routing, combine the characteristics of FANETs themselves, use the energy of nodes, bandwidth, link stability, etc. as the metric of routing, and use Boltzmann machine for routing search to form an optimized dynamic routing protocol. The NS3 simulation simulator is used to compare and study with traditional MANET dynamic routing AODV and DSR, and the simulation results show that the routes obtained by using Boltzmann machine search are better than AODV and DSR in many aspects such as end-to-end average delay, average route survival time and control overhead.
- Open Access
- 15 June 2021
- Published by Frontiers Media SA in Frontiers in Neurorobotics
- Vol. 15
A Genetic-Algorithm-Based Optimization Routing for FANETs
In view of the characteristics of high mobility of FANETs nodes, combined with the features of Topology-based class routing protocol on-demand search, a Genetic-algorithm-based routing (GAR) protocol is proposed for FANETs which based on improved genetic algorithm for FANETs route search, and it taking into account the link stability, link bandwidth, node energy, and other factors. GAR improves the selection, crossover, and variation operators of the genetic algorithm so that GAR can finally plan an optimized route from the communication initiating node to the destination node quickly using a smaller cost. The experimental results show that GAR can largely improve the throughput, reduce the delay and improve the stability of the network, which is more suitable for FANETs.
- 15 June 2021
- Published by Frontiers Media SA in Frontiers in Neurorobotics
- Vol. 15
Open AccessA Genetic-Algorithm-Based Optimization Routing for FANETs
In view of the characteristics of high mobility of FANETs nodes, combined with the features of Topology-based class routing protocol on-demand search, a Genetic-algorithm-based routing (GAR) protocol is proposed for FANETs which based on improved genetic algorithm for FANETs route search, and it taking into account the link stability, link bandwidth, node energy, and other factors. GAR improves the selection, crossover, and variation operators of the genetic algorithm so that GAR can finally plan an optimized route from the communication initiating node to the destination node quickly using a smaller cost. The experimental results show that GAR can largely improve the throughput, reduce the delay and improve the stability of the network, which is more suitable for FANETs.
- 14 December 2020
- Published by River Publishers in Journal of Web Engineering
- Vol. 19 (5-6) , 865–882
An Application of CHNN for FANETs Routing Optimization
Routing algorithm has a decisive influence on routing quality, and routing quality has a direct impact on network performance. For FANETs, the highly dynamically changing topology poses a challenge to the design of routing algorithms. The paper studies the characteristics of FANETs, and uses a CHNN to search for FANETs routing to form CHNNR. Using NS3 as a simulation tool, a highly dynamic simulation scheme in the background of the network topology of the air flight platform was designed, making the simulation scene closer to the dynamic performance of the FANETs highly dynamic mobile node. By comparing parameters such as network delay, normalized network throughput, routing load and data transmission success rate, the performance of CHNNR and passive routing algorithms is analyzed and compared. The simulation results show that the comprehensive performance of CHNNR is better than other passive routing algorithms, and it is more suitable for FANETs networks where nodes move at a high speed and the network topology changes frequently, and lay the foundation for the next research.
- 14 December 2020
- Published by River Publishers in Journal of Web Engineering
- Vol. 19 (5-6) , 865–882
An Application of CHNN for FANETs Routing Optimization
Routing algorithm has a decisive influence on routing quality, and routing quality has a direct impact on network performance. For FANETs, the highly dynamically changing topology poses a challenge to the design of routing algorithms. The paper studies the characteristics of FANETs, and uses a CHNN to search for FANETs routing to form CHNNR. Using NS3 as a simulation tool, a highly dynamic simulation scheme in the background of the network topology of the air flight platform was designed, making the simulation scene closer to the dynamic performance of the FANETs highly dynamic mobile node. By comparing parameters such as network delay, normalized network throughput, routing load and data transmission success rate, the performance of CHNNR and passive routing algorithms is analyzed and compared. The simulation results show that the comprehensive performance of CHNNR is better than other passive routing algorithms, and it is more suitable for FANETs networks where nodes move at a high speed and the network topology changes frequently, and lay the foundation for the next research.