An Efficient DAG Blockchain Architecture for IoT

Abstract

Directed acyclic graph (DAG) blockchain is a new paradigm of blockchain that solves the poor scalability and low throughput caused by a single-chain structure for IoT applications in the blockchain. However, for DAG-structured blockchains, it is difficult to determine the order of blocks. Additionally, there is also lack of secure and efficient ways to generate blocks in parallel. To address these problems, we propose an efficient DAG blockchain architecture. First, a novel heaviest chain rule based on the block weight is proposed to guide the selection of the parent and uncle blocks for a new block, which realize that appending is ordering. Second, a tree-based gossip protocol (TBGP) is proposed to improve consensus efficiency by reducing message redundancy. Furthermore, federated learning is used to select nodes constructing the tree-based gossip network (TBGN). Finally, compared to the random gossip protocol (RGP), the simulation results indicate TBGP can effectively reduce communication redundancy and improve consensus efficiency.