All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

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

The result's identifiers

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

  • Result on the web

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

Alternative languages

  • Result language

    angličtina

  • Original language name

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

  • Original language description

    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.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    20203 - Telecommunications

Result continuities

  • Project

    <a href="/en/project/LUASK22064" target="_blank" >LUASK22064: Predictive allocation of edge computing resources for autonomous driving</a><br>

  • Continuities

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

Others

  • Publication year

    2023

  • Confidentiality

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

Data specific for result type

  • Name of the periodical

    IEEE Transactions on Intelligent Transportation Systems

  • ISSN

    1524-9050

  • e-ISSN

    1558-0016

  • Volume of the periodical

    24

  • Issue of the periodical within the volume

    7

  • Country of publishing house

    DE - GERMANY

  • Number of pages

    14

  • Pages from-to

    7230-7243

  • UT code for WoS article

    000953736700001

  • EID of the result in the Scopus database

    2-s2.0-85151490776