基于可信度的PBFT共识机制改进

Wang Ziyang, Wang Juan, Liu Yaning, Wang Wei
{"title":"基于可信度的PBFT共识机制改进","authors":"Wang Ziyang, Wang Juan, Liu Yaning, Wang Wei","doi":"10.1109/ICCWAMTIP53232.2021.9674168","DOIUrl":null,"url":null,"abstract":"Consensus mechanism is particularly critical in blockchain technology. Aiming at the shortcomings of traditional consensus mechanisms in the application of power system engineering management, this article improves the Byzantine Fault Tolerance (PBFT) consensus algorithm based on the reputation value. First, according to different business environments, design the corresponding credit value influencing factors, and then use each influencing factor as input, and use the random forest algorithm to classify the nodes into three node clusters based on the reputation value of high, medium, and low. Election of the master node is carried out in the high reputation value node cluster and the continuous election of the master node is suppressed, and the low reputation value cluster is detected to find possible malicious nodes. The simulation experiment results show that the master nodes are more secure and evenly distributed; at the same time, malicious nodes in the system can be found to ensure system stability.","PeriodicalId":358772,"journal":{"name":"2021 18th International Computer Conference on Wavelet Active Media Technology and Information Processing (ICCWAMTIP)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Improvement of PBFT Consensus Mechanism Based on Credibility\",\"authors\":\"Wang Ziyang, Wang Juan, Liu Yaning, Wang Wei\",\"doi\":\"10.1109/ICCWAMTIP53232.2021.9674168\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Consensus mechanism is particularly critical in blockchain technology. Aiming at the shortcomings of traditional consensus mechanisms in the application of power system engineering management, this article improves the Byzantine Fault Tolerance (PBFT) consensus algorithm based on the reputation value. First, according to different business environments, design the corresponding credit value influencing factors, and then use each influencing factor as input, and use the random forest algorithm to classify the nodes into three node clusters based on the reputation value of high, medium, and low. Election of the master node is carried out in the high reputation value node cluster and the continuous election of the master node is suppressed, and the low reputation value cluster is detected to find possible malicious nodes. The simulation experiment results show that the master nodes are more secure and evenly distributed; at the same time, malicious nodes in the system can be found to ensure system stability.\",\"PeriodicalId\":358772,\"journal\":{\"name\":\"2021 18th International Computer Conference on Wavelet Active Media Technology and Information Processing (ICCWAMTIP)\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-12-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 18th International Computer Conference on Wavelet Active Media Technology and Information Processing (ICCWAMTIP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCWAMTIP53232.2021.9674168\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 18th International Computer Conference on Wavelet Active Media Technology and Information Processing (ICCWAMTIP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCWAMTIP53232.2021.9674168","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

共识机制在区块链技术中尤为关键。针对传统共识机制在电力系统工程管理应用中的不足,改进了基于声誉值的拜占庭容错(PBFT)共识算法。首先,根据不同的商业环境,设计相应的信用值影响因素,然后将每个影响因素作为输入,使用随机森林算法将节点按照信誉值的高、中、低分为三个节点簇。在信誉值高的节点集群中进行主节点的选举,抑制主节点的连续选举,检测信誉值低的节点集群,发现可能存在的恶意节点。仿真实验结果表明,主节点更安全、分布更均匀;同时发现系统中的恶意节点,保证系统的稳定性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Improvement of PBFT Consensus Mechanism Based on Credibility
Consensus mechanism is particularly critical in blockchain technology. Aiming at the shortcomings of traditional consensus mechanisms in the application of power system engineering management, this article improves the Byzantine Fault Tolerance (PBFT) consensus algorithm based on the reputation value. First, according to different business environments, design the corresponding credit value influencing factors, and then use each influencing factor as input, and use the random forest algorithm to classify the nodes into three node clusters based on the reputation value of high, medium, and low. Election of the master node is carried out in the high reputation value node cluster and the continuous election of the master node is suppressed, and the low reputation value cluster is detected to find possible malicious nodes. The simulation experiment results show that the master nodes are more secure and evenly distributed; at the same time, malicious nodes in the system can be found to ensure system stability.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Joint Modulation and Coding Recognition Using Deep Learning Chinese Short Text Classification Based On Deep Learning Solving TPS by SA Based on Probabilistic Double Crossover Operator Personalized Federated Learning with Gradient Similarity Implicit Certificate Based Signcryption for a Secure Data Sharing in Clouds
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1