Design of reputation-driven blockchain sharding consensus and incentive mechanism

The PBFT (Practical Byzantine Fault Tolerance) consensus algorithm was confronted with several challenges in the blockchain sharding environment, including high communication complexity, random leader election, node insecurity, and insufficient participation incentives. To address these issues, a re...

Full description

Saved in:
Bibliographic Details
Main Authors: TIAN Hanwen, ZHANG Shuhui, WANG Lianhai, XU Shujiang, SHAO Wei
Format: Article
Language:English
Published: POSTS&TELECOM PRESS Co., LTD 2025-02-01
Series:网络与信息安全学报
Subjects:
Online Access:http://www.cjnis.com.cn/thesisDetails#10.11959/j.issn.2096-109x.2025002
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1850057519509012480
author TIAN Hanwen
ZHANG Shuhui
WANG Lianhai
XU Shujiang
SHAO Wei
author_facet TIAN Hanwen
ZHANG Shuhui
WANG Lianhai
XU Shujiang
SHAO Wei
author_sort TIAN Hanwen
collection DOAJ
description The PBFT (Practical Byzantine Fault Tolerance) consensus algorithm was confronted with several challenges in the blockchain sharding environment, including high communication complexity, random leader election, node insecurity, and insufficient participation incentives. To address these issues, a reputation-driven blockchain sharding consensus and incentive mechanism was proposed. Reputation mechanisms were utilized to evaluate and incentivize node behavior, thereby enhancing system trust and promoting active participation. Aggregated signature technology was employed to merge consensus node signatures, and node voting weights were determined based on reputation assessments, which reduced communication overhead and improved consensus equality and security. Additionally, a deposit and incentive mechanism was introduced under reputation management, where initial entry standards were set and gradually increased over time according to reputation values. Differentiated incentive models, based on node roles, were designed to balance stable income and dynamic rewards, thereby continuously improving network stability and security. Simulation results demonstrated that the proposed R-PBFT consensus algorithm outperformed the traditional PBFT, maintaining lower latency and higher throughput, which effectively enhanced system performance. Furthermore, compared to proportional incentive allocation based solely on reputation, the proposed incentive mechanism achieves higher consensus participation rates.
format Article
id doaj-art-c8d164ec41ae42d69c2fb6c574db99d1
institution DOAJ
issn 2096-109X
language English
publishDate 2025-02-01
publisher POSTS&TELECOM PRESS Co., LTD
record_format Article
series 网络与信息安全学报
spelling doaj-art-c8d164ec41ae42d69c2fb6c574db99d12025-08-20T02:51:24ZengPOSTS&TELECOM PRESS Co., LTD网络与信息安全学报2096-109X2025-02-011114115086731994Design of reputation-driven blockchain sharding consensus and incentive mechanismTIAN HanwenZHANG ShuhuiWANG LianhaiXU ShujiangSHAO WeiThe PBFT (Practical Byzantine Fault Tolerance) consensus algorithm was confronted with several challenges in the blockchain sharding environment, including high communication complexity, random leader election, node insecurity, and insufficient participation incentives. To address these issues, a reputation-driven blockchain sharding consensus and incentive mechanism was proposed. Reputation mechanisms were utilized to evaluate and incentivize node behavior, thereby enhancing system trust and promoting active participation. Aggregated signature technology was employed to merge consensus node signatures, and node voting weights were determined based on reputation assessments, which reduced communication overhead and improved consensus equality and security. Additionally, a deposit and incentive mechanism was introduced under reputation management, where initial entry standards were set and gradually increased over time according to reputation values. Differentiated incentive models, based on node roles, were designed to balance stable income and dynamic rewards, thereby continuously improving network stability and security. Simulation results demonstrated that the proposed R-PBFT consensus algorithm outperformed the traditional PBFT, maintaining lower latency and higher throughput, which effectively enhanced system performance. Furthermore, compared to proportional incentive allocation based solely on reputation, the proposed incentive mechanism achieves higher consensus participation rates.http://www.cjnis.com.cn/thesisDetails#10.11959/j.issn.2096-109x.2025002blockchainsharding techniquereputationPBFT consensus algorithmincentive
spellingShingle TIAN Hanwen
ZHANG Shuhui
WANG Lianhai
XU Shujiang
SHAO Wei
Design of reputation-driven blockchain sharding consensus and incentive mechanism
网络与信息安全学报
blockchain
sharding technique
reputation
PBFT consensus algorithm
incentive
title Design of reputation-driven blockchain sharding consensus and incentive mechanism
title_full Design of reputation-driven blockchain sharding consensus and incentive mechanism
title_fullStr Design of reputation-driven blockchain sharding consensus and incentive mechanism
title_full_unstemmed Design of reputation-driven blockchain sharding consensus and incentive mechanism
title_short Design of reputation-driven blockchain sharding consensus and incentive mechanism
title_sort design of reputation driven blockchain sharding consensus and incentive mechanism
topic blockchain
sharding technique
reputation
PBFT consensus algorithm
incentive
url http://www.cjnis.com.cn/thesisDetails#10.11959/j.issn.2096-109x.2025002
work_keys_str_mv AT tianhanwen designofreputationdrivenblockchainshardingconsensusandincentivemechanism
AT zhangshuhui designofreputationdrivenblockchainshardingconsensusandincentivemechanism
AT wanglianhai designofreputationdrivenblockchainshardingconsensusandincentivemechanism
AT xushujiang designofreputationdrivenblockchainshardingconsensusandincentivemechanism
AT shaowei designofreputationdrivenblockchainshardingconsensusandincentivemechanism