A Large-Scale Node Lightweight Consensus Algorithm of Blockchain for Internet of Things

In order to solve the problems in the blockchain consensus algorithm, such as slow consensus speed, high resource consumption, and low consensus security due to excessive large-scale node data volume and Byzantine attacks in the Internet of Things (IoT) system, we propose a large-scale node lightweight consensus algorithm of blockchain for IoT (LNLCA). First, a transaction set construction mechanism is proposed to improve consensus efficiency and security. The mechanism packages multiple data monitored by IoT nodes into data transactions, and builds the transaction set. Then, it constructs nonconflict subsets and conflict subsets. Second, an adjacent parent node sampling and response mechanism is proposed to reduce the consumption of communication resources. The new transaction set selects nearby parent nodes based on the time distance summation method and collaborates to batch verify each transaction in the transaction set. Finally, an efficient consistent consensus based on transaction set directed acyclic graph (DAG) is proposed to quickly vote for each transaction in the transaction set, thereby constructing the transaction set DAG for batch uploading to the chain, and achieving a secure and lightweight consensus on IoT data. The experimental results show that no matter how the number of Byzantine nodes changes, LNLCA can improve transaction throughput, and reduce transaction delay and communication overhead, which outperforms the credit-delegated Byzantine fault tolerance, Avalanche, and Hashgraph.