Huangang Wang

Huangang Wang


Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
14 June 2021 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
ZMZhiyu Mou
Zhiyu Mou
YZYu Zhang
Yu Zhang
FGFeifei Gao
Feifei Gao
HWHuangang Wang
Huangang Wang
TZTao Zhang
Tao Zhang
ZHZhu Han
Zhu Han
Unmanned aerial vehicle (UAV) technology is recognized as a promising solution to area coverage problems (ACPs) and has been extensively studied recently. In this paper, we study the 3D irregular terrain surface coverage problem with a hierarchical UAV swarm. We first build the 3D model of a random irregular terrain and propose a geometric way to project the 3D terrain surface into many weighted 2D patches. Then we develop a two-level hierarchical UAV swarm architecture, including the low-level follower UAVs (FUAVs) and the high-level leader UAVs (LUAVs). For FUAVs, we design a coverage trajectory algorithm to carry out specific coverage tasks within patches based on the star communication topology. For LUAVs, we propose a swarm deep Q-learning (SDQN) reinforcement learning algorithm to select patches. Moreover, an observation history model based on convolutional neural networks (CNNs) and the mean embedding method is integrated into SDQN to address the communication limitation problems of LUAVs. The numerical results show that FUAVs can cover the entire area of each patch with little redundancies, and the total coverage time of the SDQN is less than that of existing methods, which demonstrates the effectiveness of the proposed algorithms.

1 December 2015 in Applied Soft Computing
Verified
Journal Article
Closed access
MAMuzaffer Aslan
Muzaffer Aslan
AŞAbdulkadir Şengür
Abdulkadir Şengür
Yang XiaoYang Xiao
Yang Xiao
HWHaibo Wang
Haibo Wang
MIM. Cevdet Ince
M. Cevdet Ince
XMXin Ma
Xin Ma

14 November 2018 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
XYXiwen Yu
Xiwen Yu
HXHongli Xu
Hongli Xu
DYDa Yao
Da Yao
HWHaibo Wang
Haibo Wang
LHLiusheng Huang
Liusheng Huang
In a software-defined network (SDN), statistics information is of vital importance for different applications, such as traffic engineering, flow rerouting, and attack detection. Since some resources, e.g., ternary content addressable memory, SRAM, and computing capacity, are often limited on SDN switches, traffic measurements based on flow tables or sampling become infeasible. In fact, sketches provide a promising building block for filling this void by monitoring every packet with fixed-size memory. Although many efficient sketches have been designed, our analysis shows that existing sketch-based measurement solutions may suffer from severe computing overhead on switches especially under high traffic load that significantly interferes with switch's basic functions, such as flow rule setup and modification. In this paper, we present CountMax, a lightweight and cooperative sketch for traffic measurement, which can achieve low-amortized processing overhead and tight estimation bounds, to track large flows in SDNs. We also discuss how to apply CountMax to support a variety of applications. We have implemented the proposed algorithm on our open switches. Testbed experiments and extensive simulation results show that CountMax consumes only 1/3-1/2 computing overhead and reduces the average estimation error by 20%-30%, compared with the existing solutions under the same memory size.

18 May 2021 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
HHe Huang
He Huang
YSYu-E Sun
Yu-E Sun
CMChaoyi Ma
Chaoyi Ma
SCShigang Chen
Shigang Chen
YDYang Du
Yang Du
QXQingjun Xiao
Qingjun Xiao
Per-flow spread measurement in high-speed networks has many practical applications. It is a more difficult problem than the traditional per-flow size measurement. Most prior work is based on sketches, focusing on reducing their space requirements in order to fit in on-chip cache memory. This design allows the measurement to be performed at the line rate, but it suffers from expensive computation for spread queries (unsuitable for online operations) and large errors in spread estimation for small flows. This paper complements the prior art with a new spread estimator design based on an on-chip/off-chip model. By storing traffic statistics in off-chip memory, our new design faces a key technical challenge to design an efficient online module of non-duplicate sampling that cuts down the off-chip memory access. We first propose a two-stage solution for non-duplicate sampling, which is efficient but cannot handle well a sampling probability that is either too small or too big. We then address this limitation through a three-stage solution that is more space-efficient. Our analysis shows that the proposed spread estimator is highly configurable for a variety of probabilistic performance guarantees. We implement our spread estimator in hardware using FPGA. The experiment results based on real Internet traffic traces show that our estimator produces spread estimation with much better accuracy than the prior art, reducing the mean relative (absolute) error by about one order of magnitude. Moreover, it increases the query throughput by around three orders of magnitude, making it suitable for supporting online queries in real time.

1 August 2018 in Computer Networks
Verified
Journal Article
Closed access
HWHaibo Wang
Haibo Wang
HXHongli Xu
Hongli Xu
LHLiusheng Huang
Liusheng Huang
JWJianxin Wang
Jianxin Wang
XYXuwei Yang
Xuwei Yang

24 March 2021 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
HWHaibo Wang
Haibo Wang
HXHongli Xu
Hongli Xu
HHe Huang
He Huang
MCMin Chen
Min Chen
SCShigang Chen
Shigang Chen
Multi-access edge computing achieves better application responsiveness by offloading tasks from end devices to edge servers installed at the vicinity. Practical scenarios, such as post-disaster rescuing and battlefield monitoring, make it attractive to use end devices themselves as edge servers. This, however, introduces a new challenge: Due to mobility and power limitation, the set of edge servers becomes dynamic. As some servers fail, the tasks that run on them will also fail. This paper introduces a new dynamic edge computing model and conducts the first study on robust task offloading which is tolerant to $h$ server failures. We propose online primal-dual algorithms that offload tasks as they arrive. We evaluate the performance of our robust task offloading solutions through extensive simulations based on real task sets. The results show that our proposed solutions can well handle edge dynamics and achieve near optimal throughput (above 95 percent) compared to the optimal offline benchmark algorithm.