首页 | 本学科首页   官方微博 | 高级检索  
     检索      

可信激励算法对区块链移动节点共识优化研究
引用本文:刘云,马儀,田地,李公瑾.可信激励算法对区块链移动节点共识优化研究[J].四川大学学报(自然科学版),2022,59(6):062004.
作者姓名:刘云  马儀  田地  李公瑾
作者单位:昆明理工大学信息工程与自动化学院,昆明理工大学信息工程与自动化学院,昆明理工大学信息工程与自动化学院,昆明理工大学信息工程与自动化学院
基金项目:国家自然科学基金(61761025);云南省重大科技专项计划项目资助(202002AD080002)
摘    要:节点可移动的物联网应用区块链时将节点称为区块链移动节点,区块链移动节点存在通信连通时间较短、算力和存储能力不足等问题导致网络达成共识时安全性和吞吐量较低.提出一种可信激励算法对共识过程进行优化,首先区块链移动节点接收共识所需信息完成初始化;其次每个区块链移动节点生成判决块,判决块包含对验证消息的投票结果、自身的可信因子和判决块的生成时间,根据判决块中在相邻区块链移动节点组成的集群中选出中继节点,中继节点传播验证消息到下一个集群,并产生区块存储在边缘服务器,一个中继为一跳,当跳数大于网络阈值跳数时完成共识;最后根据激励机制对节点奖励或惩罚,并按激励情况更新节点的行为标识反馈到共识.仿真结果表明,与应用在同样网络情况的PoET和PoS算法相比,可信激励算法在保证了一定的吞吐量情况下,有效降低验证消息验证失败率提高了共识安全性,更适合节点可移动的物联网网络.

关 键 词:移动节点  判决块  可信因子  共识算法  吞吐量  安全性
收稿时间:2022/4/7 0:00:00
修稿时间:2022/5/24 0:00:00

Research on consensus optimization of trusted incentive algorithm for blockchain mobile nodes
LIU Yun,MA Yi,TIAN Di and LI Gong-Jin.Research on consensus optimization of trusted incentive algorithm for blockchain mobile nodes[J].Journal of Sichuan University (Natural Science Edition),2022,59(6):062004.
Authors:LIU Yun  MA Yi  TIAN Di and LI Gong-Jin
Institution:Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming,Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming,Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming,Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming
Abstract:When applying blockchain in the Internet of things with mobile nodes, these nodes are called blockchain mobile nodes. Blockchain mobile nodes have problems such as short communication connection time, insufficient computing power and storage capacity, resulting in low security and throughput when the network reaches a consensus. To tackle these drawbacks, a trusted incentive algorithm is proposed to optimize the consensus process. First the blockchain mobile node receives the information required by the consensus and completes the initialization. Secondly, each blockchain mobile node generates a decision block, which contains the voting result of the verification message, its own credibility factor and the generation time of the decision block. A relay node is selected from the cluster composed of adjacent blockchain mobile nodes by the decision block. The relay node propagates the verification message to the next cluster and the generated blocks are stored in the edge server. One relay is one hop, the consensus is completed when the number of hops is greater than the network threshold number of hops. Finally, the network rewards or punishes the nodes according to the incentive mechanism, and updates the behavior identifications of the nodes according to the incentive situation, the behavior identifications is then fed back to the consensus. The simulation results show that compared with the POET and POS algorithms applied in the same network, the trusted incentive algorithm can effectively reduce the verification failure rate of verification messages and improve the consensus security under the condition of ensuring a certain throughput. It is more suitable for the Internet of things with mobile nodes.
Keywords:Mobile node  Decision block  Reliability facto  Consensus algorithm  Throughput  Security
点击此处可从《四川大学学报(自然科学版)》浏览原始摘要信息
点击此处可从《四川大学学报(自然科学版)》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号