Allocation of Resources for HARQ Retransmission in Mobile Networks Based on C-RAN

Kód výsledku v IS VaVaI

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

Výsledek na webu

<a href="https://doi.org/10.1109/JSYST.2023.3327823" target="_blank" >https://doi.org/10.1109/JSYST.2023.3327823</a>

DOI - Digital Object Identifier

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

Jazyk výsledku

angličtina

Název v původním jazyce

Allocation of Resources for HARQ Retransmission in Mobile Networks Based on C-RAN

Popis výsledku v původním jazyce

The radio resources are utilized for both transmissions of new data and for retransmission(s) of erroneous data to handle errors due to transmission over the wireless link. Hence, the more retransmissions occur, the fewer resources remain available for transmission of new data resulting in a lower goodput. This problem is even emphasized in cloud radio access networks (C-RAN), where remote radio heads (RRHs) cooperate with baseband unit (BBU) over fronthaul imposing additional delay and limiting goodput. In this article, we propose a flexible and dynamic Hybrid Automatic Repeat reQuest (HARQ) resource pre-allocation based on the actual retransmission needs of individual user equipments (UEs). This is managed by two algorithms, first exploiting information on the error rate experienced by individual UEs and the second using the length of the scheduling period of the UEs. Both algorithms are further integrated together to improve the efficiency of the HARQ retransmissions resource pre-allocation. Simulation results show the proposed solution provides goodput close to the theoretical upper-bound while outperforming existing approaches by up to 39%. Furthermore, the transport block loss rate and mean absolute percentage error of the amount of pre-allocated resources for the HARQ are notably decreased by around 38% and 57%, respectively.

Název v anglickém jazyce

Allocation of Resources for HARQ Retransmission in Mobile Networks Based on C-RAN

Popis výsledku anglicky

The radio resources are utilized for both transmissions of new data and for retransmission(s) of erroneous data to handle errors due to transmission over the wireless link. Hence, the more retransmissions occur, the fewer resources remain available for transmission of new data resulting in a lower goodput. This problem is even emphasized in cloud radio access networks (C-RAN), where remote radio heads (RRHs) cooperate with baseband unit (BBU) over fronthaul imposing additional delay and limiting goodput. In this article, we propose a flexible and dynamic Hybrid Automatic Repeat reQuest (HARQ) resource pre-allocation based on the actual retransmission needs of individual user equipments (UEs). This is managed by two algorithms, first exploiting information on the error rate experienced by individual UEs and the second using the length of the scheduling period of the UEs. Both algorithms are further integrated together to improve the efficiency of the HARQ retransmissions resource pre-allocation. Simulation results show the proposed solution provides goodput close to the theoretical upper-bound while outperforming existing approaches by up to 39%. Furthermore, the transport block loss rate and mean absolute percentage error of the amount of pre-allocated resources for the HARQ are notably decreased by around 38% and 57%, respectively.

Druh

J_imp - Článek v periodiku v databázi Web of Science

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 periodika

IEEE Systems Journal

ISSN

1932-8184

e-ISSN

1937-9234

Svazek periodika

18

Číslo periodika v rámci svazku

1

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

12

Strana od-do

450-461

Kód UT WoS článku

001123360200001

EID výsledku v databázi Scopus

2-s2.0-85178069288