Jiarong Liang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Jiarong Liang has a total of 42 co-authors. Here are the top co-authors by number of shared publications:
- Xinyu Liang
School of artificial intelligence, GUANGXI MINZU UNIVERSITY, Nanning, China
8 shared publications - Changzhen Li
School of Public Policy and Management, Guangxi University, Nanning 530004, China
5 shared publications - Weiguang Zhang
School of Computer, Electronics and Information, Guangxi University, Nanning, China
5 shared publications - Qian Zhang
School of Computer, Electronics and Information, Guangxi University, Nanning, China
3 shared publications - Qingnian Li
College of Information Engineering, Nanning University, Nanning, China
3 shared publications - Yuhao Xie
School of Computers, Electronics and Information and Guangxi Key Laboratory of Multimedia Communications and Network Technology, Guangxi University, Nanning, China
3 shared publications
Latest Publications
- 9 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Cyber-Physical Systems
- Vol. 4, 119-128
A Generative DRL Framework for Adaptive Quality Control in Industrial Cyber-Physical Production Systems
The manufacturing sector faces escalating pressures to enhance production efficiency, product yield, and energy utilization, making Intelligent Quality Inspection (IQI) a cornerstone of product reliability. To address this need, we propose a data-driven decision-making framework for IQI, grounded in generative artificial intelligence and deep reinforcement learning. This study focuses on the component assembly process, a critical stage in manufacturing. We first develop a generative AI-driven daptive framework that constructs a high-fidelity assembly line. This environment realistically incorporates stochastic factors such as component defective rates, inspection mechanisms, and handling strategies for non-conforming products. To provide a rigorous foundation for algorithmic optimization, we formally model this dynamic ecosystem as a Markov Decision Process (MDP), defining its state space and probabilistic transition rules. We then introduce the integrated Rainbow Deep Q-Network (Rainbow DQN) algorithm to solve the resulting multi-step sequential decision-making problem. Our approach leverages the synergistic advantages of multiple DQN extensions to master dynamic quality control policies. Extensive experimental evaluations, including ablation studies and comparisons against benchmark algorithms such as traditional Monte Carlo methods, confirm the superiority of our proposed framework. The results demonstrate significant advantages in convergence speed, decision-making accuracy, and computational efficiency, underscoring its potential to advance the capabilities of intelligent quality inspection in modern industrial cyber-physical systems.
- 9 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Cyber-Physical Systems
- Vol. 4, 119-128
A Generative DRL Framework for Adaptive Quality Control in Industrial Cyber-Physical Production Systems
The manufacturing sector faces escalating pressures to enhance production efficiency, product yield, and energy utilization, making Intelligent Quality Inspection (IQI) a cornerstone of product reliability. To address this need, we propose a data-driven decision-making framework for IQI, grounded in generative artificial intelligence and deep reinforcement learning. This study focuses on the component assembly process, a critical stage in manufacturing. We first develop a generative AI-driven daptive framework that constructs a high-fidelity assembly line. This environment realistically incorporates stochastic factors such as component defective rates, inspection mechanisms, and handling strategies for non-conforming products. To provide a rigorous foundation for algorithmic optimization, we formally model this dynamic ecosystem as a Markov Decision Process (MDP), defining its state space and probabilistic transition rules. We then introduce the integrated Rainbow Deep Q-Network (Rainbow DQN) algorithm to solve the resulting multi-step sequential decision-making problem. Our approach leverages the synergistic advantages of multiple DQN extensions to master dynamic quality control policies. Extensive experimental evaluations, including ablation studies and comparisons against benchmark algorithms such as traditional Monte Carlo methods, confirm the superiority of our proposed framework. The results demonstrate significant advantages in convergence speed, decision-making accuracy, and computational efficiency, underscoring its potential to advance the capabilities of intelligent quality inspection in modern industrial cyber-physical systems.
- 31 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 73 (8) , 6109-6125
Construction of Virtual Backbones With Edge Fault Tolerance in Wireless Networks With Multiple Communication Modes
Over the years, wireless networks (WNs) with multiple communication modes, such as hybrid WNs, have attracted much attention. Generally, a WN with a single communication mode can be abstracted as a unit disk graph (UDG). For a WN with multiple communication modes, there may exist two or more communication modes between two different nodes, and a UDG may not be able to abstract such a WN accurately. This paper proposes a new model called a p -quasi disk graph ( p -QDG) to abstract such WNs with multiple communication modes and investigates the problem of edge fault tolerance in p -QDGs. In this paper, we introduce the concept of a k -edge-connected m -edge-dominated set (in short, ( k , m )-ECDS) in a p -QDG, which can be used to abstract virtual backbones (VBs) with link fault tolerance in WNs abstracted by p -QDGs. Using the concept of a ( k , m )-ECDS, we design an approximation algorithm with a performance ratio of 5 (k-1) * ( m + 2) * max {5 p / m , 1} for the minimum ( k , m )-ECDS problem in p -QDGs. Our simulations show that our proposed algorithm is better than the existing related algorithms in terms of CDS size, running time and success rate.
- 31 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 73 (8) , 6109-6125
Construction of Virtual Backbones With Edge Fault Tolerance in Wireless Networks With Multiple Communication Modes
Over the years, wireless networks (WNs) with multiple communication modes, such as hybrid WNs, have attracted much attention. Generally, a WN with a single communication mode can be abstracted as a unit disk graph (UDG). For a WN with multiple communication modes, there may exist two or more communication modes between two different nodes, and a UDG may not be able to abstract such a WN accurately. This paper proposes a new model called a p -quasi disk graph ( p -QDG) to abstract such WNs with multiple communication modes and investigates the problem of edge fault tolerance in p -QDGs. In this paper, we introduce the concept of a k -edge-connected m -edge-dominated set (in short, ( k , m )-ECDS) in a p -QDG, which can be used to abstract virtual backbones (VBs) with link fault tolerance in WNs abstracted by p -QDGs. Using the concept of a ( k , m )-ECDS, we design an approximation algorithm with a performance ratio of 5 (k-1) * ( m + 2) * max {5 p / m , 1} for the minimum ( k , m )-ECDS problem in p -QDGs. Our simulations show that our proposed algorithm is better than the existing related algorithms in terms of CDS size, running time and success rate.
- 12 September 2024
- Published by Elsevier in Computer Communications
- Vol. 228
On construction of quality virtual backbone in wireless networks using cooperative communication
- 12 September 2024
- Published by Elsevier in Computer Communications
- Vol. 228
On construction of quality virtual backbone in wireless networks using cooperative communication
- Open Access
Edge Caching Data Distribution Strategy with Minimum Energy Consumption
In the context of the rapid development of the Internet of Vehicles, virtual reality, automatic driving and the industrial Internet, the terminal devices in the network show explosive growth. As a result, more and more information is generated from the edge of the network, which makes the data throughput increase dramatically in the mobile communication network. As the key technology of the fifth-generation mobile communication network, mobile edge caching technology which caches popular data to the edge server deployed at the edge of the network avoids the data transmission delay of the backhaul link and the occurrence of network congestion. With the growing scale of the network, distributing hot data from cloud servers to edge servers will generate huge energy consumption. To realize the green and sustainable development of the communication industry and reduce the energy consumption of distribution of data that needs to be cached in edge servers, we make the first attempt to propose and solve the problem of edge caching data distribution with minimum energy consumption (ECDDMEC) in this paper. First, we model and formulate the problem as a constrained optimization problem and then prove its NP-hardness. Subsequently, we design a greedy algorithm with computational complexity of to solve the problem approximately. Experimental results show that compared with the distribution strategy of each edge server directly requesting data from the cloud server, the strategy obtained by the algorithm can significantly reduce the energy consumption of data distribution.Open AccessEdge Caching Data Distribution Strategy with Minimum Energy Consumption
In the context of the rapid development of the Internet of Vehicles, virtual reality, automatic driving and the industrial Internet, the terminal devices in the network show explosive growth. As a result, more and more information is generated from the edge of the network, which makes the data throughput increase dramatically in the mobile communication network. As the key technology of the fifth-generation mobile communication network, mobile edge caching technology which caches popular data to the edge server deployed at the edge of the network avoids the data transmission delay of the backhaul link and the occurrence of network congestion. With the growing scale of the network, distributing hot data from cloud servers to edge servers will generate huge energy consumption. To realize the green and sustainable development of the communication industry and reduce the energy consumption of distribution of data that needs to be cached in edge servers, we make the first attempt to propose and solve the problem of edge caching data distribution with minimum energy consumption (ECDDMEC) in this paper. First, we model and formulate the problem as a constrained optimization problem and then prove its NP-hardness. Subsequently, we design a greedy algorithm with computational complexity of to solve the problem approximately. Experimental results show that compared with the distribution strategy of each edge server directly requesting data from the cloud server, the strategy obtained by the algorithm can significantly reduce the energy consumption of data distribution. - Open Access
t/k-Diagnosability of Regular Networks under the Comparison Model
As multiprocessor systems continue to grow in processor scale, the incidence of faults also increases. As a result, fault diagnosis is becoming a key mechanism for maintaining the normal operation of multiprocessor systems. To explore more effective diagnostic methods, Somani et al. introduced a generalized pessimistic diagnostic strategy, named -diagnosis, in which all faulty nodes are isolated in a set of nodes and at most k fault-free nodes are misdiagnosed, provided that the quantity of faults is limited by t. By imposing certain conditions or restrictions, the -diagnosability of some regular networks under the Preparata, Metze, and Chien (PMC) model has been determined. However, the -diagnosability of many networks under the comparison model remains unidentified. In this paper, we provide new insights into the study of -diagnosability under the comparison model. After introducing some new notions, such as the 0-test unit, 0-test set and 0-test subgraph, under the comparison model, we study the relationship in a system G between the 0-test subgraphs and the components of , where F is the set of faulty nodes, and we obtain some important correlation properties. Based on these results, we study -diagnosability under the comparison model. As a result, the -diagnosability of some regular interconnection networks can be efficiently determined.Open Accesst/k-Diagnosability of Regular Networks under the Comparison Model
As multiprocessor systems continue to grow in processor scale, the incidence of faults also increases. As a result, fault diagnosis is becoming a key mechanism for maintaining the normal operation of multiprocessor systems. To explore more effective diagnostic methods, Somani et al. introduced a generalized pessimistic diagnostic strategy, named -diagnosis, in which all faulty nodes are isolated in a set of nodes and at most k fault-free nodes are misdiagnosed, provided that the quantity of faults is limited by t. By imposing certain conditions or restrictions, the -diagnosability of some regular networks under the Preparata, Metze, and Chien (PMC) model has been determined. However, the -diagnosability of many networks under the comparison model remains unidentified. In this paper, we provide new insights into the study of -diagnosability under the comparison model. After introducing some new notions, such as the 0-test unit, 0-test set and 0-test subgraph, under the comparison model, we study the relationship in a system G between the 0-test subgraphs and the components of , where F is the set of faulty nodes, and we obtain some important correlation properties. Based on these results, we study -diagnosability under the comparison model. As a result, the -diagnosability of some regular interconnection networks can be efficiently determined. - 2 December 2023
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 80 (7) , 9115-9139
On the construction of quality extended virtual backbones in wireless sensor networks using cooperative communication
- 2 December 2023
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 80 (7) , 9115-9139
On the construction of quality extended virtual backbones in wireless sensor networks using cooperative communication
- 13 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 21 (2) , 2064-2076
On Practical Reconstruction of Quality Virtual Backbones in Heterogeneous Wireless Sensor Networks With Faulty Nodes
Frequently, unit disk graphs (UDGs) are used to model homogeneous wireless sensor networks (WSNs), in which each node has the same transmission radius. In some applications, however, different nodes in a WSN have different transmission radii, meaning that a UDG cannot accurately model the WSN. In this case, a disk graph with bidirectional links (DGB) can be used in place of a UDG. Nevertheless, most results reported to date concern the problem of finding minimum fault-tolerant CDSs in UDGs. In this paper, we investigate the minimum fault-tolerant CDS problem for DGBs by reconstructing CDSs for DGBs with faulty nodes. We present a centralized approximation algorithm for CDS reconstruction to address the minimum fault-tolerant CDS problem in given DGBs. The performance ratio (PR) of the presented algorithm is the same as that of the algorithm used to generate the input CDS C. Furthermore, we present a distributed version, which not only can be easily implemented in real situations but also considers CDS size to reduce the network cost. Theoretical analysis shows that the PR of our proposed algorithm is lower than those of other state-of-the-art algorithms for the minimum fault-tolerant CDS problem in given DGBs. In addition, numerical experiments objectively demonstrate that the performance of our algorithm is superior on average to that of its competitors in terms of CDS size, run time and application rate.
- 13 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 21 (2) , 2064-2076
On Practical Reconstruction of Quality Virtual Backbones in Heterogeneous Wireless Sensor Networks With Faulty Nodes
Frequently, unit disk graphs (UDGs) are used to model homogeneous wireless sensor networks (WSNs), in which each node has the same transmission radius. In some applications, however, different nodes in a WSN have different transmission radii, meaning that a UDG cannot accurately model the WSN. In this case, a disk graph with bidirectional links (DGB) can be used in place of a UDG. Nevertheless, most results reported to date concern the problem of finding minimum fault-tolerant CDSs in UDGs. In this paper, we investigate the minimum fault-tolerant CDS problem for DGBs by reconstructing CDSs for DGBs with faulty nodes. We present a centralized approximation algorithm for CDS reconstruction to address the minimum fault-tolerant CDS problem in given DGBs. The performance ratio (PR) of the presented algorithm is the same as that of the algorithm used to generate the input CDS C. Furthermore, we present a distributed version, which not only can be easily implemented in real situations but also considers CDS size to reduce the network cost. Theoretical analysis shows that the PR of our proposed algorithm is lower than those of other state-of-the-art algorithms for the minimum fault-tolerant CDS problem in given DGBs. In addition, numerical experiments objectively demonstrate that the performance of our algorithm is superior on average to that of its competitors in terms of CDS size, run time and application rate.
- 3 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 11 (1) , 1277-1292
On the Reconstruction of a Quality Virtual Backbone in a Wireless Sensor Network With Faulty Links
The work of routing and topological control for a wireless sensor network (WSN) is often undertaken by means of its virtual backbone (VB). Usually, a WSN and its VB can be modeled as a unit disk graph (UDG) and a corresponding connected dominating set (CDS), respectively. A smaller CDS in a UDG is preferred because it will lead to less overhead. In practical applications, sensor nodes or their links in a WSN may fail due to obstacles or accidental damage. Thus, it is desirable to either construct a robust VB or be able to reconstruct a new VB. In this paper, the problem of reconstructing CDSs for UDGs with faulty links is considered. First, we propose a centralized approximation algorithm for the problem. We theoretically show that for a given UDG, the size of the CDS constructed by our algorithm does not exceed $\xi \cdot opt+\gamma +2m$ , where $\xi \cdot opt+\gamma$ is the upper bound on the original CDS size, $opt$ is the minimum CDS size in the UDG, $\xi$ and $\gamma$ are two positive constants, and $m$ is the number of faulty links. Next, we design a distributed approximation algorithm on the basis of our centralized approximation algorithm and analyze its time and message complexity. Related simulation experiments are presented to compare our algorithm with other state-of-the-art algorithms for solving this problem, and the results show that our algorithm outperforms its competitors.
- 3 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 11 (1) , 1277-1292
On the Reconstruction of a Quality Virtual Backbone in a Wireless Sensor Network With Faulty Links
The work of routing and topological control for a wireless sensor network (WSN) is often undertaken by means of its virtual backbone (VB). Usually, a WSN and its VB can be modeled as a unit disk graph (UDG) and a corresponding connected dominating set (CDS), respectively. A smaller CDS in a UDG is preferred because it will lead to less overhead. In practical applications, sensor nodes or their links in a WSN may fail due to obstacles or accidental damage. Thus, it is desirable to either construct a robust VB or be able to reconstruct a new VB. In this paper, the problem of reconstructing CDSs for UDGs with faulty links is considered. First, we propose a centralized approximation algorithm for the problem. We theoretically show that for a given UDG, the size of the CDS constructed by our algorithm does not exceed $\xi \cdot opt+\gamma +2m$ , where $\xi \cdot opt+\gamma$ is the upper bound on the original CDS size, $opt$ is the minimum CDS size in the UDG, $\xi$ and $\gamma$ are two positive constants, and $m$ is the number of faulty links. Next, we design a distributed approximation algorithm on the basis of our centralized approximation algorithm and analyze its time and message complexity. Related simulation experiments are presented to compare our algorithm with other state-of-the-art algorithms for solving this problem, and the results show that our algorithm outperforms its competitors.
- 15 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 32 (1) , 323-337
Approximation Algorithms for Computing Virtual Backbones Considering Routing Costs in Wireless Networks
The strategy of constructing a virtual backbone (VB) to perform routing tasks is considered a mature method for addressing the broadcast storm problem in wireless sensor networks (WSNs). A WSN can be regarded as a unit disk graph (UDG), and its VBs can be regarded as connected dominating sets (CDSs) in the UDG. The smaller the VB is, the less overhead and wireless signal collision and interference there are in the process of communication via the VB. Therefore, when a VB is designed in a WSN, its size is naturally an important factor to be considered. In addition, other factors that are often ignored by researchers, such as the routing cost of the VB, should be considered. In this article, we focus on how to construct a VB with a small size and routing cost in a WSN. We propose two centralized approximation algorithms: one is an algorithm for constructing a VB with a guaranteed routing cost, called RCC-CDS, and the other is an algorithm for constructing a VB with a bounded diameter, called BD-CDS. The performance ratio (PR) of RCC-CDS is 142.758, and that of BD-CDS is 13.596. We compare these two algorithms with previous works though theoretical analysis and simulation experiments on the basis of algorithm performance. The results obtained show that our algorithms have better performance.
- 15 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 32 (1) , 323-337
Approximation Algorithms for Computing Virtual Backbones Considering Routing Costs in Wireless Networks
The strategy of constructing a virtual backbone (VB) to perform routing tasks is considered a mature method for addressing the broadcast storm problem in wireless sensor networks (WSNs). A WSN can be regarded as a unit disk graph (UDG), and its VBs can be regarded as connected dominating sets (CDSs) in the UDG. The smaller the VB is, the less overhead and wireless signal collision and interference there are in the process of communication via the VB. Therefore, when a VB is designed in a WSN, its size is naturally an important factor to be considered. In addition, other factors that are often ignored by researchers, such as the routing cost of the VB, should be considered. In this article, we focus on how to construct a VB with a small size and routing cost in a WSN. We propose two centralized approximation algorithms: one is an algorithm for constructing a VB with a guaranteed routing cost, called RCC-CDS, and the other is an algorithm for constructing a VB with a bounded diameter, called BD-CDS. The performance ratio (PR) of RCC-CDS is 142.758, and that of BD-CDS is 13.596. We compare these two algorithms with previous works though theoretical analysis and simulation experiments on the basis of algorithm performance. The results obtained show that our algorithms have better performance.
- 21 March 2023
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 79 (12) , 13050-13074
Construction of node- and link-fault-tolerant virtual backbones in wireless networks
- 21 March 2023
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 79 (12) , 13050-13074
Construction of node- and link-fault-tolerant virtual backbones in wireless networks