A Decentralized Tree-based Algorithm for Reliable Blockchain Communications

Blockchain has been widely used in monetary systems, hence its consistency under all circumstances is a serious concern. Since it can be damaged physically and virtually, it is crucial to develop a protection mechanism that binds both overlay and underlay networks. This paper focuses on the functionality of blockchain under attacks. We propose a heuristic algorithm to enhance the reliability of information propagation. First, for underlay, we scrutinize the performance of the network during a partial malfunction. We develop a series of mathematical formulas to construct the communication tree model and evaluate its delay. Second, in the overlay, we add the trustworthiness of each node as a parameter. It is an indicator used in path selection to avoid malicious tampering. Our purposed method strengthens the tie between both physical and virtual networks so that blockchain thrives even in abnormal situations. It greatly increases the resilience of blockchain and provides a reliable system for digital transactions.