检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李美玲 赵金东 田志宏 武栓虎 LI Meiling;ZHAO Jindong;TIAN Zhihong;WU Shuanhu(School of Computer and Control Engineering,Yantai University,Yantai 264005,China)
机构地区:[1]烟台大学计算机与控制工程学院,山东烟台264005
出 处:《郑州大学学报(理学版)》2023年第5期25-31,共7页Journal of Zhengzhou University:Natural Science Edition
基 金:国家自然科学基金项目(61972360);山东省自然科学基金项目(ZR2020MF148)。
摘 要:针对委托权益证明(delegated proof of stake,DPoS)中节点投票不积极和恶意节点操纵选举结果的问题,提出一种基于共邻节点相似度改进的DPoS(DPoS based on similarity of common neighbor nodes,S-DPoS)共识算法。首先,引入共邻节点相似度模型实现社区划分,缩短投票周期,提高共识效率。其次,计算节点的信誉度,各社区选出一个信誉度最高的节点作为见证节点且负责生产区块,通过节点身份转换机制及时更新节点类别。最后,通过奖惩机制对节点进行奖惩,快速剔除错误节点。仿真实验结果表明,S-DPoS共识算法的节点参与度比DPoS算法提高30%~40%,并且能够有效降低恶意节点操纵选举结果的可能性,增强了系统的安全性。Aiming at the problem that the voting of the nodes in the delegated proof of stake(DPoS)was not active and the election results were manipulated by malicious nodes,an improved DPoS consensus algorithm based on similarity of common neighbor nodes(S-DPoS)was proposed.Firstly,the common neighbor node similarity model was introduced to realize community division,shorten voting period and improve consensus efficiency.Secondly,the credit value of nodes was calculated,and each community selected a node with the highest credit value as the witness node to generate the block.The node identity transformation mechanism updated the node category in time.Finally,the nodes were rewarded or punished according to the reward and punishment mechanism,and the malicious nodes were eliminated quickly.The simulation results showed that the node participation of S-DPoS consensus algorithm was 30%~40%higher than that of DPoS,and could effectively reduce the possibility of malicious nodes manipulating election results and enhance the security of the system.
分 类 号:TP311[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.16.143.199