Peer-to-peer energy trading allows smart grid-connected parties to trade renewable energy among each other. It is widely considered as a scheme to mitigate the supply-demand imbalances during peak-hour. However, the m...
详细信息
Peer-to-peer energy trading allows smart grid-connected parties to trade renewable energy among each other. It is widely considered as a scheme to mitigate the supply-demand imbalances during peak-hour. However, the main challenge of such a scheme is the lack of secure, efficient, and transparent systems that foster economic incentives for users. This paper proposes a novel system that combines cooperative game theory and blockchain technology to stimulate users to maximize their profit and trade energy securely. In our model, users can store renewable energy credits as assets in the blockchain and trade them with others. We also develop a modified version of Proof of Energy Generation (PoEG) by including distribution line loss as a consensus mechanism among blockchain energy trading members. Then, we propose a coalition formation algorithm based on PoEG protocol and optimization technique to determine the winning coalition as block miners. The system is validated through comprehensive theoretical analysis and simulation experiments utilizing a standard IEEE 14-bus system and a real-life dataset (Ausgrid). Also, the developed model is implemented on the Avalanche blockchain platform. The test results show that the proposed scheme improves prosumers' financial benefits by 6.5% in terms of energy savings compared to the baseline model. The experiments demonstrate the effectiveness, capabilities, and robustness of the proposed system.
consensus-based distributed algorithms are well suited for coordination among agents in a cyber-physical system. These distributed schemes, however, suffer from their vulnerability to cyber attacks that are aimed at m...
详细信息
ISBN:
(数字)9781728159539
ISBN:
(纸本)9781728159546
consensus-based distributed algorithms are well suited for coordination among agents in a cyber-physical system. These distributed schemes, however, suffer from their vulnerability to cyber attacks that are aimed at manipulating data and control ow. In this article, we present a novel distributed method for detecting the presence of such intrusions for a distributed multi-agent system following ratio consensus. We employ a Max-Min protocol to develop low cost, easy to implement detection strategies where each participating node detects the intrusion independently, eliminating the need for a trusted certifying agent in the network. The effectiveness of the detection method is demonstrated by numerical simulations on a 1000 node network to demonstrate the efficacy and simplicity of implementation.
The blockchain technology revolution and the use of blockchains in various applications have resulted in many companies and programmers developing and customizing specific fit-for-purpose consensus algorithms. Securit...
详细信息
ISBN:
(数字)9781728156286
ISBN:
(纸本)9781728156293
The blockchain technology revolution and the use of blockchains in various applications have resulted in many companies and programmers developing and customizing specific fit-for-purpose consensus algorithms. Security and performance are determined by the chosen consensus algorithm; hence, the reliability and security of these algorithms must be assured and tested, which requires an understanding of all the security assumptions that make such algorithms correct and byzantine *** paper studies the "security ingredients" that enable a given consensus algorithm to achieve safety, liveness, and byzantine fault tolerance (BFT) in both permissioned and permissionless blockchain systems. The key contributions of this paper are the organization of these requirements and a new taxonomy that describes the requirements for security. The CAP Theorem is utilized to explain important tradeoffs between consistency and availability in consensus algorithm design, which are crucial depending on the specific application of a given algorithm. This topic has also been explored previously by De Angelis. However, this paper expands that prior explanation and dilemma of consistency vs. availability and then combines this with Buterin's Trilemma to complete the overall exposition of tradeoffs.
Blockchain technology is a revolution started as a new economy with an alternative currency namely Bitcoin. Besides the economical aspect, the technological capabilities of Blockchain such as distributed computing, re...
详细信息
Blockchain technology is a revolution started as a new economy with an alternative currency namely Bitcoin. Besides the economical aspect, the technological capabilities of Blockchain such as distributed computing, record keeping, irrecoverability of transactions, reliability and etc., are harnessed by variety of real-world applications. Blockchain is a rising pool of records known as blocks linked using security procedure. It is typically managed by a group of nodes in a distributed network technology which integrates technologies such as distributed ledger, security and consensus algorithm to ensure reliability and immutability. In Blockchain, the access privileges are determined by a set of nodes called miners, which run the consensus algorithm mechanism to ensure the trust and robustness of the miners and eliminate the malicious miners which runs the consensus algorithm. Therefore, this paper proposes a trust model with an objective of eliminating untrusted nodes from the mining process to enhance the reliability and security of the Blockchain. Further, the proposed trust model is suitably analysed for transaction rate, efficiency and scalability with Hyper Ledger framework to ensure the robustness.
This paper presents a fault detection strategy for discrete uncertain systems subject to deception attack based on the probabilistic framework. Probabilistic parameter models are utilized for characterizing model unce...
详细信息
In this paper, the consensus tracking problem is investigated for a class of continuous switched stochastic nonlinear multiagent systems with an event-triggered control strategy. For continuous stochastic multiagent s...
详细信息
In this paper, the consensus tracking problem is investigated for a class of continuous switched stochastic nonlinear multiagent systems with an event-triggered control strategy. For continuous stochastic multiagent systems via event-triggered protocols, it is rather difficult to avoid the Zeno behavior by the existing methods. Thus, we propose a new protocol design framework for the underlying systems. It is proven that follower agents can almost surely track the given leader signal with bounded errors and no agent exhibits the Zeno behavior by the given control scheme. Finally, two numerical examples are given to illustrate the effectiveness and advantages of the new design techniques.
The well-developed consensus algorithm provides an elegant distributed way for solving the energy management problem. The convergence of the consensus-based distributed approach depends on the reliable exchange of the...
详细信息
The well-developed consensus algorithm provides an elegant distributed way for solving the energy management problem. The convergence of the consensus-based distributed approach depends on the reliable exchange of the information with neighbors. This assumption might be violated in practice due to inevitable and random packet losses. In this paper, the impact of packet losses on the consensus-based distributed approach is analyzed. We show the iterative calculation converges to an incorrect solution in the presence of packet losses, where the power supply could not meet with the demand. More importantly, we find the error in the final result is accumulated over every packet loss event, and we identify the critical information that cause the error. Based on the analysis, a corrective method is proposed to assure convergence to the right schedule. The corrective method has two features: 1) it uses the original consensus network, and no communication reconfiguration is needed;and 2) no retransmissions for the lost packets are needed, instead, the errors are compensated by a new variable introduced in the update rule. We show that the proposed algorithm could achieve the optimal solution in the presence of packet losses. Numerical simulation results are used to validate the proposed algorithm.
This brief addresses the fixed-time event/self-triggered leader-follower consensus problems for networked multi-agent systems subject to nonlinear dynamics. First, we present an event-triggered control strategy to ach...
详细信息
This brief addresses the fixed-time event/self-triggered leader-follower consensus problems for networked multi-agent systems subject to nonlinear dynamics. First, we present an event-triggered control strategy to achieve the fixed-time consensus, and a new measurement error is designed to avoid Zeno behavior. Then, two new self-triggered control strategies are presented to avoid continuous triggering condition monitoring. Moreover, under the proposed self-triggered control strategies, a strictly positive minimal triggering interval of each follower is given to exclude Zeno behavior. Compared with the existing fixed-time event-triggered results, we propose two new self-triggered control strategies, and the nonlinear term is more general. Finally, the performances of the consensus tracking algorithms are illustrated by a simulation example.
In this paper, a twisting-based consensus algorithm is put forward to deal with the event-triggered finite-time consensus for networked Lagrangian systems with directed graphs. First, a fully distributed event-trigger...
详细信息
In this paper, a twisting-based consensus algorithm is put forward to deal with the event-triggered finite-time consensus for networked Lagrangian systems with directed graphs. First, a fully distributed event-triggered finite-time protocol is considered, for which we can show that each agent can achieve the consensus after a settling time. In order to remove the requirement of continuous monitoring, a pull-based triggering mechanism is employed. Simultaneously, the Zeno-behavior can be excluded under a finite-time dynamic condition. Then, due to the advantages of non-chattering behaviors and finite-time convergence, a twisting-based consensus algorithm based on homogeneous techniques is developed to drive the Euler-Lagrange systems to the consensus value in a settling time. By means of Polya's theorem and Sum of Squares tools, a polynomial Lyapunov function is constructed to verify our criteria. At last, we give a numerical example for 2-DOF prototype manipulators to verify the validity of the theoretical results.
暂无评论