Long Chen, Jigang Wu, Jun Zhang, Hong Ning Dai, Xin Long, Mianyang Yao

Research output: Journal article publicationJournal articleAcademic researchpeer-review

Abstract

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 <formula><tex>${1+\epsilon}$</tex></formula> 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.

Original language English IEEE Transactions on Cloud Computing https://doi.org/10.1109/TCC.2020.3037306 Accepted/In press - 2020

Keywords

• Cooperation
• Graph
• Mobile Edge Computing