Explore the vast range of titles available.

Addressing the scalability issues, excessive communication overhead, and challenges in adapting to large‐scale network node environments faced by the Practical Byzantine Fault Tolerance (PBFT) consensus algorithm currently employed in consortium blockchains, this paper proposes a Double Layer Consensus Algorithm Based on RAFT and PBFT Consensus Algorithms (DLCA_R_P). The nodes in the blockchain are initially divided into several groups to form the lower‐layer consensus network. Subsequently, the leaders of these groups constitute the upper‐layer consensus network, creating a dual‐layer consensus network structure. Within the lower‐layer consensus network, the PBFT consensus algorithm is employed for consensus among the groups, while the primary accountants form the upper‐layer RAFT consensus network. The algorithm incorporates a supervision mechanism and a reputation mechanism to enhance the security of the consensus network. Additionally, a grouping mechanism is introduced to transform the consensus network into a dynamic structure. Experimental results analysis demonstrates that compared to traditional PBFT consensus algorithms, DLCA_R_P reduces consensus latency by two orders of magnitude and improves throughput by one order of magnitude in a scenario with 100 nodes. Furthermore, it exhibits significant advantages over other improved algorithms. Thus, the DLCA_R_P consensus algorithm exhibits excellent scalability and can be widely applied in various scenarios within consortium blockchains. A double‐layer consensus algorithm based on improved RAFT and PBFT, with low time complexity and the ability to resist Byzantine nodes.

Asynchronously compensated consensus algorithm is proposed to solve the dynamical consensus problem of discrete-time second-order multi-agent systems with communication delay. By analysing the consensus convergence of two coupled agents according to frequency-domain analysis, the authors come to the conclusion that the asynchronously compensated algorithm can endure larger communication delay than the synchronously coupled consensus algorithm. In addition, sufficient conditions are gained for multiple discrete-time second-order agents with communication delay under leaderless and leader-following consensus algorithms, respectively. Numerical examples illustrate the correctness of the results.

Archives are an important part of information resources, a witness and record of history, and a reference basis for decision-making on future development. The article applies data mining technology to college archive information service, and conducts research on the upgrading of college archive management informationization. After the modular construction of university archive management information system, the blockchain-based digital archive traceability sharing scheme is proposed to realize the encryption processing of archive information. And the calculation formula of information gain rate in C4.5 algorithm is approximated and simplified to optimize the cumbersome calculation process of attribute selection in the tree building process. The C4.5 algorithm is applied to the university archive information service system to categorize the archive information. Applying the C4.5 algorithm to college records management, the degree of influence of each customer’s information on the frequency of visits is “identity”, “age”, “specialty”, “Gender”, and customers can be categorized into frequent and infrequent customers. In the transaction throughput analysis experiment of PAPBFT consensus algorithm, it is found that the throughput of traditional PBFT consensus algorithm gradually decreases with the increase of the number of nodes, and the consensus algorithm in this paper increases the throughput with the increase of the number of nodes N, which effectively mitigates the problem of the obvious decrease in throughput caused by the increasing number of nodes. This paper efficiently and safely realizes the upgrading of university archive management informationization.

Recent research has focused on applying blockchain technology to solve security-related problems in Internet of Things (IoT) networks. However, the inherent scalability issues of blockchain technology become apparent in the presence of a vast number of IoT devices and the substantial data generated by these networks. Therefore, in this paper, we use a lightweight consensus algorithm to cater to these problems. We propose a scalable blockchain-based framework for managing IoT data, catering to a large number of devices. This framework utilizes the Delegated Proof of Stake (DPoS) consensus algorithm to ensure enhanced performance and efficiency in resource-constrained IoT networks. DPoS being a lightweight consensus algorithm leverages a selected number of elected delegates to validate and confirm transactions, thus mitigating the performance and efficiency degradation in the blockchain-based IoT networks. In this paper, we implemented an Interplanetary File System (IPFS) for distributed storage, and Docker to evaluate the network performance in terms of throughput, latency, and resource utilization. We divided our analysis into four parts: Latency, throughput, resource utilization, and file upload time and speed in distributed storage evaluation. Our empirical findings demonstrate that our framework exhibits low latency, measuring less than 0.976 ms. The proposed technique outperforms Proof of Stake (PoS), representing a state-of-the-art consensus technique. We also demonstrate that the proposed approach is useful in IoT applications where low latency or resource efficiency is required.

The Energy Internet paradigm is the evolution of the Internet of Things concept in the power system. Microgrids (MGs), as the essential element in an Energy Internet, are expected to be controlled in a corporative and flexible manner. This paper proposes a novel decentralized robust control strategy for multi-agent systems (MASs) governed MGs in future Energy Internet. The proposed controller is based on a consensus algorithm applied with the connected distributed generators (DGs) in the MGs in the energy internet paradigm. The proposed controller’s objectives are the frequency/voltage regulation and proportional reactive/active power-sharing for the hybrid DGs connected MGs. A proposed two-level communication system is implemented to explain the data exchange between the MG system and the cloud server. The local communication level utilizes the transmission control protocol (TCP)/ internet protocol (IP) and the message queuing telemetry transport (MQTT) is used as the protocol for the global communication level. The proposed control strategy has been verified using a hypothetical hybrid DGs connected MG such as photovoltaic or wind turbines in MATLAB Simulink environment. Several scenarios based on the system load types are implemented using residential buildings and small commercial outlets. The simulation results have verified the feasibility and effectiveness of the introduced strategy for the MGs’ various operating conditions.

Practical Byzantine Fault-tolerant Algorithm (PBFT) is the most widely used consensus algorithm in alliance chain, which has the advantages of fault tolerance and large throughput. However, PBFT also has some problems that can’t be ignored in specific blockchain applications, such as bad behavior of master node, high network communication overhead and low system flexibility. In this paper, the improvement measures of PBFT consensus algorithm are summarized from many aspects, and then compared with traditional PBFT algorithm. Finally, the development direction and trend of PBFT algorithm are prospected, hoping to provide reference for the research and innovation of PBFT consensus algorithm in the future.

In 2008, Blockchain was introduced to the world as the underlying technology of the Bitcoin system. After more than a decade of development, various Blockchain systems have been proposed by both academia and industry. This paper focuses on the consensus algorithm, which is one of the core technologies of Blockchain. In this paper, we propose a unified consensus algorithm process model that is suitable for Blockchains based on both the chain and directed acyclic graph (DAG) structure. Subsequently, we analyze various mainstream Blockchain consensus algorithms and classify them according to their design in different phases of the process model. Additionally, we present an evaluation framework of Blockchain consensus algorithms and then discuss the security design principles that enable resistance from different attacks. Finally, we provide some suggestions for selecting consensus algorithms in different Blockchain application scenarios.

Blockchain technology can solve the problem of trust in the open network in a decentralized way. It has broad application prospects and has attracted extensive attention from academia and industry. The blockchain consensus algorithm ensures that the nodes in the chain reach consensus in the complex network environment, and the node status ultimately remains the same. The consensus algorithm is one of the core technologies of blockchain and plays a pivotal role in the research of blockchain technology. This article gives the basic concepts of the blockchain, summarizes the key technologies of the blockchain, especially focuses on the research of the blockchain consensus algorithm, expounds the general principles of the consensus process, and classifies the mainstream consensus algorithms. Then, focusing on the improvement of consensus algorithm performance, it reviews the research progress of consensus algorithms in detail, analyzes and compares the characteristics, suitable scenarios, and possible shortcomings of different consensus algorithms, and based on this, studies the future development trend of consensus algorithms for reference.

According to different application scenarios of blockchain system, it is generally divided into public chain, private chain and consortium chain. Consortium chain is a typical multi-center blockchain, because it has better landing, it is supported by more and more enterprises and governments. This paper analyzes the advantages and problems of Practical Byzantine Fault Tolerance (PBFT) algorithm for the application scenarios of the consortium chain. In order to be more suitable for consortium chains, this paper proposes a new optimized consensus algorithm based on PBFT. Aiming at the shortcomings of PBFT, such as the inability to dynamically join nodes, low multi-node consensus efficiency, and primary master node selection, our optimized algorithm has designed a hierarchical structure to increase scalability and improve consensus efficiency. The simulation results show that compared with PBFT and RAFT, our new consensus algorithm increases the data throughput while supporting more nodes, and effectively reducing the consensus delay and the number of communication times between nodes.

Virtual power plant (VPP) composed of a large number of distributed energy resources (DERs) has become a regional multienergy aggregation model to realize the large-scale integration of renewable energy generation into the grid. Due to the characteristics of centralized management, the existing energy operation mode is difficult to simply apply to distributed energy resources transactions. The decentralization, transparency, contract execution automation and traceability of blockchain technology provide a new solution to the aggregation of decentralized resources and the opacity of transactions in VPP. In this paper, the existing problems of virtual power plants are analyzed, and the virtual power plant trading model is designed, which realizes the transparent benefit distribution and message transmission of virtual power plants. The virtual power plant blockchain network based on blockchain technology in this model solves the DERs coordination problem in VPP and the security and efficiency problems in information transmission. Combined with the actual situation of virtual power plant, the blockchain network collaboration mechanism (BNCM), which is convenient to reach agreement, is designed. Compared with the traditional practical Byzantine fault tolerance (PBFT) consensus algorithm, this mechanism can make DERs reach a consensus quickly. Finally, simulation experiments on the consensus algorithm show that the algorithm can reduce the collaboration time between DERs under the premise of ensuring the same fault tolerance rate and is more suitable for VPP scenarios with a large number of DERs.