Smart buildings in the integrated community energy system (ICES) are normally equipped with distributed energy resources (DERs), thereby creating building prosumers with both energy production and consumption. Peer-to...
详细信息
Smart buildings in the integrated community energy system (ICES) are normally equipped with distributed energy resources (DERs), thereby creating building prosumers with both energy production and consumption. Peer-to-peer (P2P) energy trading among building prosumers can bring higher economic benefits for them. Therefore, a P2P multi-energy trading scheme among building prosumers is proposed, which fully explores the flexibility of buildings' heating loads based on the thermal dynamics of buildings with different thermal insulation properties. Each building prosumer is heterogeneous in terms of its computation and communication infrastructures. This results in a heavy computation burden with the traditional centralized method. To improve the computational efficiency for P2P trading among heterogeneous building prosumers, an asynchronous distributed algorithm based on alternating direction method of multipliers (ADMM) is developed to enable each prosumer to trade energy asynchronously instead of waiting for the trading information from others with poor infrastructure. This asynchronous procedure integrated with the prediction and anomaly detection steps can further accelerate the convergence speed of P2P trading. Simulation results verify the effectiveness of the proposed trading scheme and the feasibility and solution optimality of the proposed algorithm.
This article considers a class of noncooperative games in which the feasible decision sets of all players are coupled together by a coupled inequality constraint. Adopting the variational inequality formulation of the...
详细信息
This article considers a class of noncooperative games in which the feasible decision sets of all players are coupled together by a coupled inequality constraint. Adopting the variational inequality formulation of the game, we first introduce a new local edge-based equilibrium condition with full information. Considering challenges when communication delays occur, we then devise an asynchronous distributed algorithm to seek a generalized Nash equilibrium. This asynchronous scheme arbitrarily activates one player to start new computations independently at different iteration instants, which means that the picked player can use the involved outdated information from itself and its neighbors to perform new updates. In theoretical aspect, we provide explicit conditions on algorithm parameters, for instance, the step-sizes to establish a sublinear convergence rate for the synchronous version. Next, the asynchronousalgorithm guarantees almost sure convergence in expectation under the same step-size conditions and some standard assumptions. Finally, the viability and performance of the proposed algorithm are demonstrated by numerical studies on the Cournot competition.
In this paper, we consider a multi-cell network where every base station (BS) serves multiple users with an antenna array. Each user is associated with only one BS and has a single antenna. Assume that only long-term ...
详细信息
In this paper, we consider a multi-cell network where every base station (BS) serves multiple users with an antenna array. Each user is associated with only one BS and has a single antenna. Assume that only long-term channel state information (CSI) is available in the system. The objective is to minimize the network downlink transmission power needed to meet the users' signal-to-interference-plus-noise ratio (SINR) requirements. For this objective, we propose an asynchronousdistributed beamforming and power control algorithm, which provides the same optimal solution as given by centralized algorithms. To design the algorithm, the power minimization problem is formulated mathematically as a non-convex problem. For distributed implementation, the non-convex problem is cast into the dual decomposition framework. Resorting to the theory about matrix pencil, a novel asynchronous iterative method is proposed for solving the dual of the non-convex problem. The methods for beamforming and power control are obtained by investigating the primal problem. Finally, simulation results are provided to demonstrate the convergence and performance of the algorithm.
In this work, we resolve a cross-layer distributed optimization problem in wireless multi-hop networks that can jointly maximize network lifetime and optimize system utility. For this problem, even a synchronous distr...
详细信息
In this work, we resolve a cross-layer distributed optimization problem in wireless multi-hop networks that can jointly maximize network lifetime and optimize system utility. For this problem, even a synchronous distributedalgorithm would be unacceptable due to simultaneous computations required and a global order of transmission to be known in advance. Therefore, we derive an edge-based formulation for consensus agreement on the variables involved, and develop an asynchronous decentralized algorithm specific to the joint optimization problem based on alternating direction method of multipliers (ADMM). Our numerical results show that the ADMM-based algorithm can make a good trade-off between the heterogeneous optimization objectives with excellent computational efficiency, and exhibit that the algorithm can converge faster to a stable solution than a gossip-based algorithm for the same aim, and as efficiently as the synchronous counterpart.
Virtual Power Plant (VPP) aggregates and coordinates community-owned renewable distributed generations (DGs) and flexibility resources for participating in power system operation. In this paper, the coordinated operat...
详细信息
Virtual Power Plant (VPP) aggregates and coordinates community-owned renewable distributed generations (DGs) and flexibility resources for participating in power system operation. In this paper, the coordinated operation problem of VPPs and the distribution system operator (DSO) is formulated as minimizing the total operational cost constrained by linearized three-phase power flow equations and operational constraints. To preserve the VPPs' privacy, the DSO needs to coordinate the VPPs in a distributed manner. However, conventional synchronous distributed methods may suffer from communication delays or failures because of the flimsy communication conditions between DSO and VPPs. We propose an asynchronous distributed algorithm that is robust against communication uncertainties. Firstly, a hybrid alternative direction method of multipliers (ADMM) algorithm is developed, which can be applied to convex problems with promising convergence performance. In the hybrid ADMM framework, the delayed or missing data that transmitted from VPPs are compensated by a novel predicting algorithm combining the multi-parameter quadratic programming (MPQP) and autoregressive integrated moving average model (ARIMA). We prove that the proposed algorithm can converge under imperfect communication condition with some mild assumptions. Numerical tests on IEEE 33-bus and IEEE 123-bus systems indicate that the proposed method has more reliable and faster convergence performance than existing asynchronous methods in all cases.
The replication of popular data objects can effectively reduce the access time and bandwidth requirements of network services. We study the replication problem in the model of distributed replication groups and propos...
详细信息
The replication of popular data objects can effectively reduce the access time and bandwidth requirements of network services. We study the replication problem in the model of distributed replication groups and propose two distributedalgorithms: an approximation optimal replication algorithm, which is an asynchronous distributed algorithm as it takes more time to be completed. However its performance approaches the optimal algorithm, and a fast replication algorithm that is very suitable as the initial algorithm of the approximation optimal algorithm. We give a proof of the complexity of the algorithms, and show that the time and communication complexities of the algorithms are polynomial with respect to the number of objects and the maximum storage capacities of the servers. Finally, simulation experiments are performed to investigate the performance of the algorithms, and the results show that the two algorithms can effectively solve the replication problem.
Low-carbon buildings (LCBs) are normally equipped with distributed energy resources (DERs), thereby creating LCB prosumers with capacities for energy production and consumption. Peer-to-Peer (P2P) energy trading among...
详细信息
ISBN:
(纸本)9798350381849;9798350381832
Low-carbon buildings (LCBs) are normally equipped with distributed energy resources (DERs), thereby creating LCB prosumers with capacities for energy production and consumption. Peer-to-Peer (P2P) energy trading among LCB prosumers could bring higher economic benefits for themselves. To fully harness the potential benefits of LCBs in P2P energy trading, an asynchronous P2P energy trading method among heterogeneous LCB prosumers is proposed in this paper. The flexibility of heating loads of LCBs is fully exploited to benefit LCB prosumers in P2P energy trading by using the thermal dynamics of LCBs. Additionally, each LCB prosumer is heterogeneous in terms of the energy resources configuration and communication network infrastructure, which causes the heavy computation and communication burden using the traditional solution method. To improve the computational efficiency, an asynchronous distributed algorithm based on alternating direction method of multipliers (ADMM) is introduced to enable each LCB prosumer to trade energy asynchronously with no need to wait for the trading information from other LCB prosumers with poor communication network infrastructure. This asynchronous procedure significantly reduces the computation time of P2P energy trading. Simulation results verify the effectiveness of the proposed method and the feasibility of the proposed algorithm.
暂无评论