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”

Joint Route Selection and Power Allocation in Multi-hop Cache-enabled Networks

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F24%3A00370514" target="_blank" >RIV/68407700:21230/24:00370514 - isvavai.cz</a>

  • Result on the web

    <a href="https://doi.org/10.1109/WCNC57260.2024.10570676" target="_blank" >https://doi.org/10.1109/WCNC57260.2024.10570676</a>

  • DOI - Digital Object Identifier

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

Alternative languages

  • Result language

    angličtina

  • Original language name

    Joint Route Selection and Power Allocation in Multi-hop Cache-enabled Networks

  • Original language description

    The caching paradigm has been introduced to alleviate backhaul traffic load and to reduce latencies due to massive never ending increase in data traffic. To fully exploit the benefits offered by caching, unmanned aerial vehicles (UAVs) and device-to-device (D2D) communication can be further utilized. In contrast to prior works, that strictly limits the content delivery routes up to two hops, we explore a multi-hop communications scenario, where the UAVs, the UEs, or both can relay the content to individual users. In this context, we formulate the problem for joint route selection and power allocation to minimize the overall system content delivery duration. First, motivated by the limitations of existing works, we consider the case where the nodes may transmit content simultaneously rather than sequentially and propose simple yet effective approach to allocate the transmission power. Second, we design a low-complexity greedy algorithm jointly handling route selection and power allocation. The simulation results demonstrate that the proposed greedy algorithm outperforms the benchmark algorithm by up to 56.98% in terms of content delivery duration while it achieves close-to-optimal performance.

  • 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

    2024

  • 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

    2024 IEEE Wireless Communications and Networking Conference (WCNC)

  • ISBN

    979-8-3503-0358-2

  • ISSN

    1525-3511

  • e-ISSN

    1525-3511

  • Number of pages

    6

  • Pages from-to

    1-6

  • Publisher name

    Institute of Electrical and Electronics Engineers

  • Place of publication

    New York

  • Event location

    Dubai

  • Event date

    Apr 21, 2024

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    001268569301008