检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Rongxin Guo Zhenping Guo Zerui Lin Wenxian Jiang
机构地区:[1]College of Engineering,Huaqiao University,Quanzhou 362000,China [2]College of Computer Science and Technology,Huaqiao University,Xiamen 361021,China
出 处:《High-Confidence Computing》2024年第3期13-24,共12页高置信计算(英文)
基 金:supported by the Science and Technology Plan Project of Quanzhou City,Fujian Province of China(2022C020R);the Science and Technology Plan Project of Fujian Province of China(2023H0012)。
摘 要:The inefficiency of Consensus protocols is a significant impediment to blockchain and IoT convergence development.To solve the problems like inefficiency and poor dynamics of the Practical Byzantine Fault Tolerance(PBFT)in IoT scenarios,a hierarchical consensus protocol called DCBFT is proposed.Above all,we propose an improved k-sums algorithm to build a two-level consensus cluster,achieving an hierarchical management for IoT devices.Next,A scalable two-level consensus protocol is proposed,which uses a multi-primary node mechanism to solve the single-point-of-failure problem.In addition,a data synchronization process is introduced to ensure the consistency of block data after view changes.Finally,A dynamic reputation evaluation model is introduced to update the nodes’reputation values and complete the rotation of consensus nodes at the end of each consensus round.The experimental results show that DCBFT has a more robust dynamic and higher consensus efficiency.Moreover,After running for some time,the performance of DCBFT shows some improvement.
关 键 词:IoT Hierarchical consensus Clustering Reputation evaluation model Practical byzantine fault TOLERANCE
分 类 号:TP39[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.133.94.34