Data Transmission Scheme Considering Node Failure for Blockchain

In recent years, Blockchain technology has attracted considerable attention from the industrial circle. Blockchain is a distributed ledger technology, which must be validated, stored and maintained by all nodes to ensure data security, transparency, and integrity. The communication efficiency of Blockchain is an important factor restricting its application. Existing algorithms can provide data routing schemes for Blockchain but without considering the node failure. On Blockchain, node failure is a common phenomenon due to the nodes’ selfishness and nodes’ mobility. Node failure degrades the network performance or even sometimes makes the network useless. This paper proposes a data transmission scheme considering node failure for finishing validation of block data on Blockchain, which firstly sets response threshold level to detect failure node, and then using greedy idea constructs communication tree to organize all nodes forwarding block data. Based to the multi-link concurrent communication tree model, this scheme maximizes the potential transmitting capacity of nodes and assigns proper tasks to other nodes beside source node, so it can shorten the validation time of Blockchain transaction, and improve resistance to node failure. Theoretical proof and experimental results show the effectiveness and the efficiency of the proposed data transmission scheme.