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

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

Výsledek na webu

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

Jazyk výsledku

angličtina

Název v původním jazyce

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

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

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

Popis výsledku anglicky

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.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

20203 - Telecommunications

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2024

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

2024 IEEE Wireless Communications and Networking Conference (WCNC)

ISBN

979-8-3503-0358-2

ISSN

1525-3511

e-ISSN

1525-3511

Počet stran výsledku

6

Strana od-do

1-6

Název nakladatele

Institute of Electrical and Electronics Engineers

Místo vydání

New York

Místo konání akce

Dubai

Datum konání akce

21. 4. 2024

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

WRD - Celosvětová akce

Kód UT WoS článku

001268569301008