Distributed network size estimation and average degree estimation and control in networks isomorphic to directed graphs

Iman Shames*, Themistoklis Charalambous, Christoforos N. Hadjicostis, Mikael Johansson

*Tämän työn vastaava kirjoittaja

Tutkimustuotos: Artikkeli kirjassa/konferenssijulkaisussaConference contributionScientificvertaisarvioitu

32 Sitaatiot (Scopus)

Abstrakti

Many properties of interest in graph structures are based on the nodes' average degree (i.e., the average number of edges incident to/from each node). In this work, we present asynchronous distributed algorithms, based on ratio consensus, that can be used to accurately estimate the number of nodes in a multi-component system whose communication topology is described by a directed graph. In addition, we describe an asynchronous distributed algorithm that allows each node to introduce or terminate links in order to reach a target average degree in the network. Such an approach can be useful in many realistic scenarios; for example, for the introduction and removal of renewable energy resources in a power network, while maintaining an average degree that fulfils some structural and dynamical properties and/or optimises some performance indicators of the network. The effectiveness of the proposed algorithms is demonstrated via illustrative examples.

AlkuperäiskieliEnglanti
Otsikko2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012
Sivut1885-1892
Sivumäärä8
DOI - pysyväislinkit
TilaJulkaistu - 2012
OKM-julkaisutyyppiA4 Artikkeli konferenssijulkaisuussa
TapahtumaAllerton Conference on Communication, Control, and Computing - Monticello, Yhdysvallat
Kesto: 1 lokakuuta 20125 lokakuuta 2012
Konferenssinumero: 50

Conference

ConferenceAllerton Conference on Communication, Control, and Computing
LyhennettäAllerton
MaaYhdysvallat
KaupunkiMonticello
Ajanjakso01/10/201205/10/2012

Sormenjälki

Sukella tutkimusaiheisiin 'Distributed network size estimation and average degree estimation and control in networks isomorphic to directed graphs'. Ne muodostavat yhdessä ainutlaatuisen sormenjäljen.

Siteeraa tätä