Blockchain-Based Route Selection With Allocation of Radio and Computing Resources for Connected Autonomous Vehicles

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F23%3A00371907" target="_blank" >RIV/68407700:21230/23:00371907 - isvavai.cz</a>

Výsledek na webu

<a href="https://doi.org/10.1109/TITS.2023.3255301" target="_blank" >https://doi.org/10.1109/TITS.2023.3255301</a>

DOI - Digital Object Identifier

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

Jazyk výsledku

angličtina

Název v původním jazyce

Blockchain-Based Route Selection With Allocation of Radio and Computing Resources for Connected Autonomous Vehicles

Popis výsledku v původním jazyce

With the advent of connected and autonomous vehicles (CAVs), we observe a growing need for new resource allocation solutions in mobile networks. Currently, most of the resource allocation solutions for CAVs communication do not consider the driving routes of the cars. In this paper, we introduce joint vehicular route selection and radio and computing resource allocation for CAVs. The proposed approach is based on the graph search-based lexicographic A* algorithm that minimizes the ratio of failed tasks along the entire vehicular route considering the availability of both radio and computing resources. To manage the allocation of resources among multiple CAVs for each vehicular route, we develop a blockchain-based framework allowing resource reservation by means of nonfungible tokens (NFTs). Each NFT represents an exclusive right to the required amount of radio and computing resources for the given road segment and defined time interval. The effectiveness of the proposed approach is demonstrated by simulations showing that the proposed vehicular route selection algorithm reduces the ratio of tasks not completed before the deadline by up to 69% compared to the existing state-of-the-art algorithms.

Název v anglickém jazyce

Blockchain-Based Route Selection With Allocation of Radio and Computing Resources for Connected Autonomous Vehicles

Popis výsledku anglicky

With the advent of connected and autonomous vehicles (CAVs), we observe a growing need for new resource allocation solutions in mobile networks. Currently, most of the resource allocation solutions for CAVs communication do not consider the driving routes of the cars. In this paper, we introduce joint vehicular route selection and radio and computing resource allocation for CAVs. The proposed approach is based on the graph search-based lexicographic A* algorithm that minimizes the ratio of failed tasks along the entire vehicular route considering the availability of both radio and computing resources. To manage the allocation of resources among multiple CAVs for each vehicular route, we develop a blockchain-based framework allowing resource reservation by means of nonfungible tokens (NFTs). Each NFT represents an exclusive right to the required amount of radio and computing resources for the given road segment and defined time interval. The effectiveness of the proposed approach is demonstrated by simulations showing that the proposed vehicular route selection algorithm reduces the ratio of tasks not completed before the deadline by up to 69% compared to the existing state-of-the-art algorithms.

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/LUASK22064" target="_blank" >LUASK22064: Prediktivní alokace výpočetních prostředků pro autonomní řízení na hraně sítě</a><br>

Návaznosti

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

Rok uplatnění

2023

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 Intelligent Transportation Systems

ISSN

1524-9050

e-ISSN

1558-0016

Svazek periodika

24

Číslo periodika v rámci svazku

7

Stát vydavatele periodika

DE - Spolková republika Německo

Počet stran výsledku

14

Strana od-do

7230-7243

Kód UT WoS článku

000953736700001

EID výsledku v databázi Scopus

2-s2.0-85151490776