Wenzhen Huang

Mr. Wenzhen Huang

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
17 August 2023 in Nature Sustainability
Verified
Journal Article
Closed access
PDF file
TLTong Li
Tong Li
LYLi Yu
Li Yu
YMYibo Ma
Yibo Ma
TDTong Duan
Tong Duan
WHWenzhen Huang
Wenzhen Huang
TJTao Jiang
Tao Jiang

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.

21 October 2023
Verified
Conference Paper
Open access
WHWenzhen Huang
Wenzhen Huang
TLTong Li
Tong Li
YCYuting Cao
Yuting Cao
ZLZhe Lyu
Zhe Lyu
YLYanping Liang
Yanping Liang
YLYong Li
Yong Li
As mobile communication technologies advance, mobile networks become increasingly complex, and user requirements become increasingly diverse. To satisfy the diverse demands of users while improving the overall performance of the network system, the limited wireless network resources should be efficiently and dynamically allocated to them based on the magnitude of their demands and their relative location to the base stations. We separated the problem into four constrained subproblems, which we then solved using a safe reinforcement learning method. In addition, we design a reward mechanism to encourage agent cooperation in distributed training environments. We test our methodology in a simulated scenario with thousands of users and hundreds of base stations. According to experimental findings, our method guarantees that over 95% of user demands are satisfied while also maximizing the overall system throughput.

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.

4 August 2023
Verified
Conference Paper
Open access
QHQianyue Hao
Qianyue Hao
WHWenzhen Huang
Wenzhen Huang
TFTao Feng
Tao Feng
JYJian Yuan
Jian Yuan
YLYong Li
Yong Li
Recent advancements in reinforcement learning have witnessed remarkable achievements by intelligent agents ranging from game-playing to industrial applications. Of particular interest is the area of multi-agent reinforcement learning (MARL), which holds significant potential for real-world scenarios. However, typical MARL methods are limited in their ability to handle tens of agents, leaving scenarios with up to hundreds or even thousands of agents almost unexplored. The scaling up of the number of agents presents two primary challenges: (1) agent-agent interactions are crucial in multi-agent systems while the number of interactions grows quadratically with the number of agents, resulting in substantial computational complexity and difficulty in strategies-learning; (2) the strengths of interactions among agents exhibit variations both across agents and over time, making it difficult to precisely model such interactions. In this paper, we propose a novel approach named Graph Attention Mean Field (GAT-MF). By converting agent-agent interactions into interactions between each agent and a weighted mean field, we achieve a substantial reduction in computational complexity. The proposed method offers a precise modeling of interaction dynamics with mathematical proofs of its correctness. Additionally, we design a graph attention mechanism to automatically capture the diverse and time-varying strengths of interactions, ensuring an accurate representation of agent interactions. Through extensive experimentation conducted in both manual and real-world scenarios involving over 3000 agents, we validate the efficacy of our method. The results demonstrate that our method outperforms the best baseline method with a remarkable improvement of 42.7%. Furthermore, our method saves 86.4% training time and 19.2% GPU memory compared to the best baseline method. For reproducibility, our source codes and data are available at https://github.com/tsinghua-fib-lab/Large-Scale-MARL-GATMF.

24 August 2024
Verified
Conference Paper
Open access
JWJingwei Wang
Jingwei Wang
QHQianyue Hao
Qianyue Hao
WHWenzhen Huang
Wenzhen Huang
XFXiaochen Fan
Xiaochen Fan
ZTZhentao Tang
Zhentao Tang
YLYong Li
Yong Li
In large-scale metropolis, it is critical to efficiently allocate various resources such as electricity, medical care, and transportation to meet the living demands of citizens, according to the spatio-temporal distributions of resources and demands. Previous researchers have done plentiful work on such problems by leveraging Multi-Agent Reinforcement Learning (MARL) methods, where multiple agents cooperatively regulate and allocate the resources to meet the demands. However, facing the great number of agents in large cities, existing MARL methods lack efficient parameter sharing strategies among agents to reduce computational complexity. There remain two primary challenges in efficient parameter sharing: (1) during the RL training process, the behavior of agents changes significantly, limiting the performance of group parameter sharing based on fixed role division decided before training; (2) the behavior of agents forms complicated action trajectories, where their role characteristics are implicit, adding difficulty to dynamically adjusting agent role divisions during the training process. In this paper, we propose Dynamic Parameter Sharing (DyPS) to solve the above challenges. We design self-supervised learning tasks to extract the implicit behavioral characteristics from the action trajectories of agents. Based on the obtained behavioral characteristics, we propose a hierarchical MARL framework capable of dynamically revising the agent role divisions during the training process and thus shares parameters among agents with the same role, reducing computational complexity. In addition, our framework can be combined with various typical MARL algorithms, including IPPO, MAPPO, etc. We conduct 7 experiments in 4 representative resource allocation scenarios, where extensive results demonstrate our method's superior performance, outperforming the state-of-the-art baseline methods by up to 31%. Our source codes are available at https://github.com/tsinghua-fib-lab/DyPS.