Optimizing Blockchain Broadcast with Node-Cluster Tree Routing.

In recent years, the development of blockchain has been greatly rapid. However, the transaction speed of blockchain is constrained by the speed of message propagation. This paper proposes a topology structure of balanced binary tree whose nodes correspond to clustered blockchain nodes with representative nodes. The blockchain nodes are grouped based on their neighborhood, and the adjacency between groups depends on whether there are adjacent nodes between them, resulting in a reduced-scale topology graph. Each cluster group selects two or more representative nodes for communicating between groups. In this new network topology graph, we construct a balanced binary tree for message broadcasting. The propagation of messages between parent and child tree nodes is facilitated through representative nodes, while within node groups, representative nodes multicast to the blockchain nodes in the group. Through research and analysis, it has been shown that the balanced tree approach with representative node grouping can significantly enhance convergence speed and reduce redundant message forwarding.