PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
January 1, 2018IEEE Access230 citationsOpen Access

Offloading Schemes in Mobile Edge Computing for Ultra-Reliable Low Latency Communications

View Full Paper
JLJianhui LiuQZQi Zhang

Key Points

Key points are not available for this paper at this time.

Abstract

The ultra-reliable low latency communications (uRLLC) in the fifth generation mobile communication system aims to support diverse emerging applications with strict requirements of latency and reliability. Mobile edge computing (MEC) is considered as a promising solution to reduce the latency of computation-intensive tasks leveraging powerful computing units at short distance. The state-of-art work on task offloading to MEC mainly focuses on the tradeoff between latency and energy consumption, rather than reliability. In this paper, the tradeoff between the latency and reliability in task offloading to MEC is studied. A framework is provided, where user equipment partitions a task into sub-tasks and offloads them to multiple nearby edge nodes (ENs) in sequence. In this framework, we formulate an optimization problem to jointly minimize the latency and offloading failure probability. Since the formulated problem is nonconvex, we design three algorithms based on heuristic search, reformulation linearization technique and semi-definite relaxation, respectively, and solve the problem through optimizing EN candidates selection, offloading ordering and task allocation. Compared with the previous work, the numerical simulation results show that the proposed algorithms strike a good balance between the latency and reliability in uRLLC. Among them, the Heuristic Algorithm achieves the best performance in terms of the latency and reliability with the minimal complexity.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Liu et al. (2018) studied this question.

synapsesocial.com/papers/6a11c7bca84ddbb210fd3681https://doi.org/10.1109/access.2018.2800032
Ask AI
Helpful
Bookmark
Share
View Full Paper