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

Kód výsledku v 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>

Výsledek na webu

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

Jazyk výsledku

angličtina

Název v původním jazyce

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

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

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

Popis výsledku anglicky

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.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

20203 - Telecommunications

Projekt

<a href="/cs/project/LTT20004" target="_blank" >LTT20004: Spolupráce s mezinárodním výzkumným centrem v oblasti digitálních komunikačních systémů</a><br>

Návaznosti

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

Rok uplatnění

2025

Kód důvěrnosti údajů

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

Název statě ve sborníku

2025 IEEE Wireless Communications and Networking Conference (WCNC)

ISBN

979-8-3503-6836-9

ISSN

1558-2612

e-ISSN

1558-2612

Počet stran výsledku

6

Strana od-do

1-6

Název nakladatele

IEEE

Místo vydání

Milano

Místo konání akce

Milan

Datum konání akce

24. 3. 2025

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

001514465200664