Block Chain for IOT Security Using Consensus Algorithms

Abstract

The first distributed recordkeeping system with a built-in trust structure is the block chain. It creates a dependable architecture for decentralized control through information redundancy across multiple nodes. Based on this, this study suggests a minimal block chain-based IoT information exchange security framework. The framework uses a double-chain approach that combines the data block chain and the transaction block chain. Distributed storage and tamper-proof data are implemented in the data block chain, and the consensus process is improved using the improved practical Byzantine fault-tolerant (PBFT) mechanism. Data registration efficiency, resource and data transfers, and privacy protection are all enhanced by better partial blind signature-based algorithms in the transaction block chain. This article focuses on how well the consensus algorithms employed in a block chain system for the Internet of Things perform (IoT). Such systems' time requirements to accomplish. Consensus ought to be minimal. The three most popular consensus algorithms—modified proof of work, realistic byzantine fault tolerance, and binary consensus—are assessed under various conditions, including mote type, number of participating nodes, and radio propagation model. To enable an IoT node to switch between different consensus algorithms, a comprehensive solution is put forward. The Contiki IoT operating system simulations display strong performance (time to achieve consensus less than seconds)