Hui Liang

Dr. Hui Liang

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
16 January 2018 in IEEE Access
Verified
Journal Article
Open access
Zan LiZan Li
Zan Li
Torsten BraunTorsten Braun
Torsten Braun
XZXiaohui Zhao
Xiaohui Zhao
ZZZhongliang Zhao
Zhongliang Zhao
FHFengye Hu
Fengye Hu
HLHui Liang
Hui Liang
The Internet of Things (IoT) is an emerging paradigm to integrate the physical world into cyber systems by connecting various devices, which sense and control the surrounding objects. For the upcoming IoT era, narrow-band signals will play an important role in the exchange of sensor data and control signals in IoT networks. Indoor positioning is critical for many IoT applications, such as asset tracking, smart buildings, smart e-health, and smart cities, but it is very challenging to achieve accurate indoor positioning with narrowband signals because of multipath propagation. In this paper, we design a positioning system using narrowband signals, particularly ZigBee signals, based on an enhanced fingerprinting algorithm by fusing received signal strength (RSS) and time information. We first investigate the feasibility of time-based fingerprinting by handling the challenges as synchronization compensation among anchor nodes and design of sub-sample timestamps with a resolution of nanoseconds. Second, we design a feature-based fusion approach to fuse and standardize time and RSS fingerprints. Third, we adopt a random forest regression model to design an enhanced pattern matching algorithm for fingerprinting. We implement the proposed algorithms with software-defined radio techniques. In the given experiment results, we find that the positioning system achieves a mean positioning accuracy of 1.61 m, which represents a 36.1% improvement over traditional RSS-based fingerprinting.

16 April 2019 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
MLMingyu Li
Mingyu Li
XZXiaohui Zhao
Xiaohui Zhao
HLHui Liang
Hui Liang
FHFengye Hu
Fengye Hu

19 October 2023 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
WYWeiwei Yang
Weiwei Yang
Long ShiLong Shi
Long Shi
HLHui Liang
Hui Liang
WZWei Zhang
Wei Zhang
The integration of directed acyclic graph (DAG) blockchain and mobile edge computing (MEC) has emerged as a promising means to enable computation-intensive, delay-sensitive, and secure task execution in Internet of Things (IoT) applications. However, off-chain task execution results are not credible even if the results have been recorded on the chain, since blockchain cannot extend the trust of on-chain data to off-chain. To make the off-chain and on-chain trust consistent, we first develop a trusted MEC (T-MEC) framework by employing a DAG blockchain-aided decentralized trust management (DAG-DTM) mechanism. Specifically, DAG-DTM evaluates the off-chain trust of edge nodes according to the quality of task execution results, and the trust can be further verified off the chain by any edge node under the same trust management rule. Moreover, the approval time for recording the execution result of the edge node on the chain is positively correlated with the verified off-chain trust, which can further promote on-chain transaction security of trusted edge node. Second, we jointly optimize the bandwidth and computation resource allocation to minimize the system latency that consists of off-chain task execution delay and on-chain transaction confirmation delay. Numerical results compare system latency and security performance between the optimized T-MEC and the benchmark schemes. In particular, the optimized T-MEC can achieve a 33.12% gain of computation delay and a 10.19% gain of system latency at an affordable cost of transaction confirmation delay (i.e., 3.21%) over T-MEC, while meeting the requirements of off-chain task execution latency and on-chain transaction security simultaneously.

16 June 2020 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
YLYa Li
Ya Li
XZXiaohui Zhao
Xiaohui Zhao
HLHui Liang
Hui Liang
Ultra-dense network (UDN) is considered as one of the key technologies for the explosive growth of mobile traffic demand on the Internet of Things (IoT). It enhances network capacity by deploying small base stations in large quantities, but it simultaneously causes great energy consumption. In this paper, we use energy harvesting (EH) and energy cooperation technologies to maximize system throughput and save energy. Considering that the energy arrival process and channel information are not available a-priori, we propose an optimal deep reinforcement learning (DRL) algorithm to solve this average throughput maximization problem over finite horizon. We also propose a multi-agent deep reinforcement learning method to solve the dimensionality problem caused by the expansion of the state and action dimension. Finally, we compare these algorithms with two traditional algorithms, greedy algorithm and conservative algorithm. The numerical results show that the proposed algorithms are valid and effective in increasing system average throughput on long term.

21 May 2020 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
XMXingchi Mu
Xingchi Mu
XZXiaohui Zhao
Xiaohui Zhao
HLHui Liang
Hui Liang
This paper focuses on the use of a reinforcement learning (RL) approach to find two online power allocation policies in a point to point EH-MIMO wireless communication system. In our study, we train the power allocation policies in order to learn the map between the environment and the agent. Particularly, in order to avoid “dimension disaster” problem which may happen in our proposed SARSA power allocation policy, we introduce a linear approximation method to get an approximate SARSA power allocation policy. The linear approximation can handle infinite number of states and trade-off between complexity and performance of power allocation is significantly improved. The simulation results show that the proposed SARSA and approximate SARSA power allocation policies have a considerable throughput increase compared with the benchmark policies, such as greedy, random and conservative policies.

8 July 2021 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
HLHui Liang
Hui Liang
HLHuan Li
Huan Li
WZWei Zhang
Wei Zhang
Cybertwin is a promising technique in the 6G network to cope with an exponentially increasing demand for the mobile data traffic and growing number of required network service appliances. Multiple resources are required to fulfil various personalized services of mobile users while protecting their privacy. In this article, we propose a progressive adaptive user selection environment (PAUSE)-based combinatorial auction resource trading mechanism to allocate the resource efficiently and securely. Cybertwins can request the various resources as a bid according to its corresponding user and proceed the auction in a fully distributed manner. Not only the user’s privacy can be well protected but also its cost can be saved due to the transparency of this mechanism. Simulation results validate the effectiveness of our mechanism in comparison with the centralized benchmark.