<?xml version="1.1" encoding="utf-8"?>
<article xsi:noNamespaceSchemaLocation="http://jats.nlm.nih.gov/publishing/1.1/xsd/JATS-journalpublishing1-mathml3.xsd" dtd-version="1.1" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"><front><journal-meta><journal-id journal-id-type="publisher-id">JERA</journal-id><journal-title-group><journal-title>Journal of Electronic Research and Application</journal-title></journal-title-group><issn>2208-3502</issn><eissn>2208-3510</eissn><publisher><publisher-name>Bio-Byword Scientific Publishing Pty. Ltd.</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.26689/jera.v10i2.13545</article-id><article-categories><subj-group subj-group-type="heading"><subject>Article</subject></subj-group></article-categories><title>RGS-PBFT: A Reputation-Based Grouping and Supervision PBFT</title><url>https://artdesignp.com/journal/JERA/10/2/10.26689/jera.v10i2.13545</url><author>QiXiangyuan,QiangGuanglei,ZhangQianxiang,FanZhuokun,DuYu</author><pub-date pub-type="publication-year"><year>2026</year></pub-date><volume>10</volume><issue>2</issue><history><date date-type="pub"><published-time>2026-03-31</published-time></date></history><abstract>To address the problems of high communication overhead, insufficient robustness in master node election, and difficulty in timely management of faulty nodes in large-scale networks, the traditional PBFT consensus algorithm is proposed as a reputation-based grouping and supervision PBFT (RGS-PBFT). This method constructs a dynamic reputation score model based on the behavioral characteristics of nodes during the consensus process, such as verification correctness, voting participation, and operational stability. Based on this model, nodes are divided into consensus groups, candidate node groups, and ordinary node groups, enabling adaptive adjustment of node roles. During the master node election phase, the top 5% of nodes with the highest reputation scores from the consensus groups are selected as the candidate set. The ordinary node group and the candidate node group elect the master node through reputation-weighted voting, thus balancing the reliability of the master node with the decentralized nature of the election process. During the consensus process, only the consensus group participates in the core voting and confirmation process of PBFT to reduce communication complexity, while the remaining nodes mainly undertake verification and supervision responsibilities. Simultaneously, a monitoring and punishment mechanism for low-reputation nodes is introduced to limit, downgrade, and isolate faulty and abnormal nodes. Experimental results show that this mechanism, while maintaining Byzantine fault tolerance, can effectively reduce consensus communication overhead and improve master node election stability and overall system performance.</abstract><keywords/></article-meta></front><body/><back><ref-list><ref id="B1" content-type="article"><label>1</label><element-citation publication-type="journal"><p>Wu X, Wang Z, Li X, et al., 2025, DBPBFT: A Hierarchical PBFT Consensus algorithm with dual blockchain for IoT. Future Generation Computer Systems, 2025(162): 107429.</p><pub-id pub-id-type="doi"/></element-citation></ref><ref id="B2" content-type="article"><label>2</label><element-citation publication-type="journal"><p>Liu X, Fan X, Niu B, et al., 2025, 5G-Practical Byzantine Fault Tolerance: An Improved PBFT Consensus Algorithm for the 5G Network. Information, 16(3): 202.</p><pub-id pub-id-type="doi"/></element-citation></ref><ref id="B3" content-type="article"><label>3</label><element-citation publication-type="journal"><p>Li W, Feng C, Zhang L, et al., 2020, A Scalable Multi-Layer PBFT Consensus for Blockchain. IEEE Transactions on Parallel and Distributed Systems, 32(5): 1146–1160.</p><pub-id pub-id-type="doi"/></element-citation></ref><ref id="B4" content-type="article"><label>4</label><element-citation publication-type="journal"><p>Zhao P, Qiang G, Fan Y, et al., 2025, YOLO11-FGA: Express Package Quality Detection Based on Improved YOLO11. Information, 16(12): 1021.</p><pub-id pub-id-type="doi"/></element-citation></ref><ref id="B5" content-type="article"><label>5</label><element-citation publication-type="journal"><p>Jiang W, Wu X, Song M, et al., 2023, Improved PBFT Algorithm Based on Comprehensive Evaluation Model. Applied Sciences, 13(2): 1117.</p><pub-id pub-id-type="doi"/></element-citation></ref><ref id="B6" content-type="article"><label>6</label><element-citation publication-type="journal"><p>Liu J, Deng X, Li W, et al., 2024, CG-PBFT: An Efficient PBFT Algorithm Based on Credit Grouping. Journal of Cloud Computing, 13(1): 74.</p><pub-id pub-id-type="doi"/></element-citation></ref><ref id="B7" content-type="article"><label>7</label><element-citation publication-type="journal"><p>Liu S, Zhang R, Liu C, et al., 2023, P-PBFT: An Improved Blockchain Algorithm to Support Large-Scale Pharmaceutical Traceability. Computers in Biology and Medicine, 2023(154): 106590.</p><pub-id pub-id-type="doi"/></element-citation></ref><ref id="B8" content-type="article"><label>8</label><element-citation publication-type="journal"><p>Li Z, Wang J, Li Y, 2025, An Improved PBFT Consensus Algorithm Based on Reputation and Gaming: An Improved PBFT Consensus Algorithm. Journal of Supercomputing, 81(1).</p><pub-id pub-id-type="doi"/></element-citation></ref><ref id="B9" content-type="article"><label>9</label><element-citation publication-type="journal"><p>Deng X, Zhang L, Zou Y, et al., 2025, DRAC‐PBFT: PBFT Consensus Optimisation Algorithm Based on Dynamic Reputation and Adaptive Clustering. IET Blockchain, 5(1): e70025.</p><pub-id pub-id-type="doi"/></element-citation></ref><ref id="B10" content-type="article"><label>10</label><element-citation publication-type="journal"><p>Wang Y, Dou J, Yang P, et al., 2025, Improved PBFT Algorithm Based on Reputations Synchronization and Group Consensus. International Journal of High Speed Electronics and Systems, 34(3): 2440103.</p><pub-id pub-id-type="doi"/></element-citation></ref><ref id="B11" content-type="article"><label>11</label><element-citation publication-type="journal"><p>Ding J, Wu X, Tian J, et al., 2025, RE-BPFT: An Improved PBFT Consensus Algorithm for Consortium Blockchain Based on Node Credibility and ID3-Based Classification. Applied Sciences, 15(13): 7591.</p><pub-id pub-id-type="doi"/></element-citation></ref><ref id="B12" content-type="article"><label>12</label><element-citation publication-type="journal"><p>Hussain M, Mehmood A, Khan M, et al., 2025, Reputation-Based Leader Selection Consensus Algorithm with Rewards for Blockchain Technology. Computers, 14(1): 20.</p><pub-id pub-id-type="doi"/></element-citation></ref><ref id="B13" content-type="article"><label>13</label><element-citation publication-type="journal"><p>Wang Y, Qiao Y, Ma J, et al., 2025, An Improved PBFT Consensus Algorithm for Blockchain Systems, Proceedings of the 9th International Conference on Electronic Information Technology and Computer Engineering, 715–719.</p><pub-id pub-id-type="doi"/></element-citation></ref><ref id="B14" content-type="article"><label>14</label><element-citation publication-type="journal"><p>Zhang Q, Su J, Ma Z, et al., 2021, Blockchain Model Testing and Implementation Based on Improved PFBT Consensus. 2021 11th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications (IDAACS). IEEE, 2021(2): 1010–1015.</p><pub-id pub-id-type="doi"/></element-citation></ref><ref id="B15" content-type="article"><label>15</label><element-citation publication-type="journal"><p>Chen P, Chen Y, Wang X, et al., 2024, A High-Capacity Slicing PBFT Protocol Based on Reputation Evaluation Model. Wireless Networks, 30(9): 7469–7482.</p><pub-id pub-id-type="doi"/></element-citation></ref><ref id="B16" content-type="article"><label>16</label><element-citation publication-type="journal"><p>Li Y, Wang Z, Fan J, et al., 2019, An Extensible Consensus Algorithm Based on PBFT. 2019 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC). IEEE, 17–23.</p><pub-id pub-id-type="doi"/></element-citation></ref></ref-list></back></article>
