Haoqiang Liu

Dr. Haoqiang Liu

orcid

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
10 February 2025 in ACM Computing Surveys
Verified
Journal Article
Open access
TLTong Li
Tong Li
QLQingyue Long
Qingyue Long
HCHaoye Chai
Haoye Chai
SZShiyuan Zhang
Shiyuan Zhang
FJFenyu Jiang
Fenyu Jiang
YLYong Li
Yong Li
The rapid advancement of mobile networks highlights the limitations of traditional network planning and optimization methods, particularly in modeling, evaluation, and application. Network Digital Twins, which simulate networks in the digital domain for evaluation, offer a solution to these challenges. This concept is further enhanced by generative AI technology, which promises more efficient and accurate AI-driven data generation for network simulation and optimization. This survey provides insights into generative AI-empowered network digital twins. We begin by outlining the architecture of a network digital twin, which encompasses both digital and physical domains. This architecture involves four key steps: data processing and network monitoring, digital replication and network simulation, designing and training network optimizers, Sim2Real, and network control. Next, we systematically discuss the related studies in each step and make a detailed taxonomy of the problem studied, the methods used, and the key designs leveraged. Each step is examined with a focus on the role of generative AI, from estimating missing data and simulating network behaviors to designing control strategies and bridging the gap between digital and physical domains. Finally, we discuss the open issues and challenges of generative AI-based network digital twins.

20 December 2021 in IEEE Transactions on Instrumentation and Measurement
Verified
Journal Article
Closed access
HLHaoqiang Liu
Haoqiang Liu
Hongbo ZhaoHongbo Zhao
Hongbo Zhao
JWJiayue Wang
Jiayue Wang
SYShuai Yuan
Shuai Yuan
WFWenquan Feng
Wenquan Feng
Recent years have witnessed that real-time health monitoring for machine gains more and more importance with the goal of achieving fault diagnosis (FD) and predictive maintenance. Conventional diagnosis methods face formidable challenges imposed by the high requirement for expert knowledge and extensive labor. The diagnosis scheme based on deep learning (DL) models has served as a promising solution and achieved great success. However, many of these DL-based models are fail to extract critical temporal information thoroughly. In addition, it is difficult to apply them to machine health monitoring (MHM) in real time as those methods take long time for diagnosis in practice. To address the aforementioned issues, this article introduces a novel intelligent FD algorithm with three stages for MHM. It is a hybrid framework that combines generative adversarial networks (GANs) and autoencoder (AE) based on the bidirectional long short-term memory (bi-LSTM). First, GAN is employed to obtain the reconstruction residual and learn the discriminative representation. Then, AE is used to perform the critical temporal features extraction and dimension reduction. Finally, the supervised learning model is constructed to integrate feature information and predict diagnosis results. To verify the effectiveness of the proposed algorithm, typical rolling bearing datasets are taken as trial data. Preliminary simulation results demonstrate that the proposed algorithm achieves superior performance compared to the competing methods.

18 June 2023
Verified
Conference Paper
Open access
JGJiahui Gong
Jiahui Gong
QYQiaohong Yu
Qiaohong Yu
TLTong Li
Tong Li
HLHaoqiang Liu
Haoqiang Liu
JZJun Zhang
Jun Zhang
YLYong Li
Yong Li

2 August 2023 in Applied Soft Computing
Verified
Journal Article
Closed access
HLHaoqiang Liu
Haoqiang Liu
ZZZefang Zong
Zefang Zong
YLYong Li
Yong Li
DJDepeng Jin
Depeng Jin

11 April 2024 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
HLHaoqiang Liu
Haoqiang Liu
WHWenzhen Huang
Wenzhen Huang
DKDong In Kim
Dong In Kim
SSSumei Sun
Sumei Sun
YZYonghong Zeng
Yonghong Zeng
SHAOHAN FENGSHAOHAN FENG
SHAOHAN FENG
The proliferation of computation-intensive and delay-sensitive applications in the Internet of Vehicles (IoV) poses great challenges to resource-constrained vehicles. To tackle this issue, Mobile Edge Computing (MEC) enabling offloading on-vehicle tasks to edge servers has emerged as a promising approach. MEC jointly augments network computing capabilities and alleviates resource utilization for IoV, garnering substantial attention. Nevertheless, the efficacy of MEC depends heavily on the adopted offloading scheme, especially in the presence of complex subtask dependencies. Existing research has largely overlooked the crucial dependencies among subtasks, which significantly influence the decision making for offloading. This work attempts to schedule subtasks with guaranteed dependencies while minimizing system latency and energy costs in multi-vehicle scenarios. Firstly, we introduce a subtask priority scheduling method on the basis of the Directed Acyclic Graph (DAG) topological structure to ensure the priority order of subtasks, especially in scenarios with complex interdependencies. Secondly, in light of privacy concerns and limited information sharing, we propose an Optimized Distributed Computation Offloading (ODCO) scheme based on deep reinforcement learning (DRL), alleviating the conventional requirement for extensive vehicle-specific information sharing to achieve optimal offloading performance. The adaptive $k$ -step learning approach is further presented to enhance the robustness of the training process. Numerical experiments are presented to demonstrate the advantages of the proposed scheme regarding the substantial reduction in latency and energy cost and, more importantly, the convergence rate in comparison to the existing state-of-the-art offloading schemes. For instance, the ODCO achieved a system utility of approximately 0.80 within 300 episodes, obtaining utility gains of about 0.05 compared to the distributed earliest-finish time offloading (DEFO) algorithm with around 500 episodes.

27 September 2024 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
HLHaoqiang Liu
Haoqiang Liu
TLTong Li
Tong Li
FJFenyu Jiang
Fenyu Jiang
WSWeikang Su
Weikang Su
ZWZhaocheng Wang
Zhaocheng Wang
With the exponential growth of mobile users, ensuring high-quality network coverage has become paramount. Large-scale mobile networks consist of numerous base stations (BSs), each with adjustable parameters such as angles and beam widths. Automatically optimizing network coverage can be difficult due to environmental factors and the interdependence of the adjustable parameters. Due to the inherent uncertainties and unpredictable nature of large-scale wireless networks, traditional methods such as heuristics and meta-heuristics lack the adaptability and scalability required to cope with their dynamic environment. To address these challenges, we propose utilizing digital twin and reinforcement learning (RL) techniques within mobile networks characterized by multiple collaborating agents. We initially introduce DT-SimNet, a digital twin-enabled mobile network simulator to facilitate optimization evaluation. DT-SimNet can efficiently simulate communication behaviors of network elements within a complex environment while revealing user mobility patterns. Moreover, to address challenges arising from multifaceted relationships among users, BSs, and the parameters across BSs, we introduce an innovative strategy named Optimized Multi-Agent Proximal Policy Optimization with Self-supervised Prediction (OMAPPO-SSP). Compared to MAPPO, which leads to limited applicability and inferior performance due to the dynamic characteristics of 5G networks, this approach leverages network structure optimization and a self-supervised prediction mechanism, employing multi-agent reinforcement learning (MARL) principles to enhance efficiency. By harnessing collaborative neural networks, OMAPPO-SSP facilitates the explicit learning of behavioral interactions among all BSs, enabling effective decision-making in environments characterized by intricate spatial relationships, dynamic user behaviors, and diverse interactions. Extensive experiments are conducted to validate the efficiency and effectiveness of the OMAPPO-SSP. Within the target area, OMAPPO-SSP achieves a coverage ratio of 94.66% and an average throughput of 89746 bits per second (bps), demonstrating significant improvements compared to competing methods.