Hyppää sisältöön
    • Suomeksi
    • In English
Trepo
  • Suomeksi
  • In English
  • Kirjaudu
Näytä viite 
  •   Etusivu
  • Trepo
  • TUNICRIS-julkaisut
  • Näytä viite
  •   Etusivu
  • Trepo
  • TUNICRIS-julkaisut
  • Näytä viite
JavaScript is disabled for your browser. Some features of this site may not work without it.

Placement of Social Digital Twins at the Edge for Beyond 5G IoT Networks

Chukhno, Olga; Chukhno, Nadezhda; Araniti, Giuseppe; Campolo, Claudia; Iera, Antonio; Molinaro, Antonella (2022-12-01)

 
Avaa tiedosto
Placement_of_Social_Digital_Twins_at_the_Edge_for_Beyond_5G_IoT_Networks.pdf (2.157Mt)
Lataukset: 



Chukhno, Olga
Chukhno, Nadezhda
Araniti, Giuseppe
Campolo, Claudia
Iera, Antonio
Molinaro, Antonella
01.12.2022

IEEE Internet of Things Journal
doi:10.1109/JIOT.2022.3190737
Näytä kaikki kuvailutiedot
Julkaisun pysyvä osoite on
https://urn.fi/URN:NBN:fi:tuni-202212199305

Kuvaus

Peer reviewed
Tiivistelmä
<p>As the fifth-generation (5G) and beyond (5G+/6G) networks move forward, and a wide variety of new advanced Internet of Things (IoT) applications are offered, effective methodologies for discovering time-relevant information, services, and resources are being demanded. To this end, computing-, storage-, and battery-constrained IoT devices are progressively augmented via digital twins (DTs) hosted on edge servers. According to recent research results, a further feature these devices may acquire is social behavior; this latter offers enormous possibilities for fast and trustworthy service discovery, although it requires new orchestration policies of DTs at the network edge. This work addresses the dynamic placement of DTs with social capabilities [social digital twins (SDTs)] at the edge, by providing an optimal solution under IoT device mobility and by accounting for edge network deployment specifics, types of devices, and their social peculiarities. The optimization problem is formulated as a particular case of the quadratic assignment problem (QAP); also, an approximation algorithm is proposed and two relaxation techniques are applied to reduce computation complexity. Results show that the proposed placement policy ensures a latency among SDTs up to 1.4 times lower than the one obtainable with a traditional proximity-based only placement while still guaranteeing appropriate proximity between physical devices and their virtual counterparts. Moreover, the proposed heuristic closely approximates the optimal solution while guaranteeing the lowest computational time.</p>
Kokoelmat
  • TUNICRIS-julkaisut [20127]
Kalevantie 5
PL 617
33014 Tampereen yliopisto
oa[@]tuni.fi | Tietosuoja | Saavutettavuusseloste
 

 

Selaa kokoelmaa

TekijätNimekkeetTiedekunta (2019 -)Tiedekunta (- 2018)Tutkinto-ohjelmat ja opintosuunnatAvainsanatJulkaisuajatKokoelmat

Omat tiedot

Kirjaudu sisäänRekisteröidy
Kalevantie 5
PL 617
33014 Tampereen yliopisto
oa[@]tuni.fi | Tietosuoja | Saavutettavuusseloste