Efficient Byzantine Consensus Algorithm in IoT Scenarios

This article proposes a layered blockchain architecture based on partitioned IoT to reduce the scalability requirements of the Internet of Things for blockchain. In addition, in response to the problem of low performance of traditional Byzantine fault-tolerant consensus algorithms such as PBFT in IoT scenarios, a parallel block verification Byzantine consensus algorithm (PVBFT) is proposed based on a layered blockchain architecture based on partitioned IoT. This algorithm improves the VRF lottery algorithm to select consensus nodes quickly, replaces single chain storage structure with DAG structure, introduces coordination nodes, and fully utilizes the high concurrency of DAG. We have implemented multi-node collision-free block packaging and multi-block parallel verification, using aggregation signature to reduce communication costs during the Byzantine consensus process and effectively improve the throughput of the consensus algorithm. The experimental results show that compared with the PBFT consensus algorithm, PVBFT has lower communication overhead and higher performance.