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

Result code in 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>

Result on the web

<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>

Result language

angličtina

Original language name

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

Original language description

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.

Czech name

—

Czech description

—

Type

J_imp - Article in a specialist periodical, which is included in the Web of Science database

CEP classification

—

OECD FORD branch

20200 - Electrical engineering, Electronic engineering, Information engineering

Project

<a href="/en/project/EF16_019%2F0000867" target="_blank" >EF16_019/0000867: Research Centre of Advanced Mechatronic Systems</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Publication year

2022

Confidentiality

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

Name of the periodical

IEEE Transactions on Vehicular Technology

ISSN

0018-9545

e-ISSN

1939-9359

Volume of the periodical

71

Issue of the periodical within the volume

11

Country of publishing house

US - UNITED STATES

Number of pages

14

Pages from-to

12140-12153

UT code for WoS article

000888042800063

EID of the result in the Scopus database

—