Please wait a minute...
浙江大学学报(工学版)
浙江大学学报(工学版)  2024, Vol. 58 Issue (1): 1-9    DOI: 10.3785/j.issn.1008-973X.2024.01.001
计算机技术     
基于小世界理论的区块链Kademlia网络改进方法
赵越1,2(),赵赫1,谭海波1,2,*(),余斌3,俞望年1,2,马志宇1,2
1. 中国科学院合肥物质科学研究院，安徽 合肥 230031
2. 中国科学技术大学，安徽 合肥 230026
3. 安徽中科晶格技术有限公司，安徽 合肥 230088
Improved method for blockchain Kademlia network based on small world theory
Yue ZHAO1,2(),He ZHAO1,Haibo TAN1,2,*(),Bin YU3,Wangnian YU1,2,Zhiyu MA1,2
1. Hefei Institutes of Physical Science, Chinese Academy of Sciences, Hefei 230031, China
2. University of Science and Technology of China, Hefei 230026, China
3. Anhui ZhongKeJingGe Technology Limited Company, Hefei 230088, China
 全文: PDF(1194 KB)   HTML
摘要：

针对当前区块链Kademlia网络研究中通常以牺牲安全性为代价提升可扩展性的问题，提出基于小世界理论的区块链Kademlia网络改进方法. 该方法遵循小世界理论的思想，提出置换扩容节点的概率公式，概率与节点间距离呈反比，节点置换次数和额外增加的节点数量可以根据实际情况灵活调整. 通过理论分析和实验验证，证明了采用该方法改造的网络能够达到最终的稳定状态. 实验结果显示，利用该方法将全网广播交易消息时须经历的传输层级减少了15.0%~30.8%，加快了定位节点的速率. 与其他改变网络结构的优化算法相比，该方法降低了网络的结构化程度，增强了网络的安全性.
关键词： 区块链;  Kademlia网络;  小世界理论;  安全性    
Abstract:

An improved method for the blockchain Kademlia network based on small world theory was proposed aiming at the issue of sacrificing security to improve scalability in the current research of the blockchain Kademlia network. The idea of the small world theory was followed, and a probability formula for replacing expansion nodes was proposed. The probability was inversely proportional to the distance between nodes. The number of node replacements and additional nodes could be flexibly adjusted according to actual conditions. The theoretical analysis and experimental verification demonstrate that the network transformed by this method can reach a stable state. The experimental results showed that the transmission hierarchy required for broadcasting transaction messages throughout the network was reduced by 15.0% to 30.8% and the rate of locating nodes was increased. The level of network structure was reduced and network security was enhanced compared to other optimization algorithms that modify the network structure.
Key words: blockchain    Kademlia network    small world theory    security
收稿日期: 2023-05-11 出版日期: 2023-11-07
CLC:  TP 311  
基金资助: 国家重点研发计划资助项目（2021YFB2700800）
通讯作者: 谭海波     E-mail: agszy@mail.ustc.edu.cn;hbtan@hfcas.ac.cn
作者简介: 赵越（2000—），男，硕士生，从事区块链技术的研究. orcid.org/0009-0001-0576-9105. E-mail： agszy@mail.ustc.edu.cn
服务　　
把本文推荐给朋友
加入引用管理器
E-mail Alert
作者相关文章　　
赵越
赵赫
谭海波
余斌
俞望年
马志宇

引用本文:

赵越,赵赫,谭海波,余斌,俞望年,马志宇. 基于小世界理论的区块链Kademlia网络改进方法[J]. 浙江大学学报(工学版), 2024, 58(1): 1-9.

Yue ZHAO,He ZHAO,Haibo TAN,Bin YU,Wangnian YU,Zhiyu MA. Improved method for blockchain Kademlia network based on small world theory. Journal of ZheJiang University (Engineering Science), 2024, 58(1): 1-9.

链接本文:

https://www.zjujournals.com/eng/CN/10.3785/j.issn.1008-973X.2024.01.001    或    https://www.zjujournals.com/eng/CN/Y2024/V58/I1/1

图 1  8节点二叉前缀树
图 2  小世界Kad的工作流程图
图 3  节点a的四状态转换图
图 4  不同初始状态时算法的平均广播跳数
图 5  不同维度时算法的平均广播跳数
图 6  不同比例时算法的平均广播跳数
图 7  不同参数组合时提出模型与其他模型的对比
图 8  平均广播跳数的优化比例
图 9  调整后的平均广播跳数优化比例
图 10  平均查找跳数的优化比例
图 11  发动50%的日蚀攻击的虚假节点数量优化比例
1 RUAN P, CHEN G, DINH T T A, et al Fine-grained, secure and efficient data provenance on blockchain systems[J]. Proceedings of the VLDB Endowment, 2019, 12 (9): 975- 988
doi: 10.14778/3329772.3329775
2 KLEINBERG J. The small-world phenomenon: an algorithmic perspective [C]// Proceedings of the 32nd Annual ACM Symposium on Theory of Computing. Portland: ACM, 2000: 163-170.
3 YU B, LI X, ZHAO H, et al A scalable blockchain network model with transmission paths and neighbor node subareas[J]. Computing, 2022, 104 (10): 2253- 2277
doi: 10.1007/s00607-021-00913-1
4 LIANG G. An improved Kademlia routing algorithm for P2P network [C]// 2009 International Conference on New Trends in Information and Service Science. Beijing: IEEE, 2009: 63-66.
5 ZHANG Y, VENKATAKRISHNAN S B. Kadabra: adapting Kademlia for the decentralized web [EB/OL]. (2023-02-14)[2023-05-11]. https://arxiv.org/pdf/2210.12858.pdf.
6 EISENBARTH J P, CHOLEZ T, PERRIN O Ethereum’s peer-to-peer network monitoring and sybil attack prevention[J]. Journal of Network and Systems Management, 2022, 30 (4): 65
doi: 10.1007/s10922-022-09676-2
7 XU G, GUO B, SU C, et al Am I eclipsed? a smart detector of eclipse attacks for Ethereum[J]. Computers and Security, 2020, 88: 101604
doi: 10.1016/j.cose.2019.101604
8 MILGRAM S The small world problem[J]. Psychology Today, 1967, 2 (1): 60- 67
9 WATTS D J, STROGATZ S H Collective dynamics of ‘small-world’ networks[J]. Nature, 1998, 393 (6684): 440- 442
doi: 10.1038/30918
10 WATTS D J, DODDS P S, NEWMAN M E Identity and search in social networks[J]. Science, 2002, 296 (5571): 1302- 1305
doi: 10.1126/science.1070120
11 ZOU F, LI Y, ZHANG L, et al. CCAN: cache-based CAN using the small world model [C]// International Conference on Web-Age Information Management. Berlin: Springer, 2004: 167-175.
12 高伟. 基于小世界特性的 P2P 网络搜索优化技术的研究 [D]. 成都: 电子科技大学, 2010.
GAO Wei. A study of P2P network search optimization technology based on small-world characteristics [D]. Chengdu: University of Electronic Science and Technology of China, 2010.
13 SERENA L, FERRETTI S, DANGELO G Cryptocurrencies activity as a complex network: analysis of transactions graphs[J]. Peer-to-Peer Networking and Applications, 2022, 15 (2): 839- 853
doi: 10.1007/s12083-021-01220-4
14 WANG T, ZHAO C, YANG Q, et al Ethna: analyzing the underlying peer-to-peer network of ethereum blockchain[J]. IEEE Transactions on Network Science and Engineering, 2021, 8 (3): 2131- 2146
doi: 10.1109/TNSE.2021.3078181
15 SOHN I. Modeling and implementing small world network [C]// International Conference on Information and Communication Technology Convergence. Jeju: IEEE, 2016: 414-416.
16 WRIGHT P E Statistical complexity of the power method for Markov chains[J]. Journal of Complexity, 1989, 5 (2): 119- 143
doi: 10.1016/0885-064X(89)90001-0
17 PETER L Q, HALIM F. Routing in small world networks [EB/OL]. (2007-12-18)[2023-05-11]. http://citeseerx.ist.psu.edu/viewdoc/download;jsessionid=0097D97AABC11B06D73091E7EB60EDC1?doi=10.1.1.129.1445&rep=rep1&type=pdf.
18 魏战争, 刘彩虹 中型网络中交换机连接技术的探讨[J]. 科学技术创新, 2010, (18): 69
WEI Zhanzheng, LIU Caihong Discussion on switch connection technology in medium-sized network[J]. Scientific and Technological Innovation, 2010, (18): 69
doi: 10.3969/j.issn.1673-1328.2010.18.070
19 KARAME G O, ANDROULAKI E, CAPKUN S. Double-spending fast payments in bitcoin [C]// Proceedings of the 2012 ACM Conference on Computer and Communications Security. Raleigh: ACM, 2012: 906-917.
20 DOULIGERIS C, MITROKOTSA A DDoS attacks and defense mechanisms: classification and state-of-the-art[J]. Computer Networks, 2004, 44 (5): 643- 666
doi: 10.1016/j.comnet.2003.10.003
21 DOUCEUR J R. The sybil attack[C]// International Workshop on Peer-to-Peer Systems. Berlin: Springer, 2002: 251-260.
22 MARCUS Y, HEILMAN E, GOLDBERG S Low-resource eclipse attacks on Ethereum’s peer-to-peer network[J]. Cryptology Eprint Archive, 2018, (236): 1- 15
[1] 崔璨,杨小虎,邱炜伟,黄方蕾. 基于GPU的区块链交易验签加速技术[J]. 浙江大学学报(工学版), 2023, 57(8): 1505-1515.
[2] 王传华,张权,王慧敏,徐欣,麻瓯勃. 区块链架构下具有隐私保护的车联网信誉模型[J]. 浙江大学学报(工学版), 2023, 57(4): 760-772.
[3] 刘雪娇,宋庆武,夏莹杰. 基于区块链的车联网矩阵计算安全卸载方案[J]. 浙江大学学报(工学版), 2023, 57(1): 144-154.
[4] 杨晋生,王浩,高镇,郭朝晖. 基于双RSA累加器的无状态交易验证方案[J]. 浙江大学学报(工学版), 2023, 57(1): 178-189.
[5] 刘雪娇,王慧敏,夏莹杰,赵思苇. 具有隐私保护的车联网空间众包任务分配方法[J]. 浙江大学学报(工学版), 2022, 56(7): 1267-1275.
[6] 何苗,柏粉花,于卓,沈韬. 区块链中可公开验证密钥共享技术[J]. 浙江大学学报(工学版), 2022, 56(2): 306-312.
[7] 董思含,信俊昌,郝琨,姚钟铭,陈金义. 多区块链环境下的连接查询优化算法[J]. 浙江大学学报(工学版), 2022, 56(2): 313-321.
[8] 孙亮,李晓风,赵赫,余斌,周桐,李皙茹. 基于NFT的实物上链资产化方法[J]. 浙江大学学报(工学版), 2022, 56(10): 1900-1911.
[9] 梁秀波,吴俊涵,赵昱,尹可挺. 区块链数据安全管理和隐私保护技术研究综述[J]. 浙江大学学报(工学版), 2022, 56(1): 1-15.
[10] 王砚麟,王克义,王奎成,莫宗骏,王璐莹. 仿肌肉绳索驱动下肢康复机器人系统使用安全性评价[J]. 浙江大学学报(工学版), 2022, 56(1): 168-177.
[11] 刘雪娇,殷一丹,陈蔚,夏莹杰,许佳丽,韩立东. 基于区块链的车联网数据安全共享方案[J]. 浙江大学学报(工学版), 2021, 55(5): 957-965.
[12] 盛念祖, 李芳, 李晓风, 赵赫, 周桐. 基于区块链智能合约的物联网数据资产化方法[J]. 浙江大学学报(工学版), 2018, 52(11): 2150-2158.
[13] 崔磊, 何勇, 金伟良. 不同海域Semi平台关键节点的疲劳可靠性分析[J]. J4, 2013, 47(8): 1329-1337.
[14] 李勰, 陈水福. 门式刚架轻钢结构抗风安全性分析[J]. J4, 2013, 47(12): 2141-2145.
[15] 俞婷婷, 王卫标, 尤爱菊. 钱塘江下沙海塘越顶安全性分析[J]. J4, 2009, 43(8): 1543-1548.