RWA-BFT: Reputation-Weighted Asynchronous BFT for Large-Scale IoT
This paper introduces RWA-BFT, a reputation-weighted asynchronous Byzantine Fault Tolerance (BFT) consensus algorithm designed to address the scalability and performance challenges of blockchain systems in large-scale IoT scenarios. Traditional centralized IoT architectures often face issues such as...
Saved in:
Main Authors: | , , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2025-01-01
|
Series: | Sensors |
Subjects: | |
Online Access: | https://www.mdpi.com/1424-8220/25/2/413 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | This paper introduces RWA-BFT, a reputation-weighted asynchronous Byzantine Fault Tolerance (BFT) consensus algorithm designed to address the scalability and performance challenges of blockchain systems in large-scale IoT scenarios. Traditional centralized IoT architectures often face issues such as single points of failure and insufficient reliability, while blockchain, with its decentralized and tamper-resistant properties, offers a promising solution. However, existing blockchain consensus mechanisms struggle to meet the high throughput, low latency, and scalability demands of IoT applications. To address these limitations, RWA-BFT adopts a two-layer blockchain architecture; the first layer leverages reputation-based filtering to reduce computational complexity by excluding low-reputation nodes, while the second layer employs an asynchronous consensus mechanism to ensure efficient and secure communication among high-reputation nodes, even under network delays. This dual-layer design significantly improves performance, achieving higher throughput, lower latency, and enhanced scalability, while maintaining strong fault tolerance even in the presence of a substantial proportion of malicious nodes. Experimental results demonstrate that RWA-BFT outperforms HB-BFT and PBFT algorithms, making it a scalable and secure blockchain solution for decentralized IoT applications. |
---|---|
ISSN: | 1424-8220 |