All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

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

The result's identifiers

  • Result code in 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>

  • Result on the web

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

Alternative languages

  • Result language

    angličtina

  • Original language name

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

  • Original language description

    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.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    20203 - Telecommunications

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

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

Others

  • Publication year

    2021

  • Confidentiality

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

Data specific for result type

  • Name of the periodical

    IEEE Transactions on Wireless Communications

  • ISSN

    1536-1276

  • e-ISSN

    1558-2248

  • Volume of the periodical

    20

  • Issue of the periodical within the volume

    7

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    15

  • Pages from-to

    4313-4327

  • UT code for WoS article

    000671527500020

  • EID of the result in the Scopus database

    2-s2.0-85100922301