Partially Synchronous BFT Consensus Made Practical in Wireless Networks

• URL: http://arxiv.org/abs/2412.05512v1
• Date: Sat, 07 Dec 2024 02:55:32 GMT
• Title: Partially Synchronous BFT Consensus Made Practical in Wireless Networks
• Authors: Shuo Liu, Minghui Xu, Yuezhou Zheng, Yifei Zou, Wangjie Qiu, Gang Qu, Xiuzhen Cheng,
• Abstract summary: We propose a wireless communication protocol called ReduceCatch that supports reliable 1-to-N, N-to-1, and N-to-N communications.<n>We employ ReduceCatch to tailor three partially synchronous BFT consensus protocols for seamless adaptation from wired to ad hoc wireless networks.
• Score: 16.93000315171509
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Consensus is becoming increasingly important in wireless networks. Partially synchronous BFT consensus, a significant branch of consensus, has made considerable progress in wired networks. However, its implementation in wireless networks, especially in dynamic ad hoc wireless networks, remains challenging. Existing wireless synchronous consensus protocols, despite being well-developed, are not readily adaptable to partially synchronous settings. Additionally, reliable communication, a cornerstone of BFT consensus, can lead to high message and time complexity in wireless networks. To address these challenges, we propose a wireless communication protocol called ReduceCatch (Reduce and Catch) that supports reliable 1-to-N, N-to-1, and N-to-N communications. We employ ReduceCatch to tailor three partially synchronous BFT consensus protocols (PBFT, Tendermint, and HotStuff) for seamless adaptation from wired to ad hoc wireless networks. To evaluate the performance of the ReduceCatch-enabled consensus protocols, we develop a three-layer wireless consensus testbed, based on which we implement 20 distinct consensus protocols and measure their latency and throughput. The experimental results demonstrate the superiority of the ReduceCatch-based consensus protocol in terms of latency and throughput.

Related papers

• Asynchronous BFT Consensus Made Wireless [17.041093019055555]
  Asynchronous Byzantine fault-tolerant (BFT) consensus protocols are becoming increasingly vital for wireless applications. While these protocols have proven effective in wired networks, their adaptation to wireless environments presents significant challenges. Asynchronous BFT consensus suffers from high message complexity, leading to network congestion and inefficiency.
  arXiv  Detail & Related papers  (2025-03-27T08:59:30Z)
• Communication-Efficient Federated Learning by Quantized Variance Reduction for Heterogeneous Wireless Edge Networks [55.467288506826755]
  Federated learning (FL) has been recognized as a viable solution for local-privacy-aware collaborative model training in wireless edge networks. Most existing communication-efficient FL algorithms fail to reduce the significant inter-device variance. We propose a novel communication-efficient FL algorithm, named FedQVR, which relies on a sophisticated variance-reduced scheme.
  arXiv  Detail & Related papers  (2025-01-20T04:26:21Z)
• TetraBFT: Reducing Latency of Unauthenticated, Responsive BFT Consensus [1.6364535330823093]
  TetraBFT is a Byzantine fault tolerant protocol for solving consensus in partial synchrony. We validate the correctness of TetraBFT through rigorous security analysis and formal verification. We extend TetraBFT into a multi-shot, chained consensus protocol.
  arXiv  Detail & Related papers  (2024-05-04T08:54:42Z)
• Banyan: Fast Rotating Leader BFT [20.52947785138998]
  Banyan is the first rotating leader state machine replication protocol that allows transactions to be confirmed in just a single round-trip time. We introduce a novel dual mode mechanism that enables optimal block finalization latency in the fast path. Our evaluation reveals that Banyan reduces latency by up to 30% compared to state-of-the-art protocols.
  arXiv  Detail & Related papers  (2023-12-10T12:32:58Z)
• Decentralized Learning over Wireless Networks with Broadcast-Based Subgraph Sampling [36.99249604183772]
  This work centers on the communication aspects of decentralized learning over wireless networks, using consensus-based decentralized descent (D-SGD) Considering the actual communication cost or delay caused by in-network information exchange in an iterative process, our goal is to achieve fast convergence of the algorithm measured by improvement per transmission slot. We propose BASS, an efficient communication framework for D-SGD over wireless networks with broadcast transmission and probabilistic subgraph sampling.
  arXiv  Detail & Related papers  (2023-10-24T18:15:52Z)
• WiFi-based Spatiotemporal Human Action Perception [53.41825941088989]
  An end-to-end WiFi signal neural network (SNN) is proposed to enable WiFi-only sensing in both line-of-sight and non-line-of-sight scenarios. Especially, the 3D convolution module is able to explore thetemporal continuity of WiFi signals, and the feature self-attention module can explicitly maintain dominant features.
  arXiv  Detail & Related papers  (2022-06-20T16:03:45Z)
• Deep Learning-Based Synchronization for Uplink NB-IoT [72.86843435313048]
  We propose a neural network (NN)-based algorithm for device detection and time of arrival (ToA) estimation for the narrowband physical random-access channel (NPRACH) of narrowband internet of things (NB-IoT) The introduced NN architecture leverages residual convolutional networks as well as knowledge of the preamble structure of the 5G New Radio (5G NR) specifications.
  arXiv  Detail & Related papers  (2022-05-22T12:16:43Z)
• Asynchronous Decentralized Learning over Unreliable Wireless Networks [4.630093015127539]
  Decentralized learning enables edge users to collaboratively train models by exchanging information via device-to-device communication. We propose an asynchronous decentralized gradient descent (DSGD) algorithm, which is robust to the inherent and communication failures occurring at the wireless network edge. Experimental results corroborate our analysis, demonstrating the benefits of asynchronicity and outdated gradient information reuse in decentralized learning over unreliable wireless networks.
  arXiv  Detail & Related papers  (2022-02-02T11:00:49Z)
• Deep Reinforcement Learning for Wireless Scheduling in Distributed Networked Control [37.10638636086814]
  We consider a joint uplink and downlink scheduling problem of a fully distributed wireless control system (WNCS) with a limited number of frequency channels. We develop a deep reinforcement learning (DRL) based framework for solving it. To tackle the challenges of a large action space in DRL, we propose novel action space reduction and action embedding methods.
  arXiv  Detail & Related papers  (2021-09-26T11:27:12Z)
• Low-Latency Federated Learning over Wireless Channels with Differential Privacy [142.5983499872664]
  In federated learning (FL), model training is distributed over clients and local models are aggregated by a central server. In this paper, we aim to minimize FL training delay over wireless channels, constrained by overall training performance as well as each client's differential privacy (DP) requirement.
  arXiv  Detail & Related papers  (2021-06-20T13:51:18Z)
• Deep Learning for Radio Resource Allocation with Diverse Quality-of-Service Requirements in 5G [53.23237216769839]
  We develop a deep learning framework to approximate the optimal resource allocation policy for base stations. We find that a fully-connected neural network (NN) cannot fully guarantee the requirements due to the approximation errors and quantization errors of the numbers of subcarriers. Considering that the distribution of wireless channels and the types of services in the wireless networks are non-stationary, we apply deep transfer learning to update NNs in non-stationary wireless networks.
  arXiv  Detail & Related papers  (2020-03-29T04:48:22Z)
• Wireless Power Control via Counterfactual Optimization of Graph Neural Networks [124.89036526192268]
  We consider the problem of downlink power control in wireless networks, consisting of multiple transmitter-receiver pairs communicating over a single shared wireless medium. To mitigate the interference among concurrent transmissions, we leverage the network topology to create a graph neural network architecture. We then use an unsupervised primal-dual counterfactual optimization approach to learn optimal power allocation decisions.
  arXiv  Detail & Related papers  (2020-02-17T07:54:39Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.