Open Access
- 27 November 2023
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1-14
Abstract
Modern Byzantine Fault-Tolerant State Machine Replication (BFT-SMR) solutions focus on reducing communication complexity, improving throughput, or lowering latency. This work explores the energy efficiency of BFT-SMR protocols. First, we propose a novel SMR protocol that optimizes for the steady state, i.e., when the leader is correct. This is done by reducing the number of required signatures per consensus unit and the communication complexity by order of the number of nodes n compared to the state-of-the-art BFT-SMR solutions. Concretely, we employ the idea that a quorum (collection) of signatures on a proposed value is avoidable during the failure-free runs. Second, we model and analyze the energy efficiency of protocols and argue why the steady-state needs to be optimized. Third, we present an application in the cyber-physical system (CPS) setting, where we consider a partially connected system by optionally leveraging wireless multicasts among neighbors. We analytically determine the parameter ranges for when our proposed protocol offers better energy efficiency than communicating with a baseline protocol utilizing an external trusted node. We present a hypergraph-based network model and generalize previous fault tolerance results to the model. Finally, we demonstrate our approach's practicality by analyzing our protocol's energy efficiency through experiments on a CPS test bed. In particular, we observe as high as 64% energy savings when compared to the state-of-the-art SMR solution for n = 10 settings using BLE.Keywords
Funding Information
- National Institute of Food and Agriculture (2021-67021-34252)
- United States Department of Agriculture
- National Science Foundation (CNS1846316)
- NSF (Cyber Physical Systems)
- Army Research Lab (W911NF-2020-221)
This publication has 59 references indexed in Scilit:
- MWM-Array Sensors for In Situ Monitoring of High-Temperature Components in Power PlantsIEEE Sensors Journal, 2009
- Efficient Byzantine Agreement with Faulty Minority2007
- Short Signatures Without Random Oracles and the SDH Assumption in Bilinear GroupsJournal of Cryptology, 2007
- Energy-aware multicasting in wireless ad hoc networks: A survey and discussionComputer Communications, 2007
- Byzantine Agreement Given Partial BroadcastJournal of Cryptology, 2005
- Practical byzantine fault tolerance and proactive recoveryACM Transactions on Computer Systems, 2002
- Signature schemes based on the strong RSA assumptionACM Transactions on Information and System Security, 2000
- Implementing fault-tolerant services using the state machine approach: a tutorialACM Computing Surveys, 1990
- Asynchronous consensus and broadcast protocolsJournal of the ACM, 1985
- Authenticated Algorithms for Byzantine AgreementSIAM Journal on Computing, 1983