Guardat en:
Dades bibliogràfiques
Autors principals: Vavilis, Sokratis, Niavis, Harris, Loupos, Konstantinos
Format: Preprint
Publicat: 2025
Matèries:
Accés en línia:https://arxiv.org/abs/2503.08607
Etiquetes: Afegir etiqueta
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
_version_ 1866908649342894080
author Vavilis, Sokratis
Niavis, Harris
Loupos, Konstantinos
author_facet Vavilis, Sokratis
Niavis, Harris
Loupos, Konstantinos
contents With the rapid growth of hyperconnected devices and decentralized data architectures, safeguarding Internet of Things (IoT) transactions is becoming increasingly challenging. Blockchain presents a promising solution, yet its effectiveness depends on the underlying consensus algorithm. Conventional mechanisms, such as Proof of Work and Proof of Stake, are often impractical for resource-constrained IoT environments. To address these limitations, this work introduces a fair and lightweight hybrid consensus algorithm tailored for IoT. The proposed approach minimizes resource demands on the nodes while providing a fair and secure agreement process. Specifically, it utilizes a distributed lottery mechanism to ensure fair block proposals without requiring dedicated hardware. In addition, to enhance trust and establish finality, a reputation-based voting mechanism is incorporated. Finally, we experimentally validated the key features of the proposed consensus algorithm.
format Preprint
id arxiv_https___arxiv_org_abs_2503_08607
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle A Fair and Lightweight Consensus Algorithm for IoT
Vavilis, Sokratis
Niavis, Harris
Loupos, Konstantinos
Distributed, Parallel, and Cluster Computing
Cryptography and Security
With the rapid growth of hyperconnected devices and decentralized data architectures, safeguarding Internet of Things (IoT) transactions is becoming increasingly challenging. Blockchain presents a promising solution, yet its effectiveness depends on the underlying consensus algorithm. Conventional mechanisms, such as Proof of Work and Proof of Stake, are often impractical for resource-constrained IoT environments. To address these limitations, this work introduces a fair and lightweight hybrid consensus algorithm tailored for IoT. The proposed approach minimizes resource demands on the nodes while providing a fair and secure agreement process. Specifically, it utilizes a distributed lottery mechanism to ensure fair block proposals without requiring dedicated hardware. In addition, to enhance trust and establish finality, a reputation-based voting mechanism is incorporated. Finally, we experimentally validated the key features of the proposed consensus algorithm.
title A Fair and Lightweight Consensus Algorithm for IoT
topic Distributed, Parallel, and Cluster Computing
Cryptography and Security
url https://arxiv.org/abs/2503.08607