检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:张旺 葛云生[1] Zhang Wang;Ge Yunsheng(School of Information Science and Engineering,Guilin University of Technology,Guilin 541006,Guangxi,China)
机构地区:[1]桂林理工大学信息科学与工程学院,广西桂林541006
出 处:《计算机应用与软件》2022年第5期267-272,298,共7页Computer Applications and Software
基 金:国家自然科学基金项目(61563012);“嵌入式技术与智能系统”广西高校重点实验室基金项目。
摘 要:共识机制作为区块链的核心,针对区块链共识效率较低、消耗大量算力及电力资源等问题,权益证明(Proof of Stake,PoS)对工作量证明(Proof of Work,PoW)有所改进,却又存在权益中心化的风险。提出基于节点分组的权益证明共识机制,将节点按币龄分组,各分组依次竞争并在各组内产生收益,用以提高低币龄节点出块概率以及降低单次共识全网消耗。同时提出虚拟币龄与无币龄队列解决系统初始节点无币问题以及根据队列特性控制共识过程中高代币节点参与竞争频率。实验结果表明,改进后的PoS算法能够有效提升低币龄节点出块概率,防止权益中心化以及进一步减少资源的消耗与浪费。As the core of block chain,consensus has several problems such as the low consensus efficiency and consumption of a lot of computing power and power resources.Proof of Stake(PoS)improves Proof of Work(PoW),but there is the risk of equity centralization.This paper proposes a consensus of PoS based on node grouping.We grouped the nodes by coinage.And each group competed in turn and generated revenue so as to improve the probability of low coinage nodes and reduce the consumption of single consensus in the whole network.The virtual coinage and no-coinage queues were proposed to solve the problem of initial node without token,and to control the frequency of high token nodes participating in competition in the consensus process according to the characteristics of queues.The experimental results show that the improved PoS algorithm can effectively improve the probability of low coinage nodes,prevent the centralization of rights and interests,and further reduce the consumption and waste of resources.
分 类 号:TP3[自动化与计算机技术—计算机科学与技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.143.211.215