The efficiency of the existing PBFT consensus algorithm in the alliance chain will become very low after the network nodes reach a certain scale, and the number of nodes in the network is fixed and lack of dynamics. B...
详细信息
In this article, we study the consensus issues of multiagent systems (MASs) without any information of the system model by using the reinforcement learning (RL) method and event-based control strategy. First, we desig...
详细信息
In this article, we study the consensus issues of multiagent systems (MASs) without any information of the system model by using the reinforcement learning (RL) method and event-based control strategy. First, we design an adaptive event-based consensus control protocol using the local sampled state information so that the consensus errors of all agents are uniformly ultimately bounded. The validity of the above event-triggered adaptive control protocol is confirmed by excluding the Zeno behavior within finite time. Then, based on the RL approach, we present a model-free algorithm to get the feedback gain matrix, and accomplish constructing the adaptive event-triggered control strategy without the knowledge of model information. Distinct with the existing related works, this RL-based event-triggered adaptive control algorithm only relies on the local sampled state information, irrelevant to any model information or global network information. Finally, we provide some examples to demonstrate the validity of the above adaptive event-based consensus algorithm.
A privacy-preserving average consensus algorithm is designed based on the Beaver triple technique against passive adversaries. The Beaver triple technique is integrated into a restructure of the discrete-time average ...
详细信息
The Practical Byzantine Fault Tolerant (PBFT) consensus algorithm has many advantages, which makes PBFT utilized widely. Nonetheless, PBFT is not suitable for large-scale node scenarios due to its high communication c...
详细信息
The Practical Byzantine Fault Tolerant (PBFT) consensus algorithm has many advantages, which makes PBFT utilized widely. Nonetheless, PBFT is not suitable for large-scale node scenarios due to its high communication complexity and it also has an apparent disadvantage of inadequate fault tolerance. The typically derived PBFT algorithms focus on reducing communication complexity at the cost of diminished system security or fault tolerance. In this paper, Dual-Primary-Node derived Practical Byzantine Fault Tolerance (DPNPBFT) is proposed to achieve the best balance of the above three performances. First, DPNPBFT selects dual master nodes based on the idea of power separation. The two master nodes check balance and supervise each other to avoid excessive centralization as a single master node system. It also reduces the communication complexity of the replica node, which only communicates with the master node. Furthermore, we designed the architecture of DPNPBFT to get a practical 49% fault tolerance rate, and it is close to the current mainstream Proof of Work and Proof of Stake algorithms. Experimental results demonstrate that DPNPBFT has O(N) level communication complexity and excellent anti-host node malicious performance. The Transactions Per Second of DPNPBFT is stable at 1700. It proves DPNPBFT has the best performance balance and excellent comprehensive performance for large-scale Internet of Things application scenarios.
Blockchain is an innovative application of distributed storage, consensus algorithm, encryption algorithm, and other computer technologies. The consensus algorithm is the key to keep consistent among blockchain nodes....
详细信息
Blockchain is an innovative application of distributed storage, consensus algorithm, encryption algorithm, and other computer technologies. The consensus algorithm is the key to keep consistent among blockchain nodes. In most existing consensus algorithms, the leader node is responsible for proposing new block and communicating with other nodes. The leader node is easy to be the target of malicious attackers. With the increase of the number of nodes, the throughput and scalability of the blockchain system are also unsatisfactory. To address such issues, we propose the AnonymousFox consensus algorithm, which is suitable for the consortium blockchain and private blockchain. First, we design an anonymous leader node sorting algorithm, which hides the identity of the leader node through a variety of encryption algorithms. It periodically changes the ordered leader list to hide the target of malicious attackers. In addition, we design a consensus algorithm based on the anonymous identity of the leader node. Through one-to-many message communication, the amount of messages is greatly reduced. The complexity of the algorithm is O(n). It solves the problem of ordered replication of state machines when the leader node is anonymous. We analyze the algorithm, it ensures safety and liveness when the fault nodes are less than one-third of the total. We evaluate the throughput, latency, scalability, resource consumption, exception processing, smart contract, and blockchain network through experiments. The throughput of the proposed algorithm is 49.3% higher than that of the practical Byzantine fault tolerance (PBFT) algorithm. The experimental results show that the proposed algorithm has high performance and scalability.
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...
详细信息
In natural gas automated trading, transaction efficiency of the whole trading system will inevitably be affected with the expansion of network size and the increase of transaction volume. In order to improve the timel...
详细信息
A control strategy based on an improved consensus algorithm for balancing the output current of energy storage units in isolated DC microgrids, considering differences in the line impedance of storage units, is propos...
详细信息
Uncertainties of intermittent renewables and complexities of load demands bring challenges to the optimal operation of the microgrid. This paper proposes a fully distributed method based on the consensus algorithm for...
详细信息
Uncertainties of intermittent renewables and complexities of load demands bring challenges to the optimal operation of the microgrid. This paper proposes a fully distributed method based on the consensus algorithm for solving the economic dispatch problem (EDP) of DC microgrids. The proposed distributed method is performed using a multiagent system. It only needs information from neighboring agents and does not need a central controller. A two-level control structure is adopted to realize the economic dispatch and voltage regulation simultaneously. The upper level obtains the optimal power reference of dispatchable agents and maintains the power balance of the system. The lower level performs an improved droop control to track the power reference and regulate the average bus voltage for the microgrid. The proposed method's properties and convergence are analyzed using eigenvalue perturbation theory to obtain a faster convergence speed. By designing the adjacency matrix appropriately, the proposed method can ensure the system stable when the communication topology changes. Finally, several simulations are designed to verify the effectiveness of this novel control method.
This article focuses on the application of blockchain consensus algorithms in the power energy trading system and the comparison of these algorithms such as PBFT(Practical Byzantine Fault Tolerance), Raft and IBFT(Ist...
详细信息
ISBN:
(纸本)9798350310764
This article focuses on the application of blockchain consensus algorithms in the power energy trading system and the comparison of these algorithms such as PBFT(Practical Byzantine Fault Tolerance), Raft and IBFT(Istanbul Byzantine Fault Tolerance). The article introduces the concept of blockchain consensus algorithms and its application in power energy trading system. It then provides a brief overview of the three algorithms and their underlying structures. The comparison of the algorithms is done in terms of features such as scalability, reliability and security. The article also provides an overview of the advantages and disadvantages of each algorithm and its application in power energy trading system. We examine the blockchain partition algorithm improved by the integration of Raft consensus and IBFT consensus, with a special focus on the advantages of using a hybrid algorithm in distributed networks. We discuss the need for consensus algorithms that are well-suited to blockchain networks and the improved security provided by a consensus algorithm incorporating both Raft and *** also discuss the implications of incorporating Raft and IBFT into a blockchain partition algorithm and its potential scalability. In conclusion, we provide a synthesis of our research, with potentials for further studies and contributions in this field.
暂无评论