TU Darmstadt / ULB / TUbiblio

A distributed reliable collusion-free algorithm for selecting multiple coordinators in IOTA using fog computing

Alavizadeh, Alavieh Sadat ; Erfani, Seyed Hossein ; Mirabi, Meghdad ; Sahafi, Amir (2023)
A distributed reliable collusion-free algorithm for selecting multiple coordinators in IOTA using fog computing.
In: Concurrency and Computation: Practice and Experience, early access
doi: 10.1002/cpe.8009
Artikel, Bibliographie

Kurzbeschreibung (Abstract)

IOTA is a distributed ledger technology with a new structure called Tangle, which offers high scalability, no fees, and near-instant transfers for the internet-of-things (IoT) networks. The most important issue of IOTA is consensus achievement, which is handled by a single node acting as a coordinator. A single and default coordinator node exposes IOTA to the single point of failure and incomplete distribution issues. In this paper, a novel algorithm for selecting multiple coordinators to participate in the consensus process at milestones is proposed (i.e., MCS algorithm) to overcome the problem of a single coordinator in IOTA network. The MCS algorithm is applied in a two-layered architecture including IoT devices (i.e., Layer 1) and fog nodes (i.e., Layer 2). We define and formulate four different properties as metrics to select multiple coordinators in this architecture. Moreover, a collusion list is defined to decrease the risk of collusion between fog nodes in the network. Experimental results show that using multiple fog nodes as coordinators in IOTA network can improve the average response time and average throughput while does not considerably sacrifice the total cost and system utilization in comparison with the use of a single default coordinator in IOTA network.

Typ des Eintrags: Artikel
Erschienen: 2023
Autor(en): Alavizadeh, Alavieh Sadat ; Erfani, Seyed Hossein ; Mirabi, Meghdad ; Sahafi, Amir
Art des Eintrags: Bibliographie
Titel: A distributed reliable collusion-free algorithm for selecting multiple coordinators in IOTA using fog computing
Sprache: Englisch
Publikationsjahr: 29 Dezember 2023
Verlag: John Wiley and Sons Ltd
Titel der Zeitschrift, Zeitung oder Schriftenreihe: Concurrency and Computation: Practice and Experience
Jahrgang/Volume einer Zeitschrift: early access
DOI: 10.1002/cpe.8009
URL / URN: https://onlinelibrary.wiley.com/doi/full/10.1002/cpe.8009
Kurzbeschreibung (Abstract):

IOTA is a distributed ledger technology with a new structure called Tangle, which offers high scalability, no fees, and near-instant transfers for the internet-of-things (IoT) networks. The most important issue of IOTA is consensus achievement, which is handled by a single node acting as a coordinator. A single and default coordinator node exposes IOTA to the single point of failure and incomplete distribution issues. In this paper, a novel algorithm for selecting multiple coordinators to participate in the consensus process at milestones is proposed (i.e., MCS algorithm) to overcome the problem of a single coordinator in IOTA network. The MCS algorithm is applied in a two-layered architecture including IoT devices (i.e., Layer 1) and fog nodes (i.e., Layer 2). We define and formulate four different properties as metrics to select multiple coordinators in this architecture. Moreover, a collusion list is defined to decrease the risk of collusion between fog nodes in the network. Experimental results show that using multiple fog nodes as coordinators in IOTA network can improve the average response time and average throughput while does not considerably sacrifice the total cost and system utilization in comparison with the use of a single default coordinator in IOTA network.

Zusätzliche Informationen:

Art.No.: e8009

Fachbereich(e)/-gebiet(e): 20 Fachbereich Informatik
20 Fachbereich Informatik > Data and AI Systems
Hinterlegungsdatum: 07 Mär 2024 13:10
Letzte Änderung: 07 Mär 2024 13:10
PPN:
Export:
Suche nach Titel in: TUfind oder in Google
Frage zum Eintrag Frage zum Eintrag

Optionen (nur für Redakteure)
Redaktionelle Details anzeigen Redaktionelle Details anzeigen