A node selection algorithm with a genetic method based on PBFT in consortium blockchains

Zhang, Jinyu; Yang, Yumeng; Zhao, Dan; Wang, Yue

doi:10.1007/s40747-022-00907-2

Cited by 10 publications

(4 citation statements)

References 44 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Experimental results demonstrate that R-PBFT outperforms state-of-the-art methods and is resilient to various attacks. Reference 36 presents an improved blockchain consensus algorithm using a genetic algorithm-based approach. It designs fitness functions for blockchain nodes and applies a genetic algorithm to iteratively generate consensus node groups with superior performance metrics.…”

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

“…This innovative approach substantially diminishes inter-node communication overhead and augments consensus efficiency. Furthermore, Zhang et al [20] have proposed an optimization scheme for blockchain consensus algorithms, grounded in genetic algorithms. This approach meticulously utilizes genetic algorithms to iteratively select consensus node groups characterized by exceptional performance indicators through the PBFT consensus process.…”

Section: Related Workmentioning

confidence: 99%

Improving byzantine fault tolerance based on stake evaluation and consistent hashing

Wu,

Lai,

et al. 2024

Peer-to-Peer Netw. Appl.

View full text Add to dashboard Cite

In the context of distributed systems, Byzantine fault tolerance plays a critical role in ensuring the normal operation of the system, particularly when facing with malicious nodes. However, challenges remain in enhancing the security and reliability of Byzantine fault-tolerant systems. This paper addresses these challenges by improving a Byzantine fault-tolerant approach based on stake evaluation and improved consistency hashing. We propose a method that leverages node stakes to enhance system security and reliability by allocating different trust values. Additionally, we introduce improvements to the consistency hashing technique, enabling its effective operation in a Byzantine fault-tolerant environment. By introducing redundant nodes on the hash ring to mitigate the impact of malicious nodes, we enhance system fault tolerance and scalability. Experimental results demonstrate a significant improvement in system security and performance using this approach. These findings suggest that our method holds considerable potential for widespread application in the field of Byzantine fault tolerance, supporting the development of more reliable blockchain systems.

show abstract

“…It improved the security and the quality of nodes in the blockchain network. Zhang et al [32]proposed a genetic algorithm and used it in PBFT. It monitored the behavior of the nodes in the committee, and selected nodes multiple times due to the indicators to get the best consensus group.…”

Section: Relate Workmentioning

confidence: 99%

BW-PBFT: Practical byzantine fault tolerance consensus algorithm based on credit bidirectionally waning

Wang,

Liu,

Wang

et al. 2023

Peer-to-Peer Netw. Appl.

View full text Add to dashboard Cite

The consensus algorithm, as one of the cores of blockchain technology, plays a very critical role. As one of the mainstream consensus methods, PBFT has the advantages such as low energy consumption and large throughput. However, the traditional PBFT algorithm also has disadvantages, such as high network bandwidth occupation, for PBFT needs broadcasting information for all nodes in stage 3 and 4; limited expandability. With the increase of nodes, the bandwidth overhead of the blockchain network will increase significantly, which leads to a decrease in throughput, so that cause a crash of the blockchain network. We proposed an improved PBFT consensus based on a credit value bidirectionally waning, named BW-PBFT. The algorithm first elects some nodes to form a committee according to the ballot and the credit value, and then the committee nodes use the PBFT algorithm for consensus, and calculate the credit value of the nodes according to the performance in the consensus process. If nodes do not get punishment anymore, their credit value will approach 50 with the increase of the blockchain height. Theoretical analysis and experiments prove that the proposed algorithm can effectively improve the quality of the nodes involved in the consensus.

show abstract

A node selection algorithm with a genetic method based on PBFT in consortium blockchains

Cited by 10 publications

References 44 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

Improving byzantine fault tolerance based on stake evaluation and consistent hashing

BW-PBFT: Practical byzantine fault tolerance consensus algorithm based on credit bidirectionally waning

Contact Info

Product

Resources

About