An Improved Blockchain Consensus Mechanism Based on Open Business Environment

Because of its excellent properties of fault tolerance, efficiency and availability, the practical Byzantine fault tolerance (PBFT) algorithm has become the mainstream consensus algorithm in blockchain. However, current PBFT algorithms have problems such as inadequate security of primary node selection, high communication overhead and network delay in the process of consensus. To address these problems, we design a novel efficient Byzantine fault tolerance algorithm based on credit grouping, called CG-PBFT. First, we propose a new credit evaluation model to obtain nodes’ credit values and introduce an optimized three-way quick sorting algorithm to divide nodes into the master-node group, the consensus-node group and the observation-node group, which have different privileges. The nodes in the observation-node group are restricted from participating in consensus, which reduces the communication overhead and improves consensus efficiency. Second, we propose an optimized selection method for the primary node based on a voting mechanism whereby the consensus-node group and observation-node group vote to produce the primary node, which reduces the probability of malicious nodes acting as the primary node and improves the security of primary node selection. Finally, the identity conversion mechanism between node groups is designed, and the actual behavior of nodes within different groups is given credit rewards or punishment, so as to keep an incentive for nodes to participate in appropriate system behavior and improve the working enthusiasm of nodes. The experimental simulation results show that compared with existing PBFT algorithms, the CG-PBFT algorithm improves the average throughput by 51.3% and reduces the average delay by 64.5%; it greatly improves the operating efficiency of the system and can be more suitable for application in the consortium blockchain scenarios.

DTPBFT:A dynamic and highly trusted blockchain consensus algorithm for UAV swarm

Aiming at the challenges of low throughput, excessive consensus latency and high communication complexity in the Practical Byzantine Fault Tolerance (PBFT) algorithm in blockchain networks, its application in identity verification for distributed networking of a drone cluster is limited. Therefore, a lightweight blockchain-based identity authentication model for UAV swarms is designed, and a Credit-score and Grouping-mechanism Practical Byzantine Fault Tolerance (CG-PBFT) algorithm is proposed. CG-PBFT introduces a reputation score evaluation mechanism, classifies the reputation levels of nodes in the network, and optimizes the consensus process based on grouping consensus and BLS aggregate signature technology. Experimental results demonstrate that under identical experimental conditions, compared with the PBFT algorithm, CG-PBFT achieves a 250% increase in average throughput, a 70% reduction in average latency, and simultaneous enhancement in security, thus making it more suitable for UAV swarm networks.

Purpose Problems such as data security and trustworthy interactivity bring new challenges to the development and application of service ecosystems. As a decentralized ledger, blockchain has characteristics such as non-tamperability, unforgeability, traceability, global consistency, so that the integration between blockchain and service ecosystems can ensure data integrity and service availability. The purpose of this paper is to investigate problems of efficient consensus algorithm in service ecosystems alliance chain scenarios. Design/methodology/approach This method consists of two core modules: bubble sort and reputation mechanism. The bubble sort algorithm can reduce the number of consensus nodes, thereby reducing communication overhead and improving throughput. The reputation mechanism can improve the correctness of consensus nodes, thereby solving the problem of random selection of the primary in the PBFT algorithm and improving its security and efficiency. Findings Comparative experiments and analysis have been conducted between the practical Byzantine fault-tolerant algorithm combined with bubble sort and reputation mechanism (BR-PBFT) scheme proposed in this paper and existing similar PBFT algorithms in terms of communication complexity, transaction confirmation delay and throughput. The experimental results demonstrate that BR-PBFT maintains 1/3 fault tolerance of PBFT, effectively reduces communication overhead, lowers transaction confirmation delay and improves throughput. Originality/value The practical Byzantine fault tolerance (PBFT) algorithm used in the alliance chain still has the problems of high communication complexity and low throughput. Aiming at application scenarios of alliance chains in service ecosystems, an improved is proposed. It provides valuable insights into future research and practical applications in service ecosystems.

The Practical Byzantine Fault Tolerance algorithm (PBFT)has been highly applied in consortium blockchain systems, however, this kind of consensus algorithm can hardly identify and remove faulty nodes in time, and also vulnerable to many attacks against the primary node of PBFT. The equality of consortium members' discourse rights is inapplicable to some real scenarios where dominating members are likely to have a larger discourse rights in the voting process. To address these problems, this paper presents Reputation-based Byzantine Fault Tolerance (RBFT)algorithm that incorporates a reputation model to evaluate the operations of each node in the consensus process. The faulty nodes will get lower discourse rights in the voting process if any malicious behavior is detected, with their reputation decreased. Furthermore, this paper presents an innovative reputation-based primary change scheme. The node with higher reputation obtains greater opportunities to be a primary to generate new valid blocks, which reduces the security risk of the primary. The experimental results demonstrate that RBFT gains better performance and ensures system security and reliability. Compared with PBFT, it increases the average throughput by 15% and reduces delay by 10%, and the faulty node rate of the system can continue to decrease over time.

Focused on the problem of master node selection and communication overhead in the Practical Byzantine Fault Tolerance (PBFT) consensus algorithm which applied to the consortium blockchain, this paper proposes an Egalitarian Practical Byzantine Fault Tolerance (ePBFT) consensus algorithm based on the PBFT algorithm. First, the concept of the primary node is diluted, so that each node in the chain is equal and efficient. Secondly, the consensus process is optimized to improve the efficiency of the consensus, the communication overhead is reduced to half of the PBFT in the case of less view changes. The experimental results show that the ePBFT algorithm and the PBFT algorithm are compared in the same environment, and the throughput is improved when the communication overhead and delay are reduced.

With the development of Intelligent Transportation Systems (ITS) and 5G communication technology, Vehicular Ad-Hoc Networks (VANETs) are playing an increasingly important role in enhancing road safety, improving traffic efficiency and providing online entertainment experience [1]. However, the information insecurity brought by the traditional centralized mode of VANETs is still a very challenging problem. To solve this problem, a 5G-enabled hierarchical network in VANETs is proposed through the research of blockchain and 5G technology. On this basis, a data sharing scheme based on Practical Byzantine Fault Tolerance (PBFT) algorithm is proposed, which realizes data storage and transmission effectively with its characteristics of data immutability and decentralization. The ideal expected result is that the scheme realizes data storage effectively and the security of data transmission and ensures the reliable transmission of data with lower computing time.

The consensus algorithm is very critical in any blockchain system, because it directly affects the performance and security of the blockchain system. At present, the classic Practical Byzantine Fault Tolerance Algorithm (PBFT), which is mainly used in the consortium chain, will lead to system communication congestion and reduced throughput when the number of nodes increases, so the PBFT algorithm is not suitable for large-scale consortium chains. In response to the above problems, this paper proposes a new clustering-based sharding consensus algorithm (KBFT), which aims to ensure that the consortium chain takes into account decentralization, security and scalability. The KBFT algorithm first uses the K-prototype clustering algorithm to shard the nodes in the network according to mixed attributes, and second, disjoint transactions are used to reach consensus in parallel in different shards. Concurrently, the KBFT algorithm introduces a supervision mechanism and a node credit mechanism, which is used to supervise and score the behavior of the nodes and select the proxy nodes, which improves security. We discuss the choice of shard size with the help of the binomial probability distribution and analyze the probability that the system can successfully form a global block under different node failure probabilities. Finally, the proposed algorithm is evaluated through theoretical analysis and simulation experiments. Results show that the proposed algorithm achieves a marked improvement in scalability and throughput along with a marked reduction in communication complexity compared with the classic baseline algorithm PBFT in this field of study, which improves the operating efficiency of the system and simultaneously guarantees the security and robustness of the system.

Aiming at the problems of low consensus efficiency and low scalability in traditional Byzantine consensus algorithm, propose a Practical Byzantine Algorithm Based on Node Reputation Value Matching TMBFT (Trust-based on Node Reputation Value Matching). Select some consensus nodes for consensus voting according to the neighbor matching model. At the same time, a reputation value evaluation mechanism is introduced to supervise the consensus behavior of neighbor nodes. To sum up, compared with the traditional practical Byzantine fault-tolerant algorithm, the consensus algorithm based on node reputation value matching improves the consensus efficiency of the system, reduces the node overhead in the network, and enhances the stability and security of the system.

A significant progress in modern power grids is witnessed by the tendency of becoming complex cyber‐physical systems. As a fundamental physical infrastructure, smart meter in the demand side provides real‐time energy consumption information to the utility. However, ensuring information security and privacy in the meter data aggregation process is a non‐trivial task. This study proposes a distributed, privacy‐preserving, and secure meter data aggregation framework, backed up by Blockchain and homomorphic encryption (HE) technologies. Meter data are aggregated and verified by a hierarchical Blockchain system, in which the consensus mechanism is supported by the practical Byzantine fault tolerance algorithm. On the top of the Blockchain system, HE technology is used to protect the privacy of individual meter data items during the aggregation process. Performance analysis is conducted to validate the proposed method.

Blockchain technology, renowned for its decentralized, immutable, and transparent features, offers a reliable framework for trust in distributed systems. The growing popularity of consortium blockchains, which include public, private, hybrid, and consortium chains, stems from their balance of privacy and collaboration. A significant challenge in these systems is the scalability of consensus mechanisms, particularly when employing the Practical Byzantine Fault Tolerance (PBFT) algorithm. This review focuses on enhancing PBFT's scalability, a critical factor in the effectiveness of consortium chains. Innovations such as Boneh–Lynn–Shacham (BLS) signatures and Verifiable Random Functions (VRF) are highlighted for their ability to reduce algorithmic complexity and increase transaction throughput. The discussion extends to real-world applications, particularly in platforms like Hyperledger Fabric, showcasing the practical benefits of these advancements. This paper provides a concise overview of the latest methodologies that enhance the performance scalability of PBFT-based consortium chains, serving as a valuable resource for researchers and practitioners aiming to optimize these systems for high-performance demands.

Vehicular networks are constructed for efficient and secure data flow to make intelligent transportation system. It works by using central storage system which is inefficient as large amount of data is difficult to handle and also becomes the target of malicious activity. The flow of sensitive data on wireless channels for communication of vehicles with other nodes can also be chosen by attackers for attack. These challenges are tackled using blockchain solutions. The blockchain, a farfetched decentralized technology which is undoubtedly going to change overall trends of entire business and professional networking environment in the world to release the burden of centralization on the organizations even on the individuals and several developed countries have started to adopt this trend. This technology would be as dynamic, vibrant, efficient and secure as the category of consensus algorithms is used for the agreement and decision of joining the new block among network nodes. Security and efficiency of vehicular network is maintained through consortium blockchain boasting with Practical Byzantine Fault tolerance (PBFT) algorithm.

Blockchain is a new technology for processing complex and disordered information with respect to business and other industrial applications. This work is aimed at studying the consensus algorithm of blockchain to improve the performance of blockchain. Despite their advantages, the proof of stake (POS) algorithm and the practical Byzantine fault tolerance (PBFT) algorithm have high latency, low throughput, and poor scalability. In this paper, a blockchain hybrid consensus algorithm which combines advantages of the POS and PBFT algorithms is proposed, and the algorithm is divided into two stages: sortition and witness. The proposed algorithm reduces the number of consensus nodes to a constant value by verifiable pseudorandom sortition and performs transaction witness between nodes. The algorithm is improved and optimized from three dimensions: throughput, latency, and scalability. The experimental results show that the improved hybrid consensus algorithm is significantly superior to the previous single algorithms for its excellent scalability, high throughput, and low latency.

Traditional intellectual property authentication relies on centralized intermediaries, which makes it difficult to address issues such as forgery, lack of trust, and opaque information. Combined with the characteristics of blockchain, such as decentralization, tampering, and traceability, these challenges can be effectively dealt with. Aiming at the shortcomings of traditional consensus algorithms in intellectual property authentication, such as high communication overhead and low efficiency, the improved PBFT (Practical Byzantine Fault Tolerance) algorithm (MBFT algorithm) is proposed and combined with the distributed database IPFS (Inter Planetary File System) to alleviate the pressure of blockchain data storage and enhance operational efficiency. The algorithm first adopts the evaluation system in the hierarchical mechanism, invokes the Fibonacci series incremental law to update the Score value of the nodes and sort them, and divides the nodes into the classification consensus layer, the consensus confirmation layer, and the supervision layer. Secondly, the Maglev algorithm is used to generate a lookup table and design a classification consensus strategy, which is divided into four consensus groups based on the characteristics of intellectual property categories, namely, the patent authentication consensus group, the trademark authentication consensus group, the copyright authentication consensus group, and the other types of authentication consensus group. Then, the algorithm optimizes the consistency protocol, carries out PBFT consensus once in each of the classification consensus layers and consensus confirmation layers, according to the consensus situation, and realizes the nodes’ dynamic update to ensure the consensus’s accuracy and reliability. The experiments show that the MBFT algorithm performs better in terms of communication complexity and throughput. As the number and size of files increase, the execution time of IPFS progressively lengthens. However, the overall performance still meets the actual demand. Compared with the traditional PBFT, MBFT improves the communication complexity by about 50% or more, the throughput is about 3 times the traditional PBFT, and the scalability and response speed of the system are significantly improved when the number of nodes increases.

Since Bitcoin's inception, the non-custodial financial and programmable aspects of blockchain technology have garnered significant global attention, akin to other groundbreaking innovations. Blockchain is a transparent and decentralized ledger that prioritizes immutability, transparency, decentralization, and privacy. Its potential extends to large-scale, beneficial applications across various sectors, encompassing healthcare, supply chain management, logistics, the Internet of Things (IoT), and more. Many industrial applications make use of permissioned blockchains. However, blockchain still faces inherent and external challenges. While permissioned blockchains are suitable for many use cases, they do have limitations, especially in terms of scalability and throughput. In this paper, the authors propose implementing the proposed method by Swathi and Venkatesan using tPBFT (trust Practical Byzantine Fault Tolerance) instead of PBFT (Practical Byzantine Fault Tolerance) to improve the scalability and performance of the blockchain. The Hyperledger Fabric framework is conducted for the proposed method within the assessment of scalability, considering varying transaction volumes, and it demonstrates an enhancement in scalability. This work addresses the need for blockchain systems to evolve and adapt to meet the demands of various industries and applications, acknowledging that scalability is a key factor in their success.