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

Huitao Wang

dblp:146/5200 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
1since 2021 · last 2021
0000-0002-3625-1675ORCID · corroborated

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

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

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
Optical networks · 100%

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

TopicWeightPapersLastEvidence papers
Optical networks
optical signal processing
0.312017
Modulation format independent blind polarization demultiplexing algorithms for elastic optical networks · Sci. China Inf. Sci. 2017
Optical networks
elastic optical networks
0.112017
Modulation format independent blind polarization demultiplexing algorithms for elastic optical networks · Sci. China Inf. Sci. 2017

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

blind demultiplexing algorithms · 0.3
YearPublicationVenuePosition
2021 Research on the Difficulty of Mobile Node Deployment's Self-Play in Wireless Ad Hoc Networks Based on Deep Reinforcement Learning
abstract
Deep reinforcement learning is one kind of machine learning algorithms which uses the maximum cumulative reward to learn the optimal strategy. The difficulty is how to ensure the fast convergence of the model and generate a large number of sample data to promote the model optimization. Using the deep reinforcement learning framework of the AlphaZero algorithm, the deployment problem of wireless nodes in wireless ad hoc networks is equivalent to the game of Go. A deployment model of mobile nodes in wireless ad hoc networks based on the AlphaZero algorithm is designed. Because the application scenario of wireless ad hoc network does not have the characteristics of chessboard symmetry and invariability, it cannot expand the data sample set by rotating and changing the chessboard orientation. The strategy of dynamic updating learning rate and the method of selecting the latest model to generate sample data are used to solve the problem of fast model convergence.
Huitao Wang, Ruopeng Yang, Changsheng Yin, Xiaofei Zou
Wirel. Commun. Mob. Comput.1
2020 Deploying tactical communication node vehicles with AlphaZero algorithm
abstract
The construction of mobile ad‐hoc networks on the battlefield is mainly planned by staff or automatically planned with the help of network topology planning models in the network planning software. Most of these algorithms are actually more or less based on human knowledge or thinking ways to model network entities, environments, and rules, and the accuracy and rationality of models are not strong enough to match the changed battlefield. The AlphaZero algorithm generalised in chess and other games provides a new intelligent method to solve complex problems in the military field. Based on the AlphaZero algorithm, this study proposes a method for intelligent deployment of mobile ad‐hoc networks with tactical communication node vehicles. Making an analogy between deploying tactical communication node vehicles and playing Go, the authors construct a deep reinforcement learning model for deployment of communication node vehicles. Starting from random play, and giving no domain knowledge, only setting the judgment of the network structure, with training the designing strategy value deep neural network by self‐play reinforcement learning, they successfully deployed communication node vehicles on tabula rasa map and constructed battlefield mobile ad‐hoc networks with deep reinforcement learning and Monte–Carlo tree search.
Xiaofei Zou, Ruopeng Yang, Changsheng Yin, Zongzhe Nie, Huitao Wang
IET Commun.5
2017 Modulation format independent blind polarization demultiplexing algorithms for elastic optical networks
Xue Chen 0006, Erkun Sun, Huitao Wang, Taili Wang, Min Zhang 0016, Jie Zhang 0006, Yuefeng Ji
Sci. China Inf. Sci.5