中北大学学报（自然科学版）2023，Vol.44Issue(6)：632-640,9.DOI:10.3969/j.issn.1673-3193.2023.06.007
基于改进PBFT算法的雾节点信任评估研究
Research on Trust Assessment of Fog Nodes Based on Improved PBFT Algorithm
摘要
Abstract
Based on improved Practical Byzantine Fault Tolerance(PBFT),a trust computing mecha-nism for fog nodes was proposed in order to solve the current problems of low communication security and efficiency from the fog nodes to the underlying node in fog computing.Firstly,a trust model for the fog layer was made by using the consensus mechanism of improved PBFT algorithm to get the trust val-ue of nodes and judge the trust state of nodes.Then,the master node for the fog layer was selected ac-cording to the trust value of the node,and the consensus groups was built.Finally,the optimal fog node could be selected for the task request of the underlying node from the weighted average and normalized processing of the three trust indexes of node trust value,communication distance and node load rate by the major node.Simulation results show that the proportion of malicious nodes in this method is reduced by 23.6％,the throughput rate is increased by 90％,and the average processing delay is reduced by 1 000 ms,which effectively improves the security and efficiency of communication between the bottom node and the fog node.关键词
雾计算/PBFT/共识算法/信任评估Key words
fog computing/PBFT/consensus algorithm/trust assessment分类
信息技术与安全科学引用本文复制引用
薛彪,石琼,师智斌,段辉..基于改进PBFT算法的雾节点信任评估研究[J].中北大学学报（自然科学版）,2023,44(6):632-640,9.基金项目
山西省自然科学基金资助项目(20210302123075) （20210302123075）
