• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Hai Mo, Zhu Jianming. A Propagation Mechanism Combining an Optimal Propagation Path and Incentive in Blockchain Networks[J]. Journal of Computer Research and Development, 2019, 56(6): 1205-1218. DOI: 10.7544/issn1000-1239.2019.20180419
Citation: Hai Mo, Zhu Jianming. A Propagation Mechanism Combining an Optimal Propagation Path and Incentive in Blockchain Networks[J]. Journal of Computer Research and Development, 2019, 56(6): 1205-1218. DOI: 10.7544/issn1000-1239.2019.20180419

A Propagation Mechanism Combining an Optimal Propagation Path and Incentive in Blockchain Networks

Funds: This work was supported by the National Key Research and Development Program of China (2017YFB1400700) and the Key Program of the National Natural Science Foundation of China (U201509214).
More Information
  • Published Date: May 31, 2019
  • For the blockchain fork in blockchain networks can cause the attacker to perform double-spending attack very easily, how to reduce the fork probability is a very important and challenging research issue. Aiming at three problems of current research on optimizing the propagation mechanism of transactions and blocks in blockchain networks to reduce the fork probability: only the propagation delay between adjacent nodes or the total number of routing hops of the propagation process is reduced; the propagation process generates a large number of communication messages; it is based on the assumption that nodes on the propagation path will continue to propagate transactions and blocks, and a propagation mechanism combining an optimal propagation path and incentive (OPPI) in blockchain networks, is proposed to decrease both the total propagation delay and the number of communication messages, which achieves a tradeoff between the propagation efficiency and the propagation cost. Simulation results show that: compared with the existing propagation mechanism of blockchain networks based on Gossip, when the network topology is random graph, scale-free graph, small-world network graph, the number of nodes is 10, 100, 1 000, 10 000 and the degree k is set to 2, 4, 8 respectively, OPPI reduces both the total propagation delay and the number of communication messages generated by the propagation process significantly, specifically, by 99.4% to 99.98% in the total propagation delay and by 99% to 99.1% in the number of communication messages.
  • Related Articles

    [1]Liu Zhaoqing, Gu Shilin, Hou Chenping. Online Classification Algorithm with Feature Inheritably Increasing and Decreasing[J]. Journal of Computer Research and Development, 2022, 59(8): 1668-1682. DOI: 10.7544/issn1000-1239.20220073
    [2]Nie Dongdong, Gong Yaoling. A Sparse Signal Reconstruction Algorithm Based on Approximate l\-0 Norm[J]. Journal of Computer Research and Development, 2018, 55(5): 1090-1096. DOI: 10.7544/issn1000-1239.2018.20160829
    [3]Wang Yujun, Gao Qiankun, Zhang Xian, and Tao Qing. A Coordinate Descent Algorithm for Solving Capped-L1 Regularization Problems[J]. Journal of Computer Research and Development, 2014, 51(6): 1304-1312.
    [4]Liao Shizhong, Wang Mei, Zhao Zhihui. Regularization Path Algorithm of SVM via Positive Definite Matrix[J]. Journal of Computer Research and Development, 2013, 50(11): 2253-2261.
    [5]Wang Quan and Chen Songcan. Ensemble Learning of ELM Regressors Based on l1-regularization[J]. Journal of Computer Research and Development, 2012, 49(12): 2631-2637.
    [6]Kong Kang, Tao Qing, Wang Qunshan, Chu Dejun. A Sub-Gadient Based Solver for L1-Rgularization+Hinge-Loss Problem[J]. Journal of Computer Research and Development, 2012, 49(7): 1494-1499.
    [7]Huang Weixian and Wang Guojin. The L\-2 Distances for Rational Surfaces Based on Matrix Representation of Degree Elevation[J]. Journal of Computer Research and Development, 2010, 47(8): 1338-1345.
    [8]Yang Yuexiang, Luo Yong, Ye Zhaohui, Cheng Lizhi. A Complete Frequency Lossless Watermarking Method via Bandelet and Adaptive Matrix Norm[J]. Journal of Computer Research and Development, 2007, 44(12): 1996-2003.
    [9]Zhang Shichao, Xu Yinjun, Gu Ning, Shi Baile. A Norm-Driven Grid Workflow State Machine Model[J]. Journal of Computer Research and Development, 2006, 43(2): 307-313.
    [10]Tian Yongjun and Chen Songcan. Matrix-Pattern-Oriented Ho-Kashyap Classifier with Regularization Learning[J]. Journal of Computer Research and Development, 2005, 42(9): 1628-1632.

Catalog

    Article views (1711) PDF downloads (713) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return