Abstract

With the rapid increase of data in mobile edge computing (MEC) networks, mobile devices (MDs) have been generating many computation-latency-sensitive tasks. As the MDs are limited by resources in terms of storage, computation, and bandwidth, part of tasks have to be offloaded to the edge of mobile networks or the remote cloud for more efficient processing. Hence, task offloading plays a vital role in this scene. Existing works about task offloading mainly aim at one-shot task offloading and rarely consider the dependencies of tasks. In this paper, we focus on minimizing the maximum delay of processing a series of tasks with dependencies in MEC networks, which supports device-to-device communications. Specifically, we consider task offloading under a hybrid scenario with a small base station (SBS) deployed with an edge server (ES) and several MDs which generate several tasks with dependencies. Then we model the tasks to a weighted directed acyclic graph (DAG) and formulate the optimization problem as minimizing the critical path of the weighted DAG. To tackle this NP-hard problem, we propose a heuristic scheme to iteratively optimize the delay of paths of the weighted DAG under the constraints of the ES. To evaluate the proposed scheme, we perform numerical experiments with different numbers of tasks. Simulation results demonstrate that the proposed scheme outperforms other schemes in terms of reducing the system delay and saving the energy consumption of the MDs.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call