Mianyang Yao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Mianyang Yao has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Jigang Wu
School of Computer Science and Technology, Guangdong University of Technology, Guangzhou, China
2 shared publications - Long Chen
School of Computer Science and Technology, Guangdong University of Technology, Guangzhou, China
2 shared publications - Hong-Ning Dai
Hong Kong Baptist University
1 shared publication - Jun Zhang
Hong Kong University of Science and Technology, Hong Kong, Hong Kong
1 shared publication - Xin Long
School of Computer Science and Technology Guangdong University of Technology 510006 Guangzhou Guangdong
1 shared publication - Yalan Wu
School of Integrated Circuits, Guangdong University of Technology, Guangzhou, China
1 shared publication
Latest Publications
- Open Access
- 14 November 2022
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Internet Technology
- Vol. 22 (4) , 1-30
EECDN: Energy-efficient Cooperative DNN Edge Inference in Wireless Sensor Networks
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.
- 14 November 2022
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Internet Technology
- Vol. 22 (4) , 1-30
Open AccessEECDN: Energy-efficient Cooperative DNN Edge Inference in Wireless Sensor Networks
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.
- 11 November 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cloud Computing
- Vol. 10 (4) , 2451-2468
Dependency-Aware Computation Offloading for Mobile Edge Computing With Edge-Cloud Cooperation
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.- 11 November 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cloud Computing
- Vol. 10 (4) , 2451-2468
Dependency-Aware Computation Offloading for Mobile Edge Computing With Edge-Cloud Cooperation
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.