<p>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 <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="607_2025_1496_Article_IEq1.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="44" /> </InlineMediaObject> <EquationSource Format="TEX">\(O(n^2)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>O</mi> <mo stretchy="false">(</mo> <msup> <mi>n</mi> <mn>2</mn> </msup> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> to <i>O</i>(<i>n</i>), substantially enhancing scalability and communication performance in large-scale networks. Furthermore, the algorithm leverages a verifiable random function to select master nodes randomly and incorporates fault-tolerant mechanisms, improving system robustness under challenging and adverse conditions. Experimental results validate that TB_PBFT achieves superior scalability, security, and performance, demonstrating excellent applicability in high-performance, distributed edge computing environments. This research provides an effective and reliable solution for the challenges associated with large-scale edge computing networks.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Scalable tree-based Byzantine fault tolerance algorithm for edge networks

  • Jiali Zheng,
  • Lijun Deng

摘要

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 \(O(n^2)\) O ( n 2 ) to O(n), substantially enhancing scalability and communication performance in large-scale networks. Furthermore, the algorithm leverages a verifiable random function to select master nodes randomly and incorporates fault-tolerant mechanisms, improving system robustness under challenging and adverse conditions. Experimental results validate that TB_PBFT achieves superior scalability, security, and performance, demonstrating excellent applicability in high-performance, distributed edge computing environments. This research provides an effective and reliable solution for the challenges associated with large-scale edge computing networks.