SMRETO: Stable Matching for Reliable and Efficient Task Offloading in Fog-enabled IoT Networks

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F22%3A10250579" target="_blank" >RIV/61989100:27240/22:10250579 - isvavai.cz</a>

Výsledek na webu

<a href="https://www.scopus.com/record/display.uri?eid=2-s2.0-85140765274&origin=resultslist&sort=plf-f&src=s&sid=10a9f7d31495b1dea273218045886289&sot=a&sdt=a&sl=38&s=AU-ID%2857014879400%29+AND+PUBYEAR+IS+2022&relpos=8&citeCnt=0&searchTerm=" target="_blank" >https://www.scopus.com/record/display.uri?eid=2-s2.0-85140765274&origin=resultslist&sort=plf-f&src=s&sid=10a9f7d31495b1dea273218045886289&sot=a&sdt=a&sl=38&s=AU-ID%2857014879400%29+AND+PUBYEAR+IS+2022&relpos=8&citeCnt=0&searchTerm=</a>

DOI - Digital Object Identifier

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

Jazyk výsledku

angličtina

Název v původním jazyce

SMRETO: Stable Matching for Reliable and Efficient Task Offloading in Fog-enabled IoT Networks

Popis výsledku v původním jazyce

Fog computing is a key technology that supports timely and efficient computation of different tasks in IoT networks. By using the nearby fog nodes for quick task computation, application related decisions by IoT devices can be taken within the delay requirements. Resource allocation in terms of task placement on the free computing resources of the fog nodes is a major challenge in IoT networks. In this paper, we consider task offloading from IoT devices to the logically partitioned fog computing resources known as Virtual Resource Units (VRUs) to reduce the number of task outages and energy consumption of the IoT and fog nodes. We propose a two phased task offloading algorithm to minimize the number of task outages. In the first phase, we utilize the task deadline to compute the minimum number of resources required for a task from the fog nodes. To meet the heterogeneous task computing requirements, we introduce the concept of variable sized VRUs in the fog nodes. Moreover, we propose a modified Deferred Acceptance Algorithm (DAA) for stable matching between IoT tasks and variable sized VRUs. In the second phase of the algorithm, the unmatched fog node resources are distributed among the previously matched IoT tasks. Simulation results show that the proposed algorithm outperforms available techniques in the literature in terms of task outages and energy efficiency.

Název v anglickém jazyce

SMRETO: Stable Matching for Reliable and Efficient Task Offloading in Fog-enabled IoT Networks

Popis výsledku anglicky

Fog computing is a key technology that supports timely and efficient computation of different tasks in IoT networks. By using the nearby fog nodes for quick task computation, application related decisions by IoT devices can be taken within the delay requirements. Resource allocation in terms of task placement on the free computing resources of the fog nodes is a major challenge in IoT networks. In this paper, we consider task offloading from IoT devices to the logically partitioned fog computing resources known as Virtual Resource Units (VRUs) to reduce the number of task outages and energy consumption of the IoT and fog nodes. We propose a two phased task offloading algorithm to minimize the number of task outages. In the first phase, we utilize the task deadline to compute the minimum number of resources required for a task from the fog nodes. To meet the heterogeneous task computing requirements, we introduce the concept of variable sized VRUs in the fog nodes. Moreover, we propose a modified Deferred Acceptance Algorithm (DAA) for stable matching between IoT tasks and variable sized VRUs. In the second phase of the algorithm, the unmatched fog node resources are distributed among the previously matched IoT tasks. Simulation results show that the proposed algorithm outperforms available techniques in the literature in terms of task outages and energy efficiency.

Druh

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

CEP obor

—

OECD FORD obor

20200 - Electrical engineering, Electronic engineering, Information engineering

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2022

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 Access

ISSN

2169-3536

e-ISSN

—

Svazek periodika

10

Číslo periodika v rámci svazku

2022

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

12

Strana od-do

1-12

Kód UT WoS článku

000873684100001

EID výsledku v databázi Scopus

2-s2.0-85140765274