Multi-hop Relaying with Mixed Half and Full Duplex Relays for Offloading to MEC

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F23%3A00374536" target="_blank" >RIV/68407700:21230/23:00374536 - isvavai.cz</a>

Výsledek na webu

<a href="https://doi.org/10.1109/GCWkshps58843.2023.10464927" target="_blank" >https://doi.org/10.1109/GCWkshps58843.2023.10464927</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/GCWkshps58843.2023.10464927" target="_blank" >10.1109/GCWkshps58843.2023.10464927</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Multi-hop Relaying with Mixed Half and Full Duplex Relays for Offloading to MEC

Popis výsledku v původním jazyce

In this paper, we focus on offloading a computing task from a user equipment (UE) to a multi-access edge computing (MEC) server via multi-hop relaying. We assume a general relaying case where relays are energy-constrained devices, such as other UEs, internet of things (IoT) devices, or unmanned aerial vehicles. To this end, we formulate the problem as a minimization of the sum energy consumed by the energy-constrained devices under the constraint on the maximum requested time of the task processing. Then, we propose a multi-hop relaying combining half and full duplexes at each individual relay involved in the offloading. We proof that the proposed multi-hop relaying is convex, thus it can be optimized by conventional convex optimization methods. We show our proposal outperforms existing multi-hop relaying schemes in terms of probability that tasks are processed within required time by up to 38% and, at the same time, decreases energy consumption by up to 28%.

Název v anglickém jazyce

Multi-hop Relaying with Mixed Half and Full Duplex Relays for Offloading to MEC

Popis výsledku anglicky

In this paper, we focus on offloading a computing task from a user equipment (UE) to a multi-access edge computing (MEC) server via multi-hop relaying. We assume a general relaying case where relays are energy-constrained devices, such as other UEs, internet of things (IoT) devices, or unmanned aerial vehicles. To this end, we formulate the problem as a minimization of the sum energy consumed by the energy-constrained devices under the constraint on the maximum requested time of the task processing. Then, we propose a multi-hop relaying combining half and full duplexes at each individual relay involved in the offloading. We proof that the proposed multi-hop relaying is convex, thus it can be optimized by conventional convex optimization methods. We show our proposal outperforms existing multi-hop relaying schemes in terms of probability that tasks are processed within required time by up to 38% and, at the same time, decreases energy consumption by up to 28%.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

20203 - Telecommunications

Projekt

<a href="/cs/project/GA23-05646S" target="_blank" >GA23-05646S: Inteligentní přidělovaní rádiových prostředků a řízení mobility založené na federovaném učení</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2023

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

2023 IEEE Globecom Workshops (GC Wkshps)

ISBN

979-8-3503-7021-8

ISSN

—

e-ISSN

—

Počet stran výsledku

7

Strana od-do

—

Název nakladatele

Institute of Electrical and Electronic Engineers

Místo vydání

Piscataway

Místo konání akce

Kuala Lumpur

Datum konání akce

4. 12. 2023

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—