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”

Vehicular Network-Aware Route Selection Considering Communication Requirements of Users for ITS

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F18%3A00304745" target="_blank" >RIV/68407700:21230/18:00304745 - isvavai.cz</a>

  • Result on the web

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

  • DOI - Digital Object Identifier

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

Alternative languages

  • Result language

    angličtina

  • Original language name

    Vehicular Network-Aware Route Selection Considering Communication Requirements of Users for ITS

  • Original language description

    Increasing demands of mobile users on communication and new types of devices, such as sensors, machines, and vehicles, impose high load on cellular networks. Since requirements are expected to rise in a near future, new ways for cellular network offloading are needed. A promising solution for vehicles and vehicular users is to offload data to vehicular networks. To maximize offloading of the cellular networks, the vehicles can be navigated through areas characterized with more available communication capacity. Hence, we propose a novel scalable traveling route selection algorithm determining the route according to a traveling time and available throughput of both cellular and vehicular networks. While the maximum tolerated traveling time is defined by the vehicular users, an estimation of available throughput is based on a vehicular movement prediction. The proposed route selection algorithm is able to offload cellular network by up to 17% and time spent without required quality of connection can be reduced by 65%. At the same time, the traveling time is prolonged only negligibly in comparison with 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

    20201 - Electrical and electronic engineering

Result continuities

  • Project

    <a href="/en/project/LO1505" target="_blank" >LO1505: Support of Sustainability for the Development and Implementation Laboratories of the Czech Technical University in Prague</a><br>

  • Continuities

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

Others

  • Publication year

    2018

  • 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 Systems Journal

  • ISSN

    1932-8184

  • e-ISSN

    1937-9234

  • Volume of the periodical

    12

  • Issue of the periodical within the volume

    2

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    12

  • Pages from-to

    1239-1250

  • UT code for WoS article

    000431399100017

  • EID of the result in the Scopus database

    2-s2.0-84996995515