Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Huazheng Du

dblp:129/1299 · also Hua-Zheng Du · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
3since 2021 · last 2023
0000-0002-2217-8198ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 1 first-author · 1 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Wireless sensing and localization · 67% Internet of things and sensor networks · 33%
Theoretical computer science
1 paper
Graph algorithms and graph theory · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Wireless sensing and localization › sensor network localization
graph rigidity
0.312017
Localizability Judgment in UWSNs Based on Skeleton and Rigidity Theory · IEEE Trans. Mob. Comput. 2017
Wireless sensing and localization
sensor network localization
0.312017
Localizability Judgment in UWSNs Based on Skeleton and Rigidity Theory · IEEE Trans. Mob. Comput. 2017
Internet of things and sensor networks
underwater sensor networks
0.312017
Localizability Judgment in UWSNs Based on Skeleton and Rigidity Theory · IEEE Trans. Mob. Comput. 2017
Graph algorithms and graph theory › graph theory › graph realization
graph rigidity
0.112017
Localizability Judgment in UWSNs Based on Skeleton and Rigidity Theory · IEEE Trans. Mob. Comput. 2017

Methods — techniques the papers use, named apart from their topics

rigidity theory · 0.6analytic hierarchy process · 0.6
YearPublicationVenuePosition
2023 IMF2O2: A Fully Connected Sensor Deployment Algorithm for Underwater Sensor Networks
abstract
To address the problems of node deployment schemes in existing underwater sensor networks that lack consideration of network connectivity and high deployment costs, this article constructs an optimization model that maximizes network coverage and minimizes deployment costs while ensuring full connectivity. For the NP-hard property of this optimization model, an improved moth flame optimization node deployment algorithm based on fuzzy operators (IMF 2 O 2 ) is proposed. First, comprehensively considering the two performance metrics of network coverage and network connectivity, a multi-objective selection mechanism based on fuzzy operators is proposed to improve network coverage while ensuring full connectivity. Second, a fixed number of nodes are used to monitor the target event points, transforming the node deployment of sensors into an optimal problem and proposing an improved moth flame optimization algorithm to solve this problem. Finally, the two metrics of coverage and deployment cost are measured and the fuzzy operator is used to select the optimal number of nodes to be deployed. Numerical results showed that the proposed algorithm improved network coverage rate by 10%, 22%, and 25%, and improved network connectivity rate by 12%, 20%, and 8% as compared to PSSD, RAWS, and VODA, respectively, while ensuring full connectivity.
Na Xia, Bin Chen 0006, Huazheng Du, Chaonong Xu, Rong Zheng 0001
ACM Trans. Sens. Networks4
2022 Optimization algorithms in wireless monitoring networks: A survey
Na Xia, Huaizhen Peng, Zhong-Qiu Zhao, Huazheng Du, Yongtang Yu
Neurocomputing7
2021 Channel Assignment Algorithm Based on Discrete BFO for Wireless Monitoring Networks
Na Xia, Lin-Mei Luo, Huazheng Du, Pei-Pei Wang, Yongtang Yu, Ji-Wen Zhang
ICIC (1)3
2017 Localizability Judgment in UWSNs Based on Skeleton and Rigidity Theory
abstract
Underwater sensor networks (UWSNs) have been investigated in a variety of applications such as sea resources reconnaissance, pollution monitoring and tactical monitoring. In 3D underwater environments, it is a key topic to judge the localizability of sensor nodes given known locations of a small set of anchor nodes. In this paper, a novel localizability judgment method for UWSNs is proposed based on rigidity theory. A UWSN is modelled as an undirected graph based on acoustic connectivity. The graph is then reduced to a subgraph with global rigidity, called skeleton, from which the set of localizable sensors can determined. Furthermore, the Analytic Hierarchy Process (AHP) is used to evaluate the localization confidence of localizable sensors. Extensive simulations demonstrate that the proposed localizability judgment method can achieve low false negative rate and high efficiency networks of different sensor numbers and sensor densities. It is also shown to perform well in dynamic networks with relatively low waterflow speed.
Na Xia, Yuanxiao Ou, Shiliang Wang, Rong Zheng 0001, Huazheng Du, Chaonong Xu
IEEE Trans. Mob. Comput.5
2013 A Monte Carlo Enhanced PSO Algorithm for Optimal QoM in Multi-Channel Wireless Networks
Huazheng Du, Na Xia, Rong Zheng 0001
J. Comput. Sci. Technol.1