Incentive-Based D2D Relaying in Cellular Networks

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F21%3A00349060" target="_blank" >RIV/68407700:21230/21:00349060 - isvavai.cz</a>

Výsledek na webu

<a href="https://doi.org/10.1109/TCOMM.2020.3042461" target="_blank" >https://doi.org/10.1109/TCOMM.2020.3042461</a>

DOI - Digital Object Identifier

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

Jazyk výsledku

angličtina

Název v původním jazyce

Incentive-Based D2D Relaying in Cellular Networks

Popis výsledku v původním jazyce

Device-to-device (D2D) relaying is a concept, where some users relay data of cell-edge users (CUEs) experiencing a bad channel quality to a base station. While this research topic has received plenty of attention, a critical aspect of the D2D relaying remains a selfish nature of the users and their limited willingness to relay data for others. Thus, we propose a scheme to identify potential candidates for the relaying and provide a sound incentive to these relaying users (RUEs) to motivate them helping other users. First, we provide a detailed theoretical analysis showing when and if the relaying is beneficial for the CUE(s) and related RUE. Second, to choose among all possible incentive-compliant relaying options, we formulate the optimal CUE-to-RUE matching problem maximizing a network-wide performance. Since the optimal solution is hard to obtain for a high number of users, we propose a low-complexity greedy algorithm and prove its constant worst-case approximation guarantees to the optimum. Finally, we derive a closed-form expression for a fair allocation of the resources among the CUEs and the RUEs. The proposed framework more than doubles the users' capacity and/or reduces the energy consumption by up to 87% comparing to existing incentive-based relaying schemes.

Název v anglickém jazyce

Incentive-Based D2D Relaying in Cellular Networks

Popis výsledku anglicky

Device-to-device (D2D) relaying is a concept, where some users relay data of cell-edge users (CUEs) experiencing a bad channel quality to a base station. While this research topic has received plenty of attention, a critical aspect of the D2D relaying remains a selfish nature of the users and their limited willingness to relay data for others. Thus, we propose a scheme to identify potential candidates for the relaying and provide a sound incentive to these relaying users (RUEs) to motivate them helping other users. First, we provide a detailed theoretical analysis showing when and if the relaying is beneficial for the CUE(s) and related RUE. Second, to choose among all possible incentive-compliant relaying options, we formulate the optimal CUE-to-RUE matching problem maximizing a network-wide performance. Since the optimal solution is hard to obtain for a high number of users, we propose a low-complexity greedy algorithm and prove its constant worst-case approximation guarantees to the optimum. Finally, we derive a closed-form expression for a fair allocation of the resources among the CUEs and the RUEs. The proposed framework more than doubles the users' capacity and/or reduces the energy consumption by up to 87% comparing to existing incentive-based relaying schemes.

Druh

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

CEP obor

—

OECD FORD obor

20203 - Telecommunications

Projekt

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

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2021

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 Transactions on Communications

ISSN

0090-6778

e-ISSN

1558-0857

Svazek periodika

69

Číslo periodika v rámci svazku

3

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

14

Strana od-do

1775-1788

Kód UT WoS článku

000631202500028

EID výsledku v databázi Scopus

2-s2.0-85097965003