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 Transmission Power Allocation for Cache-enabled Multi-hop Networks

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F25%3A00385243" target="_blank" >RIV/68407700:21230/25:00385243 - isvavai.cz</a>

  • Result on the web

    <a href="https://doi.org/10.1109/WCNC61545.2025.10978786" target="_blank" >https://doi.org/10.1109/WCNC61545.2025.10978786</a>

  • DOI - Digital Object Identifier

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

Alternative languages

  • Result language

    angličtina

  • Original language name

    Dynamic Transmission Power Allocation for Cache-enabled Multi-hop Networks

  • Original language description

    In this paper, we focus on a cache-enabled multihop network, where the unmanned aerial vehicles (UAVs), the user equipment (UEs), or both can serve as relays to deliver contents to individual users from a ground base station (GBS). We formulate a power optimization problem with the objective to minimize the sum content delivery delay. We show the optimization problem is non-convex, thus, we propose a novel heuristic algorithm to allocate the power to individual contents at individual hops in multi-hop scenario. The proposed heuristic algorithm iteratively re-allocates the transmission power among the contents at the same transmitting node. To reduce the number of iteration, the proposed algorithm enables parallel power re-allocation for multiple content pairs and dynamic adaptation of power re-allocation steps, thereby enabling faster convergence of the algorithm. We demonstrate that our proposal reduces the average content delivery duration by up to 31.8% compared to state-of the-art works. At the same time, proposal is suitable for real systems due to a very fast convergence.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    20203 - Telecommunications

Result continuities

  • Project

    <a href="/en/project/LTT20004" target="_blank" >LTT20004: Cooperation with International Research Centre in Area of Digital Communication Systems</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2025

  • 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

    2025 IEEE Wireless Communications and Networking Conference (WCNC)

  • ISBN

    979-8-3503-6836-9

  • ISSN

    1558-2612

  • e-ISSN

    1558-2612

  • Number of pages

    6

  • Pages from-to

    1-6

  • Publisher name

    IEEE

  • Place of publication

    Milano

  • Event location

    Milan

  • Event date

    Mar 24, 2025

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    001514465200664