检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:丁云波 夏琦[2,3] 田世云 陈伟 Ding Yunbo;Xia Qi;Tian Shiyun;Chen Wei(Sichuan Huashi Centralized Procurement&E-commerce Co.,Ltd.,Chengdu 610081,China;School of Computer Science&Enginee-ring(School of Cyber Security),University of Electronic Science&Technology of China,Chengdu 611731,China;Xiongan Blockchain Laboratory,Baoding Hebei 071703,China)
机构地区:[1]四川华西集采电子商务有限公司,成都610081 [2]电子科技大学计算机科学与工程学院(网络安全学院),成都611731 [3]雄安区块链实验室,河北保定071703
出 处:《计算机应用研究》2023年第11期3225-3234,共10页Application Research of Computers
基 金:国家自然科学基金资助项目(U22B2029);四川省科技创新人才项目(2023JDRC0001);基础加强计划资助项目(2021-JCJQ-JJ-0463)。
摘 要:区块链技术能够有效解决物联网场景下数据的可信共享问题,但主流共识算法往往存在较大延迟,难以处理多源异构的海量数据。针对此问题,提出一种动态多区块双轮次共识算法(DMDR)。该算法将交易验证和打包两个环节拆分,以交易提前处理和区块延后生成的方式使普通节点可利用共识等待时间处理交易,于单次共识内生成多个区块,提高数据处理效率。该算法将网络中的节点划分为多个集群,采用各集群与系统整体双轮次共识的方式减少通信开销,并基于集群内点的相互印证确保共识结果的准确性。仿真实验表明该算法的吞吐量优于PoW与PBFT,且在较小网络延迟中仍具有较可观的交易吞吐量。Blockchain technology can effectively solve the problem of trusted data sharing in the Internet of Things(IoT)scenario,but the main stream consensus algorithm may have a large delay,and it is difficult to process the mass heterogeneous data from multi-sources.To solve this problem,this paper proposed a dynamically multi-block double-round consensus algorithm(called DMDR).This algorithm split the two steps of transaction verification and packaging,and the way of transaction processing in advance and block generation in delay enabled the common node to take advantage of the waiting time to process the transaction and generate multiple blocks in a consensus,thus improving the data processing efficiency.This algorithm divided the nodes in the network into multiple clusters,and reduced the communication cost by the double-round consensus between each cluster and the whole system,and ensured the accuracy of the consensus results based on the mutual verification of the points in the cluster.The simulation results show that the throughput of the proposed algorithm is better than that of PoW and PBFT,and it still has a considerable transaction throughput in small delay.
分 类 号:TP391.44[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7