Convergence acceleration of gossip protocols applied for decentralized distribution grid management

A Novel Distributed Large-Scale Demand Response Scheme in High Proportion Renewable Energy Sources Integration Power Systems

“…For example, references [49,50] proposed a distributed architecture for managing power flows on distribution grids based on the Gossip algorithm. The basic ideal of the Gossip algorithm is to get global information, such as a sum and average value, based on exchanging one's own information with some neighbor nodes but not gathering the information in a centric node.…”

“…Note that the Laplacian matrix L is hard to obtain not only for customers but also for LSE. In addition, different from [49,50], the network in our scheme is not physically connected but is socially connected, and customers only know the connecting information regarding themselves. That is, there is no one who can gather and calculate an adjacent matrix A and degree matrix D. To solve this problem, this paper improves the approach to calculating the heights to be adjusted to our DR scheme.…”

Overview of Decentralized Distribution System Operation Techniques

“…The participating entities negotiate next, in order to arrive to an agreement regarding the amount of power to be altered, along with their respective reimbursement. The solution is calculated using distributed constrained optimization techniques that enable the problem to be solved in a distributed manner with optimality guarantees [2]. The proposed method is scalable and fully decentralized.…”

“…In more detail, each node is assumed to exchange only locally available information in turns with its neighbouring nodes, it processes the available and received information to converge on a consensus estimate of a global state variable and finally a decision is taken, that solves the problem of deviation between scheduled net demand and the current demand. The application of gossip algorithms assumes the implementation of peer-to-peer communications over the existing telecommunication infrastructure as an overlay network [2]. Gossip algorithms constitute a large family of distributed algorithms that are mainly used for information dissemination.…”

“…The basic gossip algorithm for calculation of summation includes local exchange of information between neighbouring nodes of the grid, which elaborate the received information in an appropriate manner before sending it again in the next gossip round to their neighbours. The convergence into a global variable is ensured and accelerated by the appropriate selection of the weights' matrix [2]. The algorithm utilizes a gossiping method, in order to calculate in a distributed manner all the necessary information and moreover to communicate parameters and decisions to all participating nodes.…”