2016
DOI: 10.1109/tste.2016.2520360
|View full text |Cite
|
Sign up to set email alerts
|

Gossip Algorithms for Decentralized Congestion Management of Distribution Grids

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
16
0
2

Year Published

2017
2017
2024
2024

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 29 publications
(18 citation statements)
references
References 29 publications
0
16
0
2
Order By: Relevance
“…The latency in (20) refers to the technology of the communication network between DCUs. For our calculations, we assume that the data to be transmitted between two DCUs can form one message, considering the data size of our problem [38]. We also assume that all parallel message transmissions of the communication tasks need the same time, determined by the latency of the communication technology.…”
Section: A Performance Metricsmentioning
confidence: 99%
“…The latency in (20) refers to the technology of the communication network between DCUs. For our calculations, we assume that the data to be transmitted between two DCUs can form one message, considering the data size of our problem [38]. We also assume that all parallel message transmissions of the communication tasks need the same time, determined by the latency of the communication technology.…”
Section: A Performance Metricsmentioning
confidence: 99%
“…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.…”
Section: Iterative Distributed Scheme Based On Gossip Algorithmmentioning
confidence: 99%
“…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.…”
mentioning
confidence: 99%
“…This is the simplest way to compare the two contours. This is the definition of the Hu moment [13]. Set a twodimensional continuous random function.…”
Section: B the Hu Moment Algorithm Distinguishes Vehicle Typesmentioning
confidence: 99%