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”

Dynamic Adjustment of Scheduling Period in Mobile Networks Based on C-RAN

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F21%3A00354065" target="_blank" >RIV/68407700:21230/21:00354065 - isvavai.cz</a>

  • Result on the web

    <a href="https://doi.org/10.1109/VTC2021-Fall52928.2021.9625329" target="_blank" >https://doi.org/10.1109/VTC2021-Fall52928.2021.9625329</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1109/VTC2021-Fall52928.2021.9625329" target="_blank" >10.1109/VTC2021-Fall52928.2021.9625329</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Dynamic Adjustment of Scheduling Period in Mobile Networks Based on C-RAN

  • Original language description

    The cloud radio access network (C-RAN) is considered as one of the compelling architectures to meet requirements of the future mobile networks in term of delivering cutting-edge applications and increasing the network flexibility. However, one of the key challenges to cope with in the C-RAN is the fronthaul delay between the baseband unit (BBU) and remote radio head (RRH). The fronthaul delay impacts negatively on various radio resource management techniques including scheduling. The scheduling suffers from the fronthaul due to an additional delay between the time when inputs for the scheduling are provided by the users and the time when the new scheduling is applied. In this paper, we propose a dynamic adjustment of the centralized scheduling period aiming to suppress the negative impact of the fronthaul delay and to increase the network throughput. To this end, we propose two algorithms estimating the scheduling period for individual users: i) from previous channel quality information, and ii) via a prediction of the future channel quality. Simulation results show that both proposed solutions not only provide a network throughput close to the theoretical upper bound but also outperform existing approaches.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    20203 - Telecommunications

Result continuities

  • Project

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2021

  • 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

  • Article name in the collection

    2021 IEEE 94th Vehicular Technology Conference (VTC2021-Fall)

  • ISBN

    978-1-6654-1369-5

  • ISSN

    2577-2465

  • e-ISSN

  • Number of pages

    7

  • Pages from-to

    1-7

  • Publisher name

    IEEE Conference Publications

  • Place of publication

    Piscataway

  • Event location

    Norman, OK

  • Event date

    Sep 27, 2021

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000786411900208