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”

Multi-hop Relaying with Mixed Half and Full Duplex Relays for Offloading to MEC

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F23%3A00374536" target="_blank" >RIV/68407700:21230/23:00374536 - isvavai.cz</a>

  • Result on the web

    <a href="https://doi.org/10.1109/GCWkshps58843.2023.10464927" target="_blank" >https://doi.org/10.1109/GCWkshps58843.2023.10464927</a>

  • DOI - Digital Object Identifier

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

Alternative languages

  • Result language

    angličtina

  • Original language name

    Multi-hop Relaying with Mixed Half and Full Duplex Relays for Offloading to MEC

  • Original language description

    In this paper, we focus on offloading a computing task from a user equipment (UE) to a multi-access edge computing (MEC) server via multi-hop relaying. We assume a general relaying case where relays are energy-constrained devices, such as other UEs, internet of things (IoT) devices, or unmanned aerial vehicles. To this end, we formulate the problem as a minimization of the sum energy consumed by the energy-constrained devices under the constraint on the maximum requested time of the task processing. Then, we propose a multi-hop relaying combining half and full duplexes at each individual relay involved in the offloading. We proof that the proposed multi-hop relaying is convex, thus it can be optimized by conventional convex optimization methods. We show our proposal outperforms existing multi-hop relaying schemes in terms of probability that tasks are processed within required time by up to 38% and, at the same time, decreases energy consumption by up to 28%.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    20203 - Telecommunications

Result continuities

  • Project

    <a href="/en/project/GA23-05646S" target="_blank" >GA23-05646S: Intelligent Radio Resource and Mobility Management based on Federated Learning</a><br>

  • Continuities

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

Others

  • Publication year

    2023

  • 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

  • Article name in the collection

    2023 IEEE Globecom Workshops (GC Wkshps)

  • ISBN

    979-8-3503-7021-8

  • ISSN

  • e-ISSN

  • Number of pages

    7

  • Pages from-to

  • Publisher name

    Institute of Electrical and Electronic Engineers

  • Place of publication

    Piscataway

  • Event location

    Kuala Lumpur

  • Event date

    Dec 4, 2023

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article