Improving Bitcoin Transaction Propagation Efficiency through Local Clique Network

被引:1
|
作者
Yan, Kailun [1 ]
Zhang, Jilian [2 ]
Wu, Yongdong [2 ]
机构
[1] Shandong Univ, Sch Cyber Sci & Technol, Qingdao, Peoples R China
[2] Jinan Univ, Coll Cyber Secur, Guangzhou, Peoples R China
基金
中国国家自然科学基金;
关键词
Bitcoin network; peer-to-peer network; transaction propagation; blockchain; BLOCKCHAIN; SECURE; ATTACK;
D O I
10.1093/comjnl/bxab186
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Bitcoin is a popular decentralized cryptocurrency, and the Bitcoin network is essentially an unstructured peer-to-peer (P2P) network that can synchronize distributed database of replicated ledgers through message broadcasting. In the Bitcoin network, the average clustering coefficient of nodes is very high, resulting in low message propagation efficiency. In addition, average node degree in the Bitcoin network is also considerably large, causing high message redundancy when nodes use the gossip protocol to broadcast messages. These may affect message propagation speed, hindering Bitcoin from being applied to scenarios of high transactional throughputs. To illustrate, we have collected single-hop propagation data of transactions of 366 blocks from Bitcoin Core. The analysis results show that transaction verification and network delay are two major causes of low transaction propagation efficiency. In this paper, we propose a novel P2P network structure, called local clique network (LCN), for message broadcasting in the Bitcoin network. Specifically, to reduce transaction validation latency and message redundancy, in LCN local nodes (logically) form cliques, and only a few nodes in a clique broadcast messages to the other cliques, instead of each node sending messages to its neighboring nodes. We have conducted extensive experiments, and the results show that message redundancy is low in LCN, and message propagation speed increases significantly. Meanwhile, LCN exhibits excellent robustness when average node degree remains high in the Bitcoin network.
引用
收藏
页码:318 / 332
页数:15
相关论文
共 27 条
  • [21] Reducing the propagation delay of compact block in Bitcoin network
    Kim, Aeri
    Essaid, Meryam
    Park, Sejin
    Ju, Hongtaek
    INTERNATIONAL JOURNAL OF NETWORK MANAGEMENT, 2024, 34 (03)
  • [22] A Hybrid Storage Scheme for Improving the Scalability of Bitcoin Network Based on IPFS
    Zhou, Kun
    Wang, Chunping
    Wang, Xiaoqing
    Cheng, Hongbing
    IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC 2022), 2022, : 3454 - 3459
  • [23] Analysis of Compact Block Propagation Delay in Bitcoin Network
    Kim, Aeri
    Kim, Jungyeon
    Essaid, Meryam
    Park, Sejin
    Ju, Hongtaek
    2021 22ND ASIA-PACIFIC NETWORK OPERATIONS AND MANAGEMENT SYMPOSIUM (APNOMS), 2021, : 313 - 318
  • [24] An Industry-4.0-Complaint Sustainable Bitcoin Model Through Optimized Transaction Selection and Sustainable Block Integration
    Monem, Maruf
    Alam, Md Golam Rabiul
    Abdullah-Al-Wadud, Mohammad
    Huda, Shamsul
    Hassan, Mohammad Mehedi
    Fortino, Giancarlo
    IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, 2022, 18 (12) : 9162 - 9172
  • [25] DAP-CBR: enhancing Bitcoin block propagation efficiency using dynamic compact block relay's prefilling of transactions
    Chin, Zi Hau
    Baskaran, Vishnu Monn
    Tan, Chee Keong
    Tan, Ian K. T.
    Yap, Timothy T. V.
    JOURNAL OF SUPERCOMPUTING, 2025, 81 (01)
  • [26] A sustainable Bitcoin blockchain network through introducing dynamic block size adjustment using predictive analytics
    Monem, Maruf
    Hossain, Md Tamjid
    Alam, Md. Golam Rabiul
    Munir, Md. Shirajum
    Rahman, Md. Mahbubur
    AlQahtani, Salman A.
    Almutlaq, Samah
    Hassan, Mohammad Mehedi
    FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2024, 153 : 12 - 26
  • [27] Improving Operational Efficiency through Quality 4.0 Tool: Blockchain Implementation and Subsequent Market Reaction
    Gimerska, Vladimira
    Soltes, Michal
    Mirdala, Rajmund
    QUALITY INNOVATION PROSPERITY-KVALITA INOVACIA PROSPERITA, 2023, 27 (02): : 16 - 32