【Author】
Chen, Runyu; Wang, Lunwen; Zhu, Rangang
【Abstract】The Delegated Proof of Stake (DPoS) consensus mechanism uses the power of stakeholders to not only vote in a fair and democratic way to solve a consensus problem, but also reduce resource waste to a certain extent. However, the fixed number of member nodes and single voting type will affect the security of the whole system. In order to reduce the negative impact of the above problems, a new consensus algorithm based on vague set and node impact factors is proposed. We first use fuzzy values to calculate the ratings of all nodes and initially determine the number of agent nodes according to the preset threshold value. Then, we judge whether a secondary screening is needed. If needed, calculating the nodes' impact factor based on their neighboring nodes, and combining their impact factors with adjacency votes to further distinguish the nodes with the same fuzzy value. In addition, we analyze the dynamic changes in the composition and scale of the agent node set and give its ideal size through testing. Finally, we compare the proposed algorithm with DPoS algorithm and existing fuzzy set-based algorithms in different scales and network structures. Results show that no matter in what kind of network structures, the effectiveness of the proposed algorithm is improved. Among which, the most noticeable improvement is seen in complex network structures.
【Keywords】blockchain; consensus mechanism; DPoS; vague set; fuzzy value; impact factor
【标题】基于 Vague 集和节点影响因子的 Delegated Proof of Stake 共识机制改进
【摘要】委托权益证明（DPoS）共识机制利用利益相关者的力量，不仅以公平、民主的方式投票解决共识问题，而且在一定程度上减少了资源浪费。但是，固定数量的成员节点和单一的投票类型会影响整个系统的安全性。为了减少上述问题的负面影响，提出了一种基于模糊集和节点影响因子的共识算法。我们首先使用模糊值计算所有节点的评分，并根据预设的阈值初步确定代理节点的数量。然后，我们判断是否需要二次筛选。如果需要，可以根据相邻节点计算节点的影响因子，并将其影响因子与邻接投票相结合，进一步区分具有相同模糊值的节点。此外，我们分析了代理节点集的组成和规模的动态变化，并通过测试给出了其理想规模。最后，我们将所提出的算法与 DPoS 算法和现有的基于模糊集的算法在不同规模和网络结构下进行了比较。结果表明，无论在何种网络结构下，所提算法的有效性都有所提高。其中，最显着的改进是在复杂的网络结构中。
【关键词】区块链；共识机制； DPoS；模糊的集合；模糊值；影响因子
评论