Liang Huang

Prof. Liang Huang

Zhejiang University of Technology, Hangzhou, Zhejiang, China
orcid

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

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

Representative Publications

View All Publications
24 July 2019 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
LHLiang Huang
Liang Huang
Suzhi BiSuzhi Bi
Suzhi Bi
YZYing-Jun Angela Zhang
Ying-Jun Angela Zhang

9 June 2021 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
SBSuzhi Bi
Suzhi Bi
LHLiang Huang
Liang Huang
HWHui Wang
Hui Wang
YZYing-Jun Angela Zhang
Ying-Jun Angela Zhang
Opportunistic computation offloading is an effective method to improve the computation performance of mobile-edge computing (MEC) networks under dynamic edge environment. In this paper, we consider a multi-user MEC network with time-varying wireless channels and stochastic user task data arrivals in sequential time frames. In particular, we aim to design an online computation offloading algorithm to maximize the network data processing capability subject to the long-term data queue stability and average power constraints. The online algorithm is practical in the sense that the decisions for each time frame are made without the assumption of knowing the future realizations of random channel conditions and data arrivals. We formulate the problem as a multi-stage stochastic mixed integer non-linear programming (MINLP) problem that jointly determines the binary offloading (each user computes the task either locally or at the edge server) and system resource allocation decisions in sequential time frames. To address the coupling in the decisions of different time frames, we propose a novel framework, named LyDROO, that combines the advantages of Lyapunov optimization and deep reinforcement learning (DRL). Specifically, LyDROO first applies Lyapunov optimization to decouple the multi-stage stochastic MINLP into deterministic per-frame MINLP subproblems. By doing so, it guarantees to satisfy all the long-term constraints by solving the per-frame subproblems that are much smaller in size. Then, LyDROO integrates model-based optimization and model-free DRL to solve the per-frame MINLP problems with very low computational complexity. Simulation results show that under various network setups, the proposed LyDROO achieves optimal computation performance while stabilizing all queues in the system. Besides, it induces very low computation time that is particularly suitable for real-time implementation in fast fading environments.

23 April 2020 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
Suzhi BiSuzhi Bi
Suzhi Bi
LHLiang Huang
Liang Huang
YZYing-Jun Angela Zhang
Ying-Jun Angela Zhang
In mobile edge computing (MEC) systems, edge service caching refers to pre-storing the necessary programs for executing computation tasks at MEC servers. Service caching effectively reduces the real-time delay/bandwidth cost on acquiring and initializing service applications when computation tasks are offloaded to the MEC servers. The limited caching space at resource-constrained edge servers calls for careful design of caching placement to determine which programs to cache over time. This is in general a complicated problem that highly correlates to the computation offloading decisions of computation tasks, i.e., whether or not to offload a task for edge execution. In this paper, we consider a single edge server that assists a mobile user (MU) in executing a sequence of computation tasks. In particular, the MU can upload and run its customized programs at the edge server, while the server can selectively cache the previously generated programs for future reuse. To minimize the computation delay and energy consumption of the MU, we formulate a mixed integer non-linear programming (MINLP) that jointly optimizes the service caching placement, computation offloading decisions, and system resource allocation (e.g., CPU processing frequency and transmit power of MU). To tackle the problem, we first derive the closed-form expressions of the optimal resource allocation solutions, and subsequently transform the MINLP into an equivalent pure 0-1 integer linear programming (ILP) that is much simpler to solve. To further reduce the complexity in solving the ILP, we exploit the underlying structures of caching causality and task dependency models, and accordingly devise a reduced-complexity alternating minimization technique to update the caching placement and offloading decision alternately. Extensive simulations show that the proposed joint optimization techniques achieve substantial resource savings of the MU compared to other representative benchmark methods considered.

19 December 2019 in IEEE Access
Verified
Journal Article
Open access
LHLiang Huang
Liang Huang
WPWeijian Pan
Weijian Pan
YZYou Zhang
You Zhang
Liping QianLiping Qian
Liping Qian
NGNan Gao
Nan Gao
YWYuan Wu
Yuan Wu
Deep learning has recently been applied to automatically classify the modulation categories of received radio signals without manual experience. However, training deep learning models requires massive volume of data. An insufficient training data will cause serious overfitting problem and degrade the classification accuracy. To cope with small dataset, data augmentation has been widely used in image processing to expand the dataset and improve the robustness of deep learning models. However, in wireless communication areas, the effect of different data augmentation methods on radio modulation classification has not been studied yet. In this paper, we evaluate different data augmentation methods via a state-of-the-art deep learning-based modulation classifier. Based on the characteristics of modulated signals, three augmentation methods are considered, i.e., rotation, flip, and Gaussian noise, which can be applied in both training phase and inference phase of the deep learning algorithm. Numerical results show that all three augmentation methods can improve the classification accuracy. Among which, the rotation augmentation method outperforms the flip method, both of which achieve higher classification accuracy than the Gaussian noise method. Given only 12.5% of training dataset, a joint rotation and flip augmentation policy can achieve even higher classification accuracy than the baseline with initial 100% training dataset without augmentation. Furthermore, with data augmentation, radio modulation categories can be successfully classified using shorter radio samples, leading to a simplified deep learning model and shorter the classification response time.

29 November 2018 in Mobile Networks and Applications
Verified
Journal Article
Closed access
PDF file
LHLiang Huang
Liang Huang
FXfeng xu
feng xu
AFAnqi Feng
Anqi Feng
YHYupin Huang
Yupin Huang
Liping QianLiping Qian
Liping Qian

13 July 2022 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
SZShubin Zhang
Shubin Zhang
HGHui Gu
Hui Gu
KCKaikai Chi
Kaikai Chi
LHLiang Huang
Liang Huang
KYKeping Yu
Keping Yu
Shahid MumtazShahid Mumtaz
Shahid Mumtaz
The advanced Internet of Things (IoT) enables more and more interactions between people and machines in the emerging applications, which rely on real-time communication and computing. However, the limited battery capacity and low computing capacity of IoT nodes can hardly support high-performance computing applications. The integration of wireless power transmission (WPT) and mobile edge computing (MEC) is a feasible and promising solution to address the energy shortage and computing capacity limitation of IoT nodes by harvesting radio frequency signal’s energy and offloading the nodes’ computation tasks to edge computing servers (ECSs). In this work, we focus on the wireless powered MEC network with an ECS and multiple edge devices (EDs), and study the joint optimization of WPT duration, transmission time allocation of each ED and partial offloading decision to maximize the sum computation rate. First, we formulate this as a non-convex problem which is hard to solve. Second, to conquer this problem, we decompose the original offloading problem into the sub-problem of optimizing the offloading time allocation among EDs and the proportion of harvested energy allocated for offloading at each ED under a given WPT duration and the top-problem of optimizing the WPT duration. Finally, we design an online DRL-based framework where one DNN together with its exploration strategy and training strategy is adopted to learn the near-optimal WPT duration and an efficient optimal algorithm is designed to solve the sub-problem. Numerical results show that the DRL-based offloading algorithm achieves the near-maximal sum computation rate while greatly reducing the processing time by at least three orders of magnitude compared with using the solver CVX for the sub-problem and the DNN for the top-problem.