Task Offloading in Multi-hop Relay-aided Multi-access Edge Computing

Yiqin Deng; Zhigang Chen; Xianhao Chen; Yuguang Fang

doi:10.1109/TVT.2022.3204398

Task Offloading in Multi-hop Relay-aided Multi-access Edge Computing

Yiqin Deng, Zhigang Chen, Xianhao Chen^*, Yuguang Fang

^*Corresponding author for this work

Department of Computer Science

Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review

34 Citations (Scopus)

86 Downloads (CityUHK Scholars)

Abstract

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. © 2022 IEEE.

Original language	English
Pages (from-to)	1372-1376
Journal	IEEE Transactions on Vehicular Technology
Volume	72
Issue number	1
Online published	5 Sept 2022
DOIs	https://doi.org/10.1109/TVT.2022.3204398
Publication status	Published - Jan 2023

Research Keywords

computation offloading
Computational modeling
end-to-end latency
Multi-access edge computing
Multi-access edge computing (MEC)
relay
Relay networks (telecommunication)
Routing
Servers
Task analysis
Throughput
throughput maximization

Publisher's Copyright Statement

COPYRIGHT TERMS OF DEPOSITED POSTPRINT FILE: © 2022 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. Deng, Y., Chen, Z., Chen, X., & Fang, Y. (2023). Task Offloading in Multi-hop Relay-aided Multi-access Edge Computing. IEEE Transactions on Vehicular Technology, 72(1), 1372-1376. https://doi.org/10.1109/TVT.2022.3204398

Access Output

10.1109/TVT.2022.3204398

117766368.pdfPost-print, 342 KB

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@article{20255b96b4ce4907a06b4ac80c135213,

title = "Task Offloading in Multi-hop Relay-aided Multi-access Edge Computing",

abstract = "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. {\textcopyright} 2022 IEEE. ",

keywords = "computation offloading, Computational modeling, end-to-end latency, Multi-access edge computing, Multi-access edge computing (MEC), relay, Relay networks (telecommunication), Routing, Servers, Task analysis, Throughput, throughput maximization",

author = "Yiqin Deng and Zhigang Chen and Xianhao Chen and Yuguang Fang",

year = "2023",

month = jan,

doi = "10.1109/TVT.2022.3204398",

language = "English",

volume = "72",

pages = "1372--1376",

journal = "IEEE Transactions on Vehicular Technology",

issn = "0018-9545",

publisher = "IEEE",

number = "1",

}

TY - JOUR

T1 - Task Offloading in Multi-hop Relay-aided Multi-access Edge Computing

AU - Deng, Yiqin

AU - Chen, Zhigang

AU - Chen, Xianhao

AU - Fang, Yuguang

PY - 2023/1

Y1 - 2023/1

N2 - 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. © 2022 IEEE.

AB - 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. © 2022 IEEE.

KW - computation offloading

KW - Computational modeling

KW - end-to-end latency

KW - Multi-access edge computing

KW - Multi-access edge computing (MEC)

KW - relay

KW - Relay networks (telecommunication)

KW - Routing

KW - Servers

KW - Task analysis

KW - Throughput

KW - throughput maximization

UR - http://www.scopus.com/inward/record.url?scp=85137889763&partnerID=8YFLogxK

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-85137889763&origin=recordpage

UR - http://webofscience.com/wos/woscc/full-record/WOS:000966604900001

U2 - 10.1109/TVT.2022.3204398

DO - 10.1109/TVT.2022.3204398

M3 - RGC 21 - Publication in refereed journal

SN - 0018-9545

VL - 72

SP - 1372

EP - 1376

JO - IEEE Transactions on Vehicular Technology

JF - IEEE Transactions on Vehicular Technology

IS - 1

ER -

Task Offloading in Multi-hop Relay-aided Multi-access Edge Computing

Abstract

Research Keywords

Publisher's Copyright Statement

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this