PBFT Optimized Consensus Algorithm for Internet of Things

Abstract

Faced with a large number of IoT transactions,efficient consensus algorithm plays a key role in the application of blockchain technology into IoT.In this paper,according to the problems of long consensus time delay and low throughput in practical Byzantine fault tolerant algorithm (PBFT),we propose a practical Byzantine fault tolerant algorithm based on clustering (C-PBFT).Firstly,the nodes are clustered according to location features to form a network structure with multiple centers and layers.Then,consensus tasks are divided to conduct consensus in bottom and top network,thereby reducing the communication cost needed by consensus.Finally,credibility of dynamic credit model evaluation node is introduced to reduce the participation of abnormal nodes and increase the security and reliability of the system.Experimental results show that the C-PBFT algorithm can effectively reduce communication overhead,consensus delay and improve throughput.

Keywords

• internet of things|blockchain|pbft|clustering|dynamic credit model