Availability Evaluation of IoT Systems with Byzantine Fault-Tolerance for Mission-Critical Applications

Marcozzi, Marco; Gemikonakli, Orhan; Gemikonaklı, Eser; Ever, Enver; Mostarda, Leonardo

doi:10.2139/ssrn.4497271

Cited by 1 publication

(1 citation statement)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is more important, sensitive and crucial when sensors collect status of a physical variable and make real time decision of an IoT network. BFT can maintain service availability and data integrity of an IoT framework where there is a possibility of component failures, malicious attacks, and random data corruption [8]. The noble works of Driscoll et al [9] and Yun et al [1] show the importance of BFT in the first growing distributed IoT architecture.…”

Section: Bft System For Iot Platformmentioning

confidence: 99%

Boolean Byzantine Fault Tolerant Algorithm for Light Weight IoT Consensus

Sarker

2024

Preprint

View full text Add to dashboard Cite

Nowadays consensus algorithms are the backbone of fault tolerant systems, communication protocols, and distributed blockchain services though it is initiated to ensure reliable service in the presence of Byzantine faults of a distributed infrastructure. Real time automation system is highly depended on the reliability of IoT devices which are lightweight resource constrained components that demands a computationally faster algorithm within minimum number of steps. This research proposed a Boolean Byzantine Fault Tolerant (BBFT) algorithm that completes a consensus process by 3 steps only. It makes consensus by bitwise logical operations where all nodes get same decision after steps 3. It is proposed for static and predefined nodes of an agreement system that can detect malicious and anomaly nodes at the earlier stage than existing Byzantine Fault Tolerant (BFT) algorithms. BBFT is designed for resource constrained (limited memory and processing power) IoT devices where limited number of similar nodes can make an agreement. Boolean operations of the algorithm make it simple, easier for mathematical modeling, and suitable to express by vector notations of quantum computing applications. Though time complexity (O(n) = n2) of the BBFT is same as other classical BFT algorithms, it saves resources and reduces information processing delay due to the implementation of Boolean operations.

show abstract

Section: Bft System For Iot Platformmentioning

confidence: 99%

Boolean Byzantine Fault Tolerant Algorithm for Light Weight IoT Consensus

Sarker

2024

Preprint

View full text Add to dashboard Cite

show abstract

Availability Evaluation of IoT Systems with Byzantine Fault-Tolerance for Mission-Critical Applications

Cited by 1 publication

References 36 publications

Boolean Byzantine Fault Tolerant Algorithm for Light Weight IoT Consensus

Boolean Byzantine Fault Tolerant Algorithm for Light Weight IoT Consensus

Contact Info

Product

Resources

About