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”

Resource Allocation for D2D Communication With Multiple D2D Pairs Reusing Multiple Channels

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F19%3A00333018" target="_blank" >RIV/68407700:21230/19:00333018 - isvavai.cz</a>

  • Result on the web

    <a href="https://doi.org/10.1109/LWC.2019.2903798" target="_blank" >https://doi.org/10.1109/LWC.2019.2903798</a>

  • DOI - Digital Object Identifier

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

Alternative languages

  • Result language

    angličtina

  • Original language name

    Resource Allocation for D2D Communication With Multiple D2D Pairs Reusing Multiple Channels

  • Original language description

    In this letter, the goal is to maximize sum capacity of device-to-device (D2D) communication through a reuse of each radio channel by multiple D2D pairs while each D2D pair can access multiple channels. Since existing approaches cannot be easily extended to enable reuse of multiple channels by multiple D2D pairs in scenario with a high interference among the D2D pairs, we propose a novel resource allocation consisting of two phases. In an initial phase, all available channels are assigned by the Hungarian algorithm so that each channel is occupied by just one D2D pair. In a reuse phase, multiple D2D pairs are sequentially added to the individual channels according to their priority expressed by channel quality and received interference from already added D2D pairs. The proposal significantly outperforms existing solutions and reaches close to theoretical upper bound capacity despite a very low complexity of the proposed algorithm.

  • 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

    <a href="/en/project/GA17-17538S" target="_blank" >GA17-17538S: Combined Radio Frequency and Visible Light Bands for Device-to-Device communication</a><br>

  • Continuities

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

Others

  • Publication year

    2019

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

  • ISSN

    2162-2337

  • e-ISSN

    2162-2345

  • Volume of the periodical

    8

  • Issue of the periodical within the volume

    4

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    4

  • Pages from-to

    1008-1011

  • UT code for WoS article

    000482588700009

  • EID of the result in the Scopus database

    2-s2.0-85068674737