Communication and Computing Task Allocation for Energy-Efficient Fog Networks

Bartosz Kopras; Filip Idzikowski; Bartosz Bossy; Paweł Kryszkiewicz; Hanna Bogucka

doi:10.3390/s23020997

System Informacji Naukowej Politechniki Poznańskiej

PL EN

Strona główna / Publikacje / Communication and Computing Task Allocation for Energy-Efficient Fog Networks

Zgłoś uwagę

Artykuł

Pobierz plik Pobierz BibTeX

Tytuł

Communication and Computing Task Allocation for Energy-Efficient Fog Networks

Autorzy

Bartosz Kopras (WIiT) ^{[ 1 ][ 2.3 ][ SzD ]}
Filip Idzikowski (WIiT) ^{[ 2 ][ 2.3 ][ P ]}
Bartosz Bossy (WIiT) ^{[ 2 ][ 2.3 ][ P ]}
Paweł Kryszkiewicz (WIiT) ^{[ 2 ][ 2.3 ][ P ]}
Hanna Bogucka (WIiT) ^{[ 2 ][ 2.3 ][ P ]}

^{[ 1 ]} Wydział Informatyki i Telekomunikacji, Politechnika Poznańska | ^{[ 2 ]} Instytut Radiokomunikacji, Wydział Informatyki i Telekomunikacji, Politechnika Poznańska | ^{[ SzD ]} doktorant ze Szkoły Doktorskiej | ^{[ P ]} pracownik

Dyscyplina naukowa (Ustawa 2.0)

[2.3] Informatyka techniczna i telekomunikacja

Rok publikacji

2023

Opublikowano w

Sensors

Rocznik: 2023 | Tom: vol. 23 | Numer: iss. 2

Typ artykułu

artykuł naukowy

Język publikacji

angielski

Słowa kluczowe

EN

fog network
energy efficiency
latency
cloud
edge computing

Streszczenie

EN The well known cloud computing is being extended by the idea of fog with the computing nodes placed closer to end users to allow for task processing with tighter latency requirements. However, offloading of tasks (from end devices to either the cloud or to the fog nodes) should be designed taking energy consumption for both transmission and computation into account. The task allocation procedure can be challenging considering the high number of arriving tasks with various computational, communication and delay requirements, and the high number of computing nodes with various communication and computing capabilities. In this paper, we propose an optimal task allocation procedure, minimizing consumed energy for a set of users connected wirelessly to a network composed of FN located at AP and CN. We optimize the assignment of AP and computing nodes to offloaded tasks as well as the operating frequencies of FN. The considered problem is formulated as a Mixed-Integer Nonlinear Programming problem. The utilized energy consumption and delay models as well as their parameters, related to both the computation and communication costs, reflect the characteristics of real devices. The obtained results show that it is profitable to split the processing of tasks between multiple FNs and the cloud, often choosing different nodes for transmission and computation. The proposed algorithm manages to find the optimal allocations and outperforms all the considered alternative allocation strategies resulting in the lowest energy consumption and task rejection rate. Moreover, a heuristic algorithm that decouples the optimization of wireless transmission from implemented computations and wired transmission is proposed. It finds the optimal or close-to-optimal solutions for all of the studied scenarios.

Strony (od-do)

997-1 - 997-22

DOI

10.3390/s23020997

URL

https://www.mdpi.com/1424-8220/23/2/997

Uwagi

article number: 997

Typ licencji

CC BY (uznanie autorstwa)

Tryb otwartego dostępu

otwarte czasopismo