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”

Incentive-Based D2D Relaying in Cellular Networks

The result's identifiers

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

  • Result on the web

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

Alternative languages

  • Result language

    angličtina

  • Original language name

    Incentive-Based D2D Relaying in Cellular Networks

  • Original language description

    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.

  • 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/LTT18007" target="_blank" >LTT18007: Cooperation with the International Research Centre in Area of Communication Systems</a><br>

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

  • ISSN

    0090-6778

  • e-ISSN

    1558-0857

  • Volume of the periodical

    69

  • Issue of the periodical within the volume

    3

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    14

  • Pages from-to

    1775-1788

  • UT code for WoS article

    000631202500028

  • EID of the result in the Scopus database

    2-s2.0-85097965003