R-PBFT: A secure and intelligent consensus algorithm for Internet of vehicles

Kumar, Amritesh; Vishwakarma, Lokendra; Das, Debasis

doi:10.1016/j.vehcom.2023.100609

Cited by 9 publications

(3 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The approach employs sophisticated decision attitudes to select the highest-scoring nodes, thereby effectively improving the efficiency of achieving consensus. Reference 35 addresses the limitations of delay, transaction frequency restrictions, and severe block congestion in the vehicular ad-hoc network consensus process. It introduces a fast and intelligent consensus mechanism called R-PBFT.…”

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

“…Ref. [9] employs a reputation mechanism calculated through logistic regression to enhance the PBFT consensus process, In addition, it proposes R-PBFT (Reputed PBFT), a fast and intelligent consensus mechanism algorithm. It does not take into account the impact of a large number of mobile nodes in the network on consensus efficiency.…”

Section: Related Workmentioning

confidence: 99%

An Efficient and Secure Blockchain Consensus Protocol for Internet of Vehicles

Si,

Li,

Yao

et al. 2023

Electronics

View full text Add to dashboard Cite

Conventional blockchain consensus protocols tailored for the Internet of Vehicles (IoV) usually face low transaction throughput, high latency, and elevated communication overhead issues. To address these issues, in this paper, we propose ESBCP, an efficient and secure blockchain consensus protocol for the IoV environment. Firstly, considering the significant performance differences among nodes in the IoV, we designed a blockchain consensus model for the IoV. Roadside units execute a trust evaluation mechanism to select high-quality vehicle nodes for the consensus process, thereby reducing the likelihood of malicious nodes in the consensus cluster. Secondly, we designed a node partition strategy to adapt to the dynamic feature of the IoV. Finally, addressing the mobility of nodes in the IoV, we introduced a dynamic unique node list. Vehicle nodes can promptly select nodes with high reliability from the list of communicable nodes to join their unique node list, while also promptly removing nodes with low reliability from their unique node list. Combining these strategies, we propose DK-PBFT, an improved Practical Byzantine Fault Tolerance consensus algorithm. The algorithm meets the efficiency and mobility requirements of vehicular networks. Through theoretical analysis, ESBCP could prevent external and internal security risks while reducing communication overhead. Experimental verification demonstrated that ESBCP effectively reduces consensus latency and improves transaction throughput. Our proposed ESBCP can be used in other application scenarios that require high consensus efficiency.

show abstract

“…Existing mainstream consensus mechanisms, notably the Practical Byzantine Fault Tolerance (PBFT) consensus algorithm [25][26][27], face performance bottlenecks in intellectual property transaction scenarios, such as communication complexity, consensus efficiency, and random selection of primary nodes [28][29][30], which pose limitations. Aiming at these problems of PBFT, this paper proposes a PBFT optimization scheme based on the AP clustering algorithm [31], addressing issues within the consensus mechanism of intellectual property-centric transactions.…”

Section: Introductionmentioning

confidence: 99%

Improvement of PBFT Consensus Algorithm Based on Affinity Propagation Clustering in Intellectual Property Transaction Scenarios

Du,

Feng,

Huang

et al. 2024

Electronics

View full text Add to dashboard Cite

In response to the problems of random selection of primary nodes, high communication complexity, and low consensus efficiency in the current consensus mechanism for intellectual property transactions, a Practical Byzantine Fault Tolerance (PBFT) consensus algorithm based on the Affinity-Propagation (AP) clustering algorithm, termed AP-PBFT, is proposed. Firstly, the election strategy of the leader node is constructed based on the reputation mechanism; the reward and punishment mechanism is designed to achieve the dynamic adjustment of the reputation value of the nodes in the PBFT consensus process, and the number of votes among the nodes is introduced to determine the node’s reputation value in collaboration with the reward and punishment mechanism to guarantee the precise ordering of the nodes. Secondly, nodes with high reputation values are selected as cluster centers to run the AP clustering algorithm, and clustering groups of knowledge property transaction nodes are constructed based on responsibility and availability. Finally, the three-stage consensus process of the PBFT consensus algorithm is optimized, and the consensus task is decomposed into two layers: the intra-consensus group and the inter-leader node group, reducing the communication complexity of transaction data in the blockchain. Experimental findings indicate a significant performance improvement of the algorithm over the PBFT consensus algorithm in communication complexity, throughput, and consensus efficiency in the simulation environment of multiple types of transactions in intellectual property transactions, including different types of large-scale transaction scenarios, such as purchases, sales, licenses, and transfers.

show abstract

R-PBFT: A secure and intelligent consensus algorithm for Internet of vehicles

Cited by 9 publications

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

An Efficient and Secure Blockchain Consensus Protocol for Internet of Vehicles

Improvement of PBFT Consensus Algorithm Based on Affinity Propagation Clustering in Intellectual Property Transaction Scenarios

Contact Info

Product

Resources

About