Aiming at the Byzantine fault-tolerant consensus algorithm when the number of nodes is too large, there are problems such as a large amount of data exchange, slow consensus speed, and security degradation caused by pr...
详细信息
ISBN:
(数字)9798350353174
ISBN:
(纸本)9798350353181
Aiming at the Byzantine fault-tolerant consensus algorithm when the number of nodes is too large, there are problems such as a large amount of data exchange, slow consensus speed, and security degradation caused by proxy nodes, based on threshold signatures, a new Byzantine fault-tolerant consensus algorithm based on local temporary consensus and global confirmation is proposed. Nodes divide into different zones based on their geographical location, the algorithm conducts temporary consensus among zones in parallel, and all nodes participate in global confirmation together, reducing the amount of network data exchange during the consensus process while improving consensus speed and security.
As an effective tool to ensure data security, blockchain has attracted extensive attention in medical data sharing. The core of blockchain is consensus algorithm, among them, proof of authority (PoA) is a consensus al...
详细信息
ISBN:
(数字)9798350368550
ISBN:
(纸本)9798350368567
As an effective tool to ensure data security, blockchain has attracted extensive attention in medical data sharing. The core of blockchain is consensus algorithm, among them, proof of authority (PoA) is a consensus algorithm widely used in Permissioned chain, which has the characteristics of high efficiency and strong scalability. However, it also has some problems such as unknown credibility of authoritative nodes and poor enthusiasm of nodes. So this paper proposed an improved dynamic scoring-based PoA algorithm (D-PoA). Firstly, the dynamic scoring mechanism is introduced to screen the authoritative nodes, so as to improve the credibility and enthusiasm of the authoritative nodes; Then the consistency process is optimized to improve the work efficiency of the system. Experiments show that D-PoA algorithm has some advantages over PoA algorithm in consensus reliability, transaction delay and throughput.
With the development of smart grid technology, the future power system will become a complex cyber-physical system. The control and management of this system will impose new challenges to the current Supervisory Contr...
详细信息
ISBN:
(纸本)9781479940318
With the development of smart grid technology, the future power system will become a complex cyber-physical system. The control and management of this system will impose new challenges to the current Supervisory Control and Data Acquisition system such as scalability in its computational and communications effort, and robustness to single point of failure. Decentralized cooperative control is promising to control and manage such a system in a more efficient and robust way. consensus based algorithms have been proposed by researchers to deal with various power system applications in a distributed manner. Because of the sensitivity to communications imperfections, the performance of the consensus based algorithms degrade when the communication packet loss happens in practical applications. In this paper, a Hybrid Incremental Cost consensus (Hybrid ICC) algorithm is proposed. Different from other consensus based algorithms, the Hybrid ICC algorithm is robust against communications imperfections by integrating gossip algorithm and consensus algorithm together. Several case studies are presented to illustrate the performance of the proposed Hybrid ICC algorithm and demonstrate the scalability and robustness under packet loss scenarios.
The consensus mechanism, as the foundation and core of blockchain technology, fundamentally determines the security, availability, etc. of the whole blockchain system. In this paper, an improved algorithm of PBFT base...
详细信息
The consensus mechanism, as the foundation and core of blockchain technology, fundamentally determines the security, availability, etc. of the whole blockchain system. In this paper, an improved algorithm of PBFT based on network partitioning is proposed. Firstly, the nodes are divided into network slices, and the Raft mechanism is used for consensus within each slice, while each slice elects leaders to form a committee, and the PBFT mechanism is used for consensus within the committee. Supervisory nodes and sorting nodes are also introduced to improve the security of the algorithm.
Consistency means that in a multi-structure agent network, each agent interacts and interacts with certain information according to certain control rules, and finally all agents in the network reach agreement on certa...
详细信息
ISBN:
(纸本)9781450397827
Consistency means that in a multi-structure agent network, each agent interacts and interacts with certain information according to certain control rules, and finally all agents in the network reach agreement on certain key information or states. In this paper, by analyzing the information network and weight of each subject unit under the mode of integration of industry and education, and researching and analyzing common distributed structures and mathematical models, on this basis, a path of industry-university integration based on consensus algorithm is established, and given The corresponding evaluation indicators are given, and a new way of thinking is provided for the research of relevant personnel.
This paper considers solving distributed optimization problems in peer-to-peer multi-agent networks. The network is synchronous and connected. By using the proportional-integral (PI) control strategy, various algorith...
详细信息
ISBN:
(数字)9798331517212
ISBN:
(纸本)9798331517229
This paper considers solving distributed optimization problems in peer-to-peer multi-agent networks. The network is synchronous and connected. By using the proportional-integral (PI) control strategy, various algorithms with fixed stepsize have been developed. Two notable among them are the PI algorithm and the PI consensus algorithm. Although the PI algorithm has provable linear or exponential convergence without the standard requirement of (strong) convexity, a similar guarantee for the PI consensus algorithm is unavailable. In this paper, using Lyapunov theory, we guarantee exponential convergence of the PI consensus algorithm for global cost functions that satisfy the restricted secant inequality, with rate-matching discretization, without requiring convexity. To accelerate the PI consensus algorithm, we incorporate local pre-conditioning in the form of constant positive definite matrices and numerically validate its efficiency compared to the prominent distributed convex optimization algorithms. Unlike classical pre-conditioning, where only the gradients are multiplied by a pre-conditioner, the proposed pre-conditioning modifies both the gradients and the consensus terms, thereby controlling the effect of the communication graph on the algorithm.
This paper considers solving distributed optimization problems in peer-to-peer multi-agent networks. The network is synchronous and connected. By using the proportional-integral (PI) control strategy, various algorith...
详细信息
RPCA consensus algorithm is not suitable for consortium chains, and the performance of the PBFT consensus algorithm decreases as the number of nodes increases, this paper proposes an RBFT consensus algorithm based on ...
详细信息
ISBN:
(数字)9798350356502
ISBN:
(纸本)9798350356519
RPCA consensus algorithm is not suitable for consortium chains, and the performance of the PBFT consensus algorithm decreases as the number of nodes increases, this paper proposes an RBFT consensus algorithm based on RPCA and PBFT. This algorithm proposes a credit score model based on a reward and punishment mechanism. According to the performance of node in the consensus dynamically updates the node credit score and uses it as the only basis for the node to be selected into UNL. PBFT is used in the UNL to enhance the reliability of the consensus. Experimental results confirm that RBFT effectively improves consensus efficiency and security based on RPCA and PBFT.
The consensus protocol is a critical component of distributed ledgers and blockchains. Achieving consensus over a decentralized network poses challenges to transaction finality and performance. Currently, the highest-...
详细信息
Practical Byzantine Fault Tolerance (PBFT) is an optional consensus protocol for consortium blockchains scenarios where strong consistency is required. However, it also inevitably incurs high energy consumption, low e...
详细信息
ISBN:
(数字)9781665403924
ISBN:
(纸本)9781665403931
Practical Byzantine Fault Tolerance (PBFT) is an optional consensus protocol for consortium blockchains scenarios where strong consistency is required. However, it also inevitably incurs high energy consumption, low efficiency and poor scalability. What is more, the reliability of the consensus node cannot be guaranteed by itself. For addressing these problems, this paper proposes practical byzantine consensus algorithm based on quantified-role (QPBFT), which can achieve the following advantages: (1) Improving the security and reliability of the blockchain. The reliability attributes of nodes are quantified based on analytic hierarchy process (AHP), those nodes with high reliability evaluation scores are more likely to participate in block production by introduction of the quantified-role, which can ensure the reliability of blockchain network; (2) Realizing high efficiency and low energy consumption. Voting mechanism is adopted to simplify and optimize the PBFT consensus process; (3) Implementing adaptation to dynamic network environments. Management nodes, voting nodes, candidate nodes, and ordinary nodes are dynamically adjusted according to node reliability evaluation score for optimizing consensus performance. The paper demonstrates the security feature including reliability and fault tolerance. Meanwhile, simulation experiments are conducted to validate the higher efficiency and less resource consumption of QPBFT compared with PBFT.
暂无评论