Search

As blockchain technology plays an increasingly important role in the Internet of Vehicles, how to further enhance the data consensus between the areas of the Internet of Vehicles has become a key issue in blockchain design. The traditional blockchain-based vehicle networking consensus mechanism adopts the double-layer PBFT architecture, through the grouping of nodes for first intra-group consensus, and then global consensus. To further reduce delay, we propose a CRMWSL-PBFT algorithm (C-PBFT) for vehicle networking. Firstly, in order to ensure the security of RSU nodes in the network of vehicles and reduce the probability of malicious nodes participating in the consensus, we propose to calculate the reputation of RSU nodes based on multi-weighted subjective logic (CRMWSL) model. Secondly, in order to ensure the efficiency of blockchain data consensus, we improve the consensus protocol of traditional double-layer PBFT, change the election method of the committee and the PBFT consensus process, and improve throughput by reducing the number of consensus nodes. For the committee, we combine the credibility value and hash method to ensure the credibility of nodes, but also to ensure a certain degree of election randomness. For the PBFT consensus process, the regional committee consensus is carried out first, and then the regional master node carries out the global consensus. Through experimental comparison, we show that the C-PBFT significantly reduces consensus time, network overhead, and is scalable for Internet of Vehicles. [ABSTRACT FROM AUTHOR]

Currently, blockchain technology is not only gaining momentum in the financial industry but also showing promising developments in other sectors. Due to its suitability for various societal needs, an increasing number of non-financial institutions are expanding the scope of blockchain services beyond finance to areas such as healthcare service management and enterprise governance. The core of a blockchain system lies in consensus, which plays a crucial role in its performance and security. The PBFT algorithm is a widely used fault-tolerant consensus algorithm. However, it suffers from issues like high consensus latency, low throughput, and poor performance. In recent years, the HBFT algorithm has addressed these concerns. This paper proposes an improved HBFT blockchain consensus algorithm tailored for large enterprises and non-financial institutions with multiple independent functions. The goal is to achieve more efficient data management and election strategies that are both more secure than PBFT and more efficient than HBFT. Leveraging the enhanced HBFT consensus algorithm ensures stability and efficiency in the consensus and verification processes between organizations. Additionally, it enables the efficient management of data and value creation in the application context. [ABSTRACT FROM AUTHOR]

Blockchain technology is well known due to the advent of Bitcoin. With the development of recent years, blockchain technology has been widely used in medicine, digital currency, energy, etc. The practical Byzantine fault-tolerant (PBFT) algorithm is a consensus algorithm widely used in consortium blockchains. Aiming to address the problems of the PBFT algorithm, low consensus efficiency due to high communication complexity, and malicious behavior of the primary node leading to consensus failure, an improved PBFT algorithm based on a comprehensive evaluation model (TB-PBFT) is proposed. First, nodes are divided into several groups based on the multi-formation control strategy of an unmanned aerial vehicle (UAV) cluster, which significantly reduces the communication complexity. Second, a comprehensive evaluation model combining the entropy method, TOPSIS method, and Borda count is proposed, which uses the behavior of nodes as an evaluation index, and the comprehensive score of nodes is obtained according to the preferences of other nodes. Finally, the highest ranking node is selected as the primary node through the comprehensive evaluation model to ensure the security and stability of the blockchain network. We analyze TB-PBFT algorithms and compare them with other Byzantine fault tolerance algorithms. Theoretical analysis and simulation results show that the TB-PBFT algorithm can improve node scalability and fault tolerance and reduce communication complexity and view switching probability. We also prove that the comprehensive evaluation model can improve the consensus success rate of the algorithm, and the feasibility and effectiveness of the improved consensus algorithm are verified. Hence, it can be applied to the consortium blockchain system effectively and efficiently. [ABSTRACT FROM AUTHOR]

In order to solve the problem that data of the industrial Internet of Things (IIoT) is easily tampered with and therefore, the authenticity of data may be questioned, a data-privacy security mechanism of the IIoT based on blockchain is proposed. At the same time, to solve the problem of master node selection and low efficiency in the practical Byzantine fault tolerance (PBFT) algorithm, a reward mechanism based on node behavior is introduced and an improved PBFT algorithm is proposed. The improved PBFT algorithm is more efficient, in line with the application scenarios of the IIoT. Comparative analysis results showed that the proposed blockchain-based data-privacy security mechanism of the IIoT is superior to other models in terms of consensus efficiency, throughput, and block generation speed. [ABSTRACT FROM AUTHOR]

The conventional architecture of vehicular ad hoc networks (VANETs) with a centralized approach has difficulty overcoming the increasing complexity of intelligent transportation system (ITS) applications as well as challenges in providing large amounts of data storage, trust management, and information security. Therefore, vehicular edge computing networks (VECNets) have emerged to provide massive storage resources with powerful computing on network edges. However, a centralized server in VECNets is insufficient due to potential data leakage and security risks as it can still allow a single point of failure (SPoF). We propose consortium blockchain and smart contracts to ensure a trustworthy environment for secure data storage and sharing in the system to address these challenges. Practical byzantine fault tolerance (PBFT) is utilized because it is suitable for consortium blockchain to audit publicly, store data sharing, and records the whole consensus process. It can defend against system failures with or without symptoms to reach an agreement among consensus participants. Furthermore, we use an incentive mechanism to motivate the vehicle to contribute and honestly share their data. The simulation results satisfy the proposed model's design goals by increasing vehicular networks' performance in general. [ABSTRACT FROM AUTHOR]

Among various consensus algorithms, the Byzantine Fault Tolerance (BFT)-based consensus algorithms are broadly used for private blockchain. However, as BFT-based consensus algorithms are structured for all participants to take part in a consensus process, a scalability issue becomes more noticeable. In this approach, we introduce a consensus coordinator to execute a conditionally BFT-based consensus algorithm by classifying transactions. Transactions are divided into equal and unequal transactions. Moreover, unequal transactions are divided again and classified as common and trouble transactions. After that, a consensus algorithm is only executed for trouble transactions, and BFT-based consensus algorithms can achieve scalability. For evaluating our approach, we carried out three experiments in response to three research questions. By applying our approach to PBFT, we obtained 4.75 times better performance than using only PBFT. In the other experiment, we applied our approach to IBFT of Hyperledger Besu, and our result shows a 61.81% performance improvement. In all experiments depending on the change of the number of blockchain nodes, we obtained the better performance than original BFT-based consensus algorithms; thus, we can conclude that our approach improved the scalability of original BFT-based consensus algorithms. We also showed a correlation between performance and trouble transactions associated with transaction issue intervals and the number of blockchain nodes. [ABSTRACT FROM AUTHOR]