Primary node election based on probabilistic linguistic term set with confidence interval in the PBFT consensus mechanism for blockchain

Xie, Mingyue; Liu, Jun; Chen, Shuyu; Xu, Guangxia; Lin, Mingwei

doi:10.1007/s40747-022-00857-9

Cited by 18 publications

(7 citation statements)

References 63 publications

(107 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The proposed P-PBFT algorithm (Placeholder for P-PBFT) effectively addresses issues such as high latency, high system overhead, and support for smaller-scale applications in the context of combining pharmaceutical traceability with blockchain technology. Reference 34 introduces the probability language term set with confidence intervals (PLTS-CI) for the practical Byzantine Fault Tolerance (PBFT) consensus mechanism. This terminology is used to express uncertain and complex voting information among nodes during leader election.…”

Section: Related Work and Preliminary Knowledgementioning

confidence: 99%

A secure and highly efficient blockchain PBFT consensus algorithm for microgrid power trading

Yao,

Fang,

Pan

et al. 2024

Sci Rep

View full text Add to dashboard Cite

There are a series of challenges in microgrid transactions, and blockchain technology holds the promise of addressing these challenges. However, with the increasing number of users in microgrid transactions, existing blockchain systems may struggle to meet the growing demands for transactions. Therefore, this paper proposes an efficient and secure blockchain consensus algorithm designed to meet the demands of large-scale microgrid electricity transactions. The algorithm begins by utilizing a Spectral clustering algorithm to partition the blockchain network into different lower-level consensus set based on the transaction characteristics of nodes. Subsequently, a dual-layer consensus process is employed to enhance the efficiency of consensus. Additionally, we have designed a secure consensus set leader election strategy to promptly identify leaders with excellent performance. Finally, we have introduced an authentication method that combines zero-knowledge proofs and key sharing to further mitigate the risk of malicious nodes participating in the consensus. Theoretical analysis indicates that our proposed consensus algorithm, incorporating multiple layers of security measures, effectively withstands blockchain attacks such as denial of service. Simulation experiment results demonstrate that our algorithm outperforms similar blockchain algorithms significantly in terms of communication overhead, consensus latency, and throughput.

show abstract

Section: Related Work and Preliminary Knowledgementioning

confidence: 99%

A secure and highly efficient blockchain PBFT consensus algorithm for microgrid power trading

Yao,

Fang,

Pan

et al. 2024

Sci Rep

View full text Add to dashboard Cite

show abstract

“…They termed it IACO. Figure 1 shows the flying ants added pheromone on additional nodes in addition to the ones directly in their path, increasing the possibility that those nodes will be investigated in later rounds [25]. When two nodes are close to one another, the amount of pheromone released on those nodes is inversely proportional to the distance between the nodes on the trail.…”

Section: An Adapted Ant-inspired Algorithm For Enhancing Web Service ...mentioning

confidence: 99%

A New Integrated Approach for Cloud Service Composition and Sharing Using a Hybrid Algorithm

J.,

R.,

2024

Mathematical Problems in Engineering

View full text Add to dashboard Cite

The concept of a “Smart City” emphasizes the need to employ information and communication technologies to strengthen the quality, connectivity, and efficiency of various municipal services. Cloud computing and the Internet of Things are shaping future tech. Both ideas greatly impact smart city application and solution development. Cloud computing is amazing at managing and storing remote service access. Several companies have switched to cloud leasing to reduce local resource burden. Due to the intricacy and flexibility of cloud-maintained services, selecting jobs that best suit client needs should be optimized. Quality of service criteria for each cloud service are the best tools for choosing and optimizing cloud carriers. Genetic algorithms (GAs) and ant colony optimization (ACO) are combined to make cloud computing. It is discovered that the recommended ACO + GA obtains an accuracy of 82% when compared to existing methods of energy- and reliability-aware multiobjective optimization method and the hybrid cuckoo particles swarm, artificial bee colony optimization (CPS + ABCO) where accuracy is 68% and 75%, respectively.

show abstract

“…Xie et al [31] used probabilistic language terminology to set confidence intervals for the selection of master nodes to improve the reliability of master nodes. Zhang et al [32] proposed a node reliability quantification mechanism to select highly reliable nodes to participate in block production.…”

Section: Related Workmentioning

confidence: 99%

Improved PBFT Algorithm Based on K-Means Clustering for Emergency Scenario Swarm Robotic Systems

Sun,

Fan

2023

IEEE Access

View full text Add to dashboard Cite

In order to solve the problem of data security and sharing efficiency caused by the complex and uncertain environment faced by swarm robotic systems in emergency scenarios, this paper designs a data security consensus algorithm based on blockchain technology. Aiming at the problems of high communication overhead, long consensus delay and low throughput when the traditional Practical Byzantine Fault Tolerance (PBFT) algorithm is applied to this scenario, a grouped practical Byzantine Fault Tolerance consensus algorithm based on K-means clustering is proposed. Firstly, the K-means clustering algorithm is used to group robotic nodes according to the location distribution of robotics in the emergency scenario. Secondly, a reputation mechanism is designed to dynamically evaluate the behaviour of robotic nodes in each group during the consensus process. Each consensus node is divided into master and slave chains according to its reputation score. The consensus task is firstly decomposed, and slave chains participate in the consensus in parallel. Finally, the master chain completes the global consensus, so as to reduce the communication times between nodes. The experimental results show that compared with the traditional PBFT, SG-PBFT and P-PBFT consensus algorithm, the proposed consensus algorithm effectively improves the system throughput, reduces the delay, reduces the communication overhead, and has a higher success rate of consensus. INDEX TERMS Swarm robotics, blockchain, PBFT, K-means clustering, master-slave multichain.

show abstract

Primary node election based on probabilistic linguistic term set with confidence interval in the PBFT consensus mechanism for blockchain

Cited by 18 publications

References 63 publications

A secure and highly efficient blockchain PBFT consensus algorithm for microgrid power trading

A secure and highly efficient blockchain PBFT consensus algorithm for microgrid power trading

A New Integrated Approach for Cloud Service Composition and Sharing Using a Hybrid Algorithm

Improved PBFT Algorithm Based on K-Means Clustering for Emergency Scenario Swarm Robotic Systems

Contact Info

Product

Resources

About