Mianyang Yao

Mianyang Yao

Auto-generated profile, based on publicly available information

Mianyang Yao

School of Computer Science and Technology, Guangdong University of Technology, Guangdong Province, China

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
11 November 2020 in IEEE Transactions on Cloud Computing
Verified
Journal Article
Closed access
LCLong CHEN
Long CHEN
JWJigang Wu
Jigang Wu
JZJun Zhang
Jun Zhang
Hong-Ning DaiHong-Ning Dai
Hong-Ning Dai
XLXin Long
Xin Long
MYMianyang Yao
Mianyang Yao
Most of existing mobile edge computing (MEC) studies consider the remote cloud server as a special edge server, the opportunity of edge-cloud collaboration has not been well exploited. We propose a dependency-aware offloading scheme in MEC with edge-cloud cooperation under task dependency constraints. Each mobile device has a limited budget and has to determine which sub-task should be computed locally or should be sent to the edge or remote cloud. We formulate two NP-hard task finishing time minimization sub-problems. We then devise one greedy algorithm with approximation ratio of ${1+\epsilon}$ for the first mode with edge-cloud cooperation without edge-edge cooperation. Then we design an efficient greedy algorithm for the second mode, considering both edge-cloud and edge-edge cooperations. Extensive simulation results show that for the first mode, the proposed greedy algorithm achieves near optimal performance for typical task topologies. On average, it outperforms the modified Hermes benchmark algorithm by about 23%~43.6% in terms of application finishing time with given budgets. By further exploiting collaborations among edge servers in the second cooperation mode, the proposed algorithm helps to achieve over 20.3% average performance gain on the application finishing time over the first mode under various scenarios. Real-world experiments comply with simulation results.

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.