Offloading of Tasks With Tight Delay Requirements via Combined Half and Full Duplex UAV Relays

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F24%3A00377280" target="_blank" >RIV/68407700:21230/24:00377280 - isvavai.cz</a>

Výsledek na webu

<a href="https://doi.org/10.1109/TVT.2024.3393552" target="_blank" >https://doi.org/10.1109/TVT.2024.3393552</a>

DOI - Digital Object Identifier

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

Jazyk výsledku

angličtina

Název v původním jazyce

Offloading of Tasks With Tight Delay Requirements via Combined Half and Full Duplex UAV Relays

Popis výsledku v původním jazyce

In this paper, we focus on offloading of computationally demanding tasks with tight processing delay requirements (hundreds of ms) from user equipments (UEs) to multi-access edge computing servers while exploiting unmanned aerial vehicles (UAVs) as relays. Traditionally addressed problem jointly optimizing an offloading decision and an association of the UEs to the UAVs is, in our work, enriched by optimization of the relaying via UAVs through selection between half-duplex (HD) and full-duplex (FD) under a constraint on the maximum processing delay of individual tasks. To solve this complex problem, we also optimize the length of relaying time slots in HD and the transmission power allocation for the UEs and the UAVs in FD. Then, we transform the problem to one-to-many matching and propose a low-complexity greedy algorithm for the joint offloading decision and UEs association solved together with the duplex selection. We show that our proposal reduces the sum energy consumed by the UEs and UAVs for the tasks offloading by up to 40% compared to related works.

Název v anglickém jazyce

Offloading of Tasks With Tight Delay Requirements via Combined Half and Full Duplex UAV Relays

Popis výsledku anglicky

In this paper, we focus on offloading of computationally demanding tasks with tight processing delay requirements (hundreds of ms) from user equipments (UEs) to multi-access edge computing servers while exploiting unmanned aerial vehicles (UAVs) as relays. Traditionally addressed problem jointly optimizing an offloading decision and an association of the UEs to the UAVs is, in our work, enriched by optimization of the relaying via UAVs through selection between half-duplex (HD) and full-duplex (FD) under a constraint on the maximum processing delay of individual tasks. To solve this complex problem, we also optimize the length of relaying time slots in HD and the transmission power allocation for the UEs and the UAVs in FD. Then, we transform the problem to one-to-many matching and propose a low-complexity greedy algorithm for the joint offloading decision and UEs association solved together with the duplex selection. We show that our proposal reduces the sum energy consumed by the UEs and UAVs for the tasks offloading by up to 40% compared to related works.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

20203 - Telecommunications

Projekt

<a href="/cs/project/LTT20004" target="_blank" >LTT20004: Spolupráce s mezinárodním výzkumným centrem v oblasti digitálních komunikačních systémů</a><br>

Návaznosti

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

Rok uplatnění

2024

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 periodika

IEEE Transactions on Vehicular Technology

ISSN

0018-9545

e-ISSN

1939-9359

Svazek periodika

73

Číslo periodika v rámci svazku

9

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

6

Strana od-do

14086-14091

Kód UT WoS článku

001317694500149

EID výsledku v databázi Scopus

2-s2.0-85191811470