Abstract
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 system, we propose a large-scale node lightweight consensus algorithm of blockchain for Internet of Things (LNLCA). Firstly, a transaction set construction mechanism is proposed to improve consensus efficiency and security. The mechanism packages multiple data monitored by Internet of Things (IoT) nodes into data transactions, and builds the transaction set. Then it constructs non-conflict subsets and conflict subsets. Secondly, 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 Direct 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 CDBFT, Avalanche, and Hashgraph.
Funding Information
  • National Key Research and Development Program of China (2023YFB2704400)
  • “Ling Yan” Research and Development Project of the Science and Technology Department of the Zhejiang Province of China (2023C03189)
  • National Natural Science Foundation of China (62072408)
  • Zhejiang Provincial Science Fund for Distinguished Young Scholars (LR24F020004)

This publication has 29 references indexed in Scilit: