Reuse of Multiple Channels by Multiple D2D Pairs in Dedicated Mode: Game Theoretic Approach

Kód výsledku v IS VaVaI

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

Výsledek na webu

<a href="https://doi.org/10.1109/TWC.2021.3057825" target="_blank" >https://doi.org/10.1109/TWC.2021.3057825</a>

DOI - Digital Object Identifier

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

Jazyk výsledku

angličtina

Název v původním jazyce

Reuse of Multiple Channels by Multiple D2D Pairs in Dedicated Mode: Game Theoretic Approach

Popis výsledku v původním jazyce

Device-to-device communication (D2D) is expected to accommodate high data rates and to increase the spectral efficiency of mobile networks. The D2D pairs can opportunistically exploit channels that are not allocated to conventional users in a dedicated mode. To increase the sum capacity of D2D pairs in the dedicated mode, we propose a novel solution that allows the reuse of multiple channels by multiple D2D pairs. In the first step, the bandwidth is split among D2D pairs so that each pair communicates at a single channel that guarantees a minimal capacity for each pair. Then, the channel reuse is facilitated via a grouping of the D2D pairs into coalitions. The D2D pairs within one coalition mutually reuse the channels of each other. We propose two approaches for the creation of the coalitions. The first approach reaches an upper-bound capacity by optimal coalitions determined by the dynamic programming. However, such approach is of a high complexity. Thus, we also introduce a low-complexity algorithm, based on the sequential bargaining, reaching a close-to-optimal capacity. Moreover, we also determine the transmission power allocated to each reused channel. Simulations show that the proposed solution triples the sum capacity of the state-of-the-art algorithm with the highest performance.

Název v anglickém jazyce

Reuse of Multiple Channels by Multiple D2D Pairs in Dedicated Mode: Game Theoretic Approach

Popis výsledku anglicky

Device-to-device communication (D2D) is expected to accommodate high data rates and to increase the spectral efficiency of mobile networks. The D2D pairs can opportunistically exploit channels that are not allocated to conventional users in a dedicated mode. To increase the sum capacity of D2D pairs in the dedicated mode, we propose a novel solution that allows the reuse of multiple channels by multiple D2D pairs. In the first step, the bandwidth is split among D2D pairs so that each pair communicates at a single channel that guarantees a minimal capacity for each pair. Then, the channel reuse is facilitated via a grouping of the D2D pairs into coalitions. The D2D pairs within one coalition mutually reuse the channels of each other. We propose two approaches for the creation of the coalitions. The first approach reaches an upper-bound capacity by optimal coalitions determined by the dynamic programming. However, such approach is of a high complexity. Thus, we also introduce a low-complexity algorithm, based on the sequential bargaining, reaching a close-to-optimal capacity. Moreover, we also determine the transmission power allocated to each reused channel. Simulations show that the proposed solution triples the sum capacity of the state-of-the-art algorithm with the highest performance.

Druh

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

CEP obor

—

OECD FORD obor

20203 - Telecommunications

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

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

ISSN

1536-1276

e-ISSN

1558-2248

Svazek periodika

20

Číslo periodika v rámci svazku

7

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

15

Strana od-do

4313-4327

Kód UT WoS článku

000671527500020

EID výsledku v databázi Scopus

2-s2.0-85100922301