In islanded microgrids, the existence of nonlinear electric loads may cause voltage distortion and affect the performance of power quality sensitive equipment. Thanks to the prevalent utilization of interfacing power ...
详细信息
ISBN:
(纸本)9789075815238
In islanded microgrids, the existence of nonlinear electric loads may cause voltage distortion and affect the performance of power quality sensitive equipment. Thanks to the prevalent utilization of interfacing power electronic devices and information/communication technologies, distributed generators can be employed as compensators to enhance the power quality on consumer side. However, conventional centralized control is facing obstacles because of the distributed fashion of generation and consumption. Accordingly, this paper proposes a consensus algorithm based distributed hierarchical control to realize voltage harmonic compensation and accurate current sharing in multi-bus islanded microgrids. Low order harmonic components are considered as examples in this paper. Harmonic current sharing is also realized among distributed generators by applying the proposed methods. Plug-and-play capability is demonstrated for flexible operation. The proposed method is based on proper analysis and modeling of the system.
This paper researches the consensus mechanism of Ethereum, focusing on the analysis and research of the consensus algorithm. The consensus algorithm is the kernel of Ethereum implementation, which is the most computat...
详细信息
ISBN:
(纸本)9781728124582
This paper researches the consensus mechanism of Ethereum, focusing on the analysis and research of the consensus algorithm. The consensus algorithm is the kernel of Ethereum implementation, which is the most computationally intensive, time-consuming and occupies much memory. The concrete implementation architecture and method of heterogeneous operation are analyzed and implemented on the Xilinx ZCU106 platform. Finally, the verification content has been obtained.
consensus algorithms can be considered as the core of blockchain technology. Different algorithms provide various advantages and disadvantages to the platform, which can cause the variation in the aspects of scalabili...
详细信息
ISBN:
(数字)9781665461047
ISBN:
(纸本)9781665461047
consensus algorithms can be considered as the core of blockchain technology. Different algorithms provide various advantages and disadvantages to the platform, which can cause the variation in the aspects of scalability, reliability, security, and performance. Deploying a blockchain platform with a consensus algorithm that is not suitable for the situated scenario may lead to low efficiency, waste of energy, unfairness and more. As more businesses are trying to introduce blockchain into their system, there is a demand for selecting consensus algorithms that are suitable for a private chain. Most of the current consensus algorithms are Voting-based or PBFT-based. However, Voting-based algorithms may suffer much from leader-crash, while PBFT-based algorithms may experience network congestion when implemented in a huge network due to its broadcast-like confirmation steps. In this paper, we aim to propose a new type of consensus algorithm based solely on Random Number Generation, called Mosaic. The selection is not only due to its low computational cost compared to cryptographically proof-based algorithms, but also because of its acceptable unpredictability that makes the election fairer. In the evaluation, we demonstrate that Mosaic is more efficient than PBFT-based schemes in large-scale while also providing fault tolerance compared to Raft.
Blockchain is picking up footing and one of the omnipresent themes these days can be named. Despite the fact that faultfinders are challenging its durability, safety and stability, it has officially changed the way of...
详细信息
ISBN:
(纸本)9781728145136
Blockchain is picking up footing and one of the omnipresent themes these days can be named. Despite the fact that faultfinders are challenging its durability, safety and stability, it has officially changed the way of life of numerous people in a few territories due to its overwhelming impact on projects, moreover, organizations. Giving that the highlights of blockchain innovation ensure more solid and convenient administrations, it is imperative to think about the security furthermore, protection concerns and complications behind the inventive innovation. The range of blockchain applications extends to open and public services including health, financial, automotive, Internet of Things (IoT) and risk management. Many talk about using the blockchain data system for various applications in the spotlight. Nonetheless, a comprehensive review on the point of view of specialized applications and applications has not yet been an expert. In this paper, we seek to perform a thorough study on the technology of blockchain by analyzing its architecture of varying consensus algorithms over and above challenges and opportunities for security and data protection within blockchains.
This paper presents Crux, a new permissionless blockchain consensus algorithm that achieves higher fault tolerance rate with more flexibility than existing blockchains such as Bitcoin, Ethereum and EOS. Crux utilize a...
详细信息
ISBN:
(数字)9783030057640
ISBN:
(纸本)9783030057640;9783030057633
This paper presents Crux, a new permissionless blockchain consensus algorithm that achieves higher fault tolerance rate with more flexibility than existing blockchains such as Bitcoin, Ethereum and EOS. Crux utilize a DPoS-XPaxos pipelined algorithm to achieve effective and efficient consensus. Those who hold tokens in Crux elect 2f + 1 block producers called validators through a continuous approval voting system. The elected validators are scheduled in an order and produce blocks in turns agreed by all of the validators. XPaxos, guarantees f/2f+1 fault tolerance rate, is added to traditional DPoS to confirm blocks. Once f + 1 validators have signed a block, it is deemed irreversible. Analysis shows Crux provides higher securities, better flexibility, higher TPS (transaction per second) with little cost of centralization compared with existing blockchain consensus algorithms.
Multiple SDN controllers architecture has been proposed to improve the scalability problem and to avoid a single point of failure. One major issue in the SDN multiple controllers architecture is how to reach a consist...
详细信息
ISBN:
(纸本)9788996865063
Multiple SDN controllers architecture has been proposed to improve the scalability problem and to avoid a single point of failure. One major issue in the SDN multiple controllers architecture is how to reach a consistent network state among SDN controllers. In order to resolve the above issue and to make sure that all controllers have the same network state and the whole network becomes consistent, an efficient consensus mechanism to synchronize the control state of each controller is required. In view of this, we propose a Fast Paxos-based consensus algorithm (FPC) which provides strong consistency. The proposed FPC uses a controller priority mechanism to guarantee a proposal must be elected in each round and no additional round is needed even more than two proposers get the same votes. Using Estinet, simulation results have shown that the proposed FPC has lower average consensus time (35.3% lower) than Raft. With a low consensus time, the proposed FPC can improve the data store access performance (26.0% faster at retrieving data and 59.7% faster at storing data via the REST API comparing with the Raft). Therefore, the proposed FPC is feasible for multiple SDN controller networks.
High real-time and highly adversarial environment put forward higher requirements for the performance of blockchain consensus algorithm. To improve Raft's consensus efficiency and safety, we propose an improved Ra...
详细信息
ISBN:
(数字)9783030875718
ISBN:
(纸本)9783030875718;9783030875701
High real-time and highly adversarial environment put forward higher requirements for the performance of blockchain consensus algorithm. To improve Raft's consensus efficiency and safety, we propose an improved Raft algorithm called "hhRaft" to optimize Raft consensus process by introducing a new role of monitor. In the leader election phase, monitor nodes supervise the candidate nodes by identifying the malicious node's forged Requestvote message. In the log replication phase, monitor nodes supervise the leader node by comparing the computing results of transactions. Through the performance test on theConsortium Blockchain - Hyperledger Fabric, it is proved that hhRaft is superior to the original Raft algorithm in terms of transaction throughput, consensus latency, and antiByzantine Fault capabilities, making it suitable for use in high real-time and highly adversarial environment.
One of the biggest criticisms of the Bitcoin Core blockchain technology lies in its consensus algorithm, known as Proof-of-Work (PoW). This compute-intensive consensus algorithm is resulting in an ever-increasing elec...
详细信息
ISBN:
(纸本)9781665442664
One of the biggest criticisms of the Bitcoin Core blockchain technology lies in its consensus algorithm, known as Proof-of-Work (PoW). This compute-intensive consensus algorithm is resulting in an ever-increasing electrical cost per transaction, this is compounded by its data storage limitations. Consequently, this phenomenon determines the maximum limit in the transaction processing rate. This limitation is causing many industries to refrain from using Blockchain technology. This paper proposes a Proof-of-Enough-Work (PoEW) consensus algorithm for a BC blockchain configuration to get rid of this obstacle. We present parallel block processing through the reallocation of computing resources, specifically used to add blocks to the blockchain, also called mining. This is explicitly done with an extension to the key BC mining parameters, called the block difficulty or the amount of computing effort needed to process a block. The introduction of an efficient use of computing resources or effort significantly increases the transaction processing *** simulations we demonstrate a significant increase in transaction processing rate compared to conventional PoW. It produces transaction processing comparable to centralised transaction networks or a high transaction throughput solution. Moreover, the proposed consensus algorithm reduces the cost per transaction in terms of electricity usage.
Blockchain is a distributed data structure that ensures data security and reliability, and has been widely used in different application scenarios. As the core part of blockchain, consensus algorithm has become the bo...
详细信息
ISBN:
(纸本)9783030859282;9783030859275
Blockchain is a distributed data structure that ensures data security and reliability, and has been widely used in different application scenarios. As the core part of blockchain, consensus algorithm has become the bottleneck of blockchain development, which directly determines the performance of blockchain system. Therefore, considering the preference of nodes, we propose a node preference-aware delegated proof of stake consensus algorithm with reward and punishment mechanism (NPRP-DPoS) to improve the reputation of witness nodes. NPRP-DPoS designs a reward and punishment mechanism to reward or punish generators and voters, and constructs a reputation mechanism to motivate the positive behavior of nodes. At the same time, NPRP-DPoS uses Borda count to select the witness nodes which are more in line with the preference of the voting nodes. The experimental results shows that NPRP-DPoS algorithm can quickly eliminate exception nodes and motivate nodes to vote effectively. Also, NPRP-DPoS algorithm makes the election more fair and reasonable, ensures the interests of nodes and enhances the security of system.
We propose a novel state estimation algorithm for consensus dynamics subject to measurement error. We first demonstrate that with properly tuned parameters, our algorithm attains the same equilibrium value that would ...
详细信息
We propose a novel state estimation algorithm for consensus dynamics subject to measurement error. We first demonstrate that with properly tuned parameters, our algorithm attains the same equilibrium value that would be attained using the traditional algorithm based on local state feedback (nominal consensus). We then show that our approach improves consensus performance in a particular class of problems by reducing the state error (i.e., the difference between the agent states and the consensus value). A numerical example compares the performance of the distributed algorithm we propose to that of the traditional local feedback scheme. The results show that the proposed algorithm significantly reduces the state error. Copyright (C) 2019. The Authors. Published by Elsevier Ltd. All rights reserved.
暂无评论