Yalan Wu

Yalan Wu

Auto-generated profile, based on publicly available information

Yalan Wu

School of Integrated Circuits, Guangdong University of Technology, Guangzhou, China

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
8 September 2021 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
YWYalan Wu
Yalan Wu
JWJigang Wu
Jigang Wu
LCLong CHEN
Long CHEN
JYJiaquan Yan
Jiaquan Yan
YHYinhe Han
Yinhe Han
Load balance in vehicular ad hoc networks (VANETs) is a challenge in vehicle-to-vehicle computation offloading, due to stochastic requests of users, heterogeneous service capabilities and high mobility of vehicles, etc. This paper aims to fill this gap by formulating a problem for load balance in a VANET, with the objective of minimizing the maximum load under transmit power, storage capacity, per task completion time and energy consumption constraints. The formulated problem is proved to be NP-hard, then it is investigated by decomposing it into two subproblems, i.e., how to offload tasks for the case of fixed transmit power and how to adjust transmit power for the given offloading decision. For the first subproblem, an approximation algorithm is proposed by offloading the tasks in the vehicle with the maximum load to the vehicle with minimum load. Meanwhile, a deep reinforcement learning algorithm is proposed, in order to focus on the network dynamics. A coalition based algorithm, a distributed coalition based algorithm, as well as an incentive algorithm based on deep reinforcement learning, are proposed to maximize the total payoff for the selfishness of vehicles. For the second subproblem, an adjustment strategy for transmit power is customized to further reduce the computing load. The algorithms are evaluated on an integrated simulation platform with open street map, SUMO, NS-3 and dataset of Google cluster-usage traces. Simulation results show that, the proposed algorithms outperform three state-of-the-art works for most cases, in terms of the maximum load. The proposed distributed algorithm can significantly accelerate the proposed centralized algorithm with acceptable increase in maximum load. Besides, the load can be further reduced by the proposed adjustment strategy.

1 January 2020 in Computer Communications
Verified
Journal Article
Closed access
YWYalan Wu
Yalan Wu
JWJigang Wu
Jigang Wu
LCLong Chen
Long Chen
JYJiaquan Yan
Jiaquan Yan
YLYuchong Luo
Yuchong Luo

24 July 2023 in IEEE Wireless Communications Letters
Verified
Journal Article
Closed access
LCLong CHEN
Long CHEN
ZJZheng Shao jie
Zheng Shao jie
YWYalan Wu
Yalan Wu
Hong-Ning DaiHong-Ning Dai
Hong-Ning Dai
JWJigang Wu
Jigang Wu
Intelligent edge services should consider not only service provider’s resource constraints but also end user’s quality of experience (QoE) demands. In this regard, we study a digital twin service caching and request routing problem with consideration of both resource and fairness-awareness under the collaboration of multi-access edge computing (MEC) servers. We first formulate the problem as an integer nonlinear programming by maximizing the minimum task completion ratio when there are multiple heterogeneous digital twin services, subject to computation, storage, and heterogeneous task delay constraints. Then, we propose an online stochastic randomized rounding algorithm (ORA) and an efficient online greedy algorithm (OGA) to solve the formulated problem. Extensive simulation results demonstrate the effectiveness of the proposed ORA and OGA algorithms in terms of the minimum application completion ratio.

16 January 2024 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
YWYalan Wu
Yalan Wu
JWJigang Wu
Jigang Wu
LCLong CHEN
Long CHEN
BLBosheng Liu
Bosheng Liu
MYMianyang Yao
Mianyang Yao
SLSiew Kei Lam
Siew Kei Lam
In vehicular edge computing, efficient strategies for model deployment and task offloading offer tremendous potential to reduce response time for machine learning inference. However, existing works do not pay much attention to that there are shared structures among different types of inference tasks. This limits the improvement in response time. This paper aims to fill this gap by investigating a share-aware joint model deployment and task offloading problem for multi-task inference in vehicular edge computing. We formulate the problem with an objective to minimize the total response time of all inference requests, under constraints of per task response time, per roadside unit storage capacity, etc. We prove that the formulated problem is NP-hard. To solve the problem, a time period aware algorithm, called TPA, is proposed with guaranteed approximation ratio. In TPA, an iterative approach is designed to solve the problem of maximizing system throughput during a certain time period. Then, the certain time period approximates to the minimum time period of completing all requests. The algorithms are evaluated in the environment comprising two CPUs, two GPUs, state-of-the-art multi-task learning models and the dataset of Google cluster-usage trace. Simulation results derived from this environment show that, the proposed TPA outperforms the state-of-the-art methods for all cases, in terms of the total response time of all requests. For example, TPA can significantly reduce the total response time by at least $73.72\%$ for different numbers of RSUs considered, compared with state-of-the-art methods.

19 April 2023 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
YWYalan Wu
Yalan Wu
JWJigang Wu
Jigang Wu
MYMianyang Yao
Mianyang Yao
BLBosheng Liu
Bosheng Liu
LCLong CHEN
Long CHEN
SLSiew Kei Lam
Siew Kei Lam
In vehicular networks, task scheduling at the microarchitecture-level and network-level offers tremendous potential to improve the quality of computing services for deep neural network (DNN) inference. However, existing task scheduling works only focus on either one of the two levels, which results in inefficient utilization of computing resources. This paper aims to fill this gap by formulating a two-level scheduling problem for DNN inference tasks in a vehicular network, with an objective of minimizing total weighted sum of response time and energy consumption for all tasks under the following constraints: per task response time, per vehicle energy consumption, per vehicle storage capacity. We first formulate the problem and prove that it is NP-hard. A group transformation based algorithm, called GTA, is proposed. GTA makes scheduling decisions at the network-level using the group transformation based approach, and at the microarchitecture-level using a greedy strategy. In addition, an algorithm, denoted as DRL, is proposed to decrease total weighted sum of response time and energy consumption for all tasks. DRL trains two models with deep reinforcement learning to achieve two-level scheduling. The proposed algorithms are evaluated on a platform consisting of a desktop, Raspberry Pi, Eyeriss, OSM, SUMO, NS-3. Simulation results show that DRL outperforms the state-of-the-art methods for all cases, while the proposed GTA outperforms the state-of-the-art methods for most cases, in terms of total weighted sum of response time and energy consumption. Compared with four baseline algorithms, GTA and DRL reduce the total weighted sum of response time and energy consumption by $41.49\%$ and $62.38\%$ , on average respectively, for different numbers of tasks.

14 November 2022 in ACM Transactions on Internet Technology
Verified
Journal Article
Open access
LCLong CHEN
Long CHEN
MYMianyang Yao
Mianyang Yao
YWYalan Wu
Yalan Wu
JWJigang Wu
Jigang Wu
Multi-access edge computing (MEC) is emerging to improve the quality of experience of mobile devices including internet of things sensors by offloading computing intensive tasks to MEC servers. Existing MEC-enabled cooperative computation offloading works focus on the optimization of total energy consumption but fail to exploit multi-relay diversity and min-max fairness of energy consumption on participated sensors. We explore a typical wireless sensor network with multi-source, multi-relay, and one edge server, where relay nodes can provide both cooperative communication and computation services. We divide the energy efficiency optimization problem into two sub-problems: One is to minimize the weighted average total energy consumption per time slot, and the other is to minimize the maximum weighted energy consumption. For the first sub-problem, we propose an optimal algorithm named as optimal weighted average total energy consumption algorithm (OTCA) based on bipartite matching. For the second sub-problem, greedy algorithm for fairness guarantee (GAF) is proposed with an approximation ratio of (1 + ε), where ε is a small positive constant. Extensive numerical results show that OTCA outperforms the baseline algorithms by 26.7–77.4% on the average total weighted energy consumption while GAF outperforms benchmark algorithms by 30.7–84.4%. NS-3 simulation experiments comply with numerical results.