Fully Homomorphic Enabled Secure Task Offloading and Scheduling System for Transport Applications

Kód výsledku v IS VaVaI

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

Výsledek na webu

<a href="https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=9830064" target="_blank" >https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=9830064</a>

DOI - Digital Object Identifier

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

Jazyk výsledku

angličtina

Název v původním jazyce

Fully Homomorphic Enabled Secure Task Offloading and Scheduling System for Transport Applications

Popis výsledku v původním jazyce

With an emerging development in transport technologies, many applications in vehicular environments access roadside unit (RSU) services for tasks offloading. These applications use different types of paid services (e.g., communication, WiFi, and computing nodes) for their execution. The vehicular fog cloud computing (VFCN) is a cooperative computing environment to handle vehicle applications&apos; mobility and resource allocation. However, the aforementioned collaborative VFCN environment still suffers from mobility and security issues in the existing systems. To address the aforementioned issues, in this work we present a cost-efficient and secure VFCN which consists of a mobility-aware multi-scenario offloading phase (MAMSOP) to deal with the mobility and offloading costs. The objective of the work is to execute applications with minimum delays and costs in a secure way. For the security concern, we propose a security scheme based on fully-homomorphism encryption, which encrypts and decrypts data locally and involves computation on encrypted data rather than decrypting it into its original form. As most of the applications have deadline and mobility constraints, so we propose the fully polynomial-time approximation scheme (FPTAS) based search task scheduling (STS) to ensure the execution of all applications within their given constraints. The goal of STS-FPTAS is to determine the delay and cost-aware scheduling into knapsack-aware resources. The knapsack allows all tasks to be allocated to the available length of resources. The results show that the proposed work optimizes the costs by 40% compared to existing systems.

Název v anglickém jazyce

Fully Homomorphic Enabled Secure Task Offloading and Scheduling System for Transport Applications

Popis výsledku anglicky

With an emerging development in transport technologies, many applications in vehicular environments access roadside unit (RSU) services for tasks offloading. These applications use different types of paid services (e.g., communication, WiFi, and computing nodes) for their execution. The vehicular fog cloud computing (VFCN) is a cooperative computing environment to handle vehicle applications&apos; mobility and resource allocation. However, the aforementioned collaborative VFCN environment still suffers from mobility and security issues in the existing systems. To address the aforementioned issues, in this work we present a cost-efficient and secure VFCN which consists of a mobility-aware multi-scenario offloading phase (MAMSOP) to deal with the mobility and offloading costs. The objective of the work is to execute applications with minimum delays and costs in a secure way. For the security concern, we propose a security scheme based on fully-homomorphism encryption, which encrypts and decrypts data locally and involves computation on encrypted data rather than decrypting it into its original form. As most of the applications have deadline and mobility constraints, so we propose the fully polynomial-time approximation scheme (FPTAS) based search task scheduling (STS) to ensure the execution of all applications within their given constraints. The goal of STS-FPTAS is to determine the delay and cost-aware scheduling into knapsack-aware resources. The knapsack allows all tasks to be allocated to the available length of resources. The results show that the proposed work optimizes the costs by 40% compared to existing systems.

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

<a href="/cs/project/EF16_019%2F0000867" target="_blank" >EF16_019/0000867: Centrum výzkumu pokročilých mechatronických systémů</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>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 Transactions on Vehicular Technology

ISSN

0018-9545

e-ISSN

1939-9359

Svazek periodika

71

Číslo periodika v rámci svazku

11

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

14

Strana od-do

12140-12153

Kód UT WoS článku

000888042800063

EID výsledku v databázi Scopus

—