Abstract
This study proposes a primary node election method based on probabilistic linguistic term set (PLTS) for the practical Byzantine fault tolerance (PBFT) consensus mechanism to effectively enhance the efficiency of reaching consensus. Specifically, a novel concept of the probabilistic linguistic term set with a confidence interval (PLTS-CI) is presented to express the uncertain complex voting information of nodes during primary node election. Then, a novel score function based on the exponential semantic value and confidence approximation value for the PLTS-CI, called Score-ESCA, is used to solve the problems of comparing different nodes with various voting attitudes. This method helps select the node with the highest score by utilizing complex decision attitudes, making it an accurate primary node election solution. Furthermore, the feasibility of our proposed method is proved by both theoretical analysis and experimental evaluations.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
