Journal
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY
Volume 72, Issue 1, Pages 1372-1376Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TVT.2022.3204398
Keywords
Computation offloading; end-to-end latency; Index Terms; multi-access edge computing (MEC); relay; throughput maximization
Ask authors/readers for more resources
As the demand for multi-access edge computing (MEC) increases exponentially, resource limitations at individual edge servers (ESs) become bottlenecks. This paper presents a cooperative MEC framework that enables network-wide cooperation of ESs through multi-hop task relaying. The framework balances the workload for both spot communication and computing, maximizing overall throughput. An optimization problem is formulated and matching theory is applied to find a low-complexity task offloading scheme. Numerical analysis demonstrates the effectiveness of the proposed scheme and the superiority of the multi-hop relay-assisted MEC systems.
As demands for multi-access edge computing (MEC) increase exponentially, resource limitations at individual edge servers (ESs) will inevitably become bottlenecks. Most existing works largely ignore spot access spectrum resource availability when considering computing cooperation among ESs. In this paper, we present a general cooperative MEC framework to enable network-wide cooperation of ESs by leveraging a multi-hop task relaying strategy. Under this framework, we can maximize overall throughput (task completion rate) by balancing the workload for both spot communication and computing through task routing. To address the problem, we formulate an optimization problem and apply matching theory to find a task offloading scheme with low-complexity. Finally, we conduct numerical analysis to show the effectiveness of our proposed scheme and the superiority of our multi-hop relay-assisted MEC systems.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available