C‐CNPS: A Blockchain Sharding Network Model and Communication Strategy
Zhan Wen, Cheng Zhang, Wenzao Li, Yanhe Na, Dehao RenABSTRACT
Blockchain effectively addresses issues of trust and information asymmetry in distributed network architectures; however, its decentralization significantly constrains performance. Sharding is a viable solution to enhance blockchain scalability and improve network efficiency. In this context, this paper proposes a Sharding Algorithm Based on Coordinate Interval Distance(SACID), based on coordinate distance intervals, and develops a blockchain‐sharded network communication model. This model partitions the blockchain network into multiple shards, enabling parallel information processing and enhancing scalability. Additionally, a Coordinate‐based Network Path Selection Communication Strategy (CNPSC) is introduced to mitigate inter‐shard communication overhead and consistency challenges, optimizing communication efficiency while maintaining security and decentralization. Furthermore, this paper incorporates the blockchain P2P core data transmission protocol Gossip, Dijkstra's algorithm, and the newly designed CNPSC communication strategy into the blockchain‐shaded network communication model as data transmission protocols. Experimental analysis evaluates the robustness and communication efficiency of the proposed sharding model and CNPSC communication strategy. Results demonstrate that within the proposed blockchain‐sharded network model, Gossip, Dijkstra, and CNPSC all exhibit strong robustness. Among them, the proposed CNPSC achieves the highest communication efficiency and delivers the best network performance.