Weiguang Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Weiguang Zhang has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Jiarong Liang
School of Computer, Electronics and Information, Guangxi University, Nanning, China
5 shared publications - Xinyu Liang
School of artificial intelligence, GUANGXI MINZU UNIVERSITY, Nanning, China
5 shared publications - Bin Qin
School of Computer
1 shared publication - Chen Guo
School of Electronics and Information Engineering, Jinggangshan University, No. 28 Xueyuan Road, Qingyuan District, Ji’an 343009, China
1 shared publication - Chongxiang Yao
School of Mathematics and Computer Sciences, Nanchang University, Nanchang, China
1 shared publication - Meng Yi
School of Information Technology and Artificial Intelligence, Zhejiang University of Finance and Economics, Hangzhou, China
1 shared publication
Latest Publications
- 8 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 22 (6) , 5550-5563
Efficient Optimization Algorithm for Virtual Backbone in Wireless Sensor Networks by Removing Redundant Dominators
Wireless sensor networks (WSNs) often utilize virtual backbones (VBs) to optimize routing and reduce energy consumption. The effectiveness of this optimization largely depends on the size of the VB, with smaller VBs offering better performance. In WSNs, VBs are typically modeled as connected dominating sets (CDSs) within unit disk graphs (UDGs). However, existing approximation algorithms for constructing the minimum connected dominating set (MCDS) often introduce redundant dominators, leading to inflated CDSs. To tackle this issue, in this paper, we propose a general CDS optimization algorithm named OP-CDS, designed specifically to minimize redundancies. Theoretical analysis shows that the size of the optimized CDS is bounded by α∙opt+δ-k+1, where α∙opt+δ represents the upper bound of the unoptimized CDS, and k denotes the number of OP-CDS iterations. Additionally, extensive simulations demonstrate that OP-CDS can effectively optimize the CDS generated by state-of-the-art algorithms with minimal time consumption.
- 8 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 22 (6) , 5550-5563
Efficient Optimization Algorithm for Virtual Backbone in Wireless Sensor Networks by Removing Redundant Dominators
Wireless sensor networks (WSNs) often utilize virtual backbones (VBs) to optimize routing and reduce energy consumption. The effectiveness of this optimization largely depends on the size of the VB, with smaller VBs offering better performance. In WSNs, VBs are typically modeled as connected dominating sets (CDSs) within unit disk graphs (UDGs). However, existing approximation algorithms for constructing the minimum connected dominating set (MCDS) often introduce redundant dominators, leading to inflated CDSs. To tackle this issue, in this paper, we propose a general CDS optimization algorithm named OP-CDS, designed specifically to minimize redundancies. Theoretical analysis shows that the size of the optimized CDS is bounded by α∙opt+δ-k+1, where α∙opt+δ represents the upper bound of the unoptimized CDS, and k denotes the number of OP-CDS iterations. Additionally, extensive simulations demonstrate that OP-CDS can effectively optimize the CDS generated by state-of-the-art algorithms with minimal time consumption.
- 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.
- 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.
- 5 January 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 21 (8) , 2922-2938
On the Computation of Virtual Backbones With Fault Tolerance in Heterogeneous Wireless Sensor Networks
In the context of wireless sensor networks (WSNs), the problem of virtual backbones (VBs) for undertaking routing tasks to alleviate broadcast storms has been extensively studied. In practical applications, different nodes in a WSN may have different transmission ranges because of differences in power control or functionality, among other reasons. In such a situation, a disk graph (DG) can be used as a mathematical model of the WSN, and a strongly connected dominating and absorbent set (SCDAS) in the DG can be treated as a VB in the corresponding WSN. In a WSN with faulty nodes, a fault-tolerant VB is superior to a traditional one. Thus, it is desirable to construct a$ k$ -strongly connected$ m$ -dominating and absorbent set ($ (k,m)$ -SCDAS) in the DG to serve as a fault-tolerant VB in the corresponding WSN. In this article, to enable the construction of a high-quality$ (k,m)$ -SCDAS in a DG, a constant approximation algorithm with a performance ratio of$(2k(5^{k-1}-1)+1)(R+m+4(\frac{R}{m}+1))$ is proposed, where$ k$ and$ m$ are constants ($ 2 \;\leqslant\; k \;\leqslant\; m$ ) and$ R$ is the maximum number of independent nodes within the transmission range of a node in the DG. A theoretical analysis and simulation results show that our work is superior to previous approaches.- 5 January 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 21 (8) , 2922-2938
On the Computation of Virtual Backbones With Fault Tolerance in Heterogeneous Wireless Sensor Networks
In the context of wireless sensor networks (WSNs), the problem of virtual backbones (VBs) for undertaking routing tasks to alleviate broadcast storms has been extensively studied. In practical applications, different nodes in a WSN may have different transmission ranges because of differences in power control or functionality, among other reasons. In such a situation, a disk graph (DG) can be used as a mathematical model of the WSN, and a strongly connected dominating and absorbent set (SCDAS) in the DG can be treated as a VB in the corresponding WSN. In a WSN with faulty nodes, a fault-tolerant VB is superior to a traditional one. Thus, it is desirable to construct a$ k$ -strongly connected$ m$ -dominating and absorbent set ($ (k,m)$ -SCDAS) in the DG to serve as a fault-tolerant VB in the corresponding WSN. In this article, to enable the construction of a high-quality$ (k,m)$ -SCDAS in a DG, a constant approximation algorithm with a performance ratio of$(2k(5^{k-1}-1)+1)(R+m+4(\frac{R}{m}+1))$ is proposed, where$ k$ and$ m$ are constants ($ 2 \;\leqslant\; k \;\leqslant\; m$ ) and$ R$ is the maximum number of independent nodes within the transmission range of a node in the DG. A theoretical analysis and simulation results show that our work is superior to previous approaches.- 14 October 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 69 (1) , 398-415
Constructing d-Robust Connected Dominating Sets in Wireless Sensor Networks With Unstable Transmission Ranges
A connected dominating set (CDS) can act as a virtual backbone (VB) in a wireless sensor network (WSN). The overhead in a WSN is usually determined by the size of the corresponding VB. However, the construction of minimum CDSs (MCDSs) has been proven to be an NP-hard problem. Thus, most researchers use approximation algorithms to find smaller CDSs. In certain applications, the transmission radii of some nodes in the network are unstable due to certain environmental factors such as obstacles, signal interference and node movement. Thus, the robustness of VBs in WSNs should be considered. In this paper, we propose the concept of a d-robust CDS and corresponding algorithms to construct d-robust CDSs in WSNs with unstable transmission ranges. We propose algorithms for a d-robust CDS that is bounded by [40.68/(1 - d) 2 + 10.17] · opt + [31.32/(1 - d) 2 + 7.83], where opt is the size of the MCDS and d ∈ [0, 1). Through simulations, we show the relationship between the size of the d-robust CDS and the value of d and compare our algorithms with existing algorithms in terms of the robustness degree of the CDS. The results show that the CDSs produced by our algorithms exhibit better robustness.
- 14 October 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 69 (1) , 398-415
Constructing d-Robust Connected Dominating Sets in Wireless Sensor Networks With Unstable Transmission Ranges
A connected dominating set (CDS) can act as a virtual backbone (VB) in a wireless sensor network (WSN). The overhead in a WSN is usually determined by the size of the corresponding VB. However, the construction of minimum CDSs (MCDSs) has been proven to be an NP-hard problem. Thus, most researchers use approximation algorithms to find smaller CDSs. In certain applications, the transmission radii of some nodes in the network are unstable due to certain environmental factors such as obstacles, signal interference and node movement. Thus, the robustness of VBs in WSNs should be considered. In this paper, we propose the concept of a d-robust CDS and corresponding algorithms to construct d-robust CDSs in WSNs with unstable transmission ranges. We propose algorithms for a d-robust CDS that is bounded by [40.68/(1 - d) 2 + 10.17] · opt + [31.32/(1 - d) 2 + 7.83], where opt is the size of the MCDS and d ∈ [0, 1). Through simulations, we show the relationship between the size of the d-robust CDS and the value of d and compare our algorithms with existing algorithms in terms of the robustness degree of the CDS. The results show that the CDSs produced by our algorithms exhibit better robustness.
- Open Access
- 24 February 2020
- Published by Wiley in Complexity
- Vol. 2020, 1-12
On Constructing Strongly Connected Dominating and Absorbing Set in 3-Dimensional Wireless Ad Hoc Networks
In a wireless ad hoc network, the size of the virtual backbone (VB) is an important factor for measuring the quality of the VB. The smaller the VB is, the less the overhead caused by the VB. Since ball graphs (BGs) have been used to model 3-dimensional wireless ad hoc networks and since a connected dominating set can be used to represent a VB undertaking routing-related tasks, the problem of finding the smallest VB is transformed into the problem of finding a minimum connected dominating set (MCDS). Many research results on the MCDS problem have been obtained for unit disk graphs and unit ball graphs, in which the transmission ranges of all nodes are identical. In some situations, the node powers can vary. One can model such a network as a graph with different transmission ranges for different nodes. In this paper, we focus on the problem of minimum strongly connected dominating and absorbing sets (MSCDASs) in a strongly connected directed ball graph with different transmission ranges, which is also NP-hard. We design an algorithm considering the construction of a strongly connected dominating and absorbing set (SCDAS), whose size does not exceed , where is the size of an MCDAS and k denotes the ratio of to in the ad hoc network with transmission range . Our simulations show the feasibility of the algorithm proposed in this paper.- 24 February 2020
- Published by Wiley in Complexity
- Vol. 2020, 1-12
Open AccessOn Constructing Strongly Connected Dominating and Absorbing Set in 3-Dimensional Wireless Ad Hoc Networks
In a wireless ad hoc network, the size of the virtual backbone (VB) is an important factor for measuring the quality of the VB. The smaller the VB is, the less the overhead caused by the VB. Since ball graphs (BGs) have been used to model 3-dimensional wireless ad hoc networks and since a connected dominating set can be used to represent a VB undertaking routing-related tasks, the problem of finding the smallest VB is transformed into the problem of finding a minimum connected dominating set (MCDS). Many research results on the MCDS problem have been obtained for unit disk graphs and unit ball graphs, in which the transmission ranges of all nodes are identical. In some situations, the node powers can vary. One can model such a network as a graph with different transmission ranges for different nodes. In this paper, we focus on the problem of minimum strongly connected dominating and absorbing sets (MSCDASs) in a strongly connected directed ball graph with different transmission ranges, which is also NP-hard. We design an algorithm considering the construction of a strongly connected dominating and absorbing set (SCDAS), whose size does not exceed , where is the size of an MCDAS and k denotes the ratio of to in the ad hoc network with transmission range . Our simulations show the feasibility of the algorithm proposed in this paper.