Scalable tree-based Byzantine fault tolerance algorithm for edge networks
摘要
As the proliferation of Internet of Things devices accelerates, traditional cloud computing architectures increasingly struggle to meet the rising demands for high bandwidth, ultra-low latency, and real-time processing, thus driving the adoption of edge computing. Edge computing addresses these issues by processing data closer to the source, reducing latency and alleviating network congestion. However, it still faces significant challenges, such as constrained resources, scalability limitations, and vulnerabilities to security threats. To overcome these challenges, this study proposes a novel tree-based, two-layer Byzantine Fault Tolerant (TB_PBFT) algorithm, which integrates blockchain’s distributed ledger and consensus mechanisms to improve data consistency and system security. The TB_PBFT algorithm structures consensus nodes into hierarchical sub-networks, optimizing node communication and decision-making efficiency. It also employs Boneh–Lynn–Shacham aggregated signature techniques to reduce the communication complexity from