Distributed network size estimation and average degree estimation and control in networks isomorphic to directed graphs
2012 (English)In: 2012 50th Annual Allerton Conference On Communication, Control, And Computing (Allerton), 2012, 1885-1892 p.Conference paper (Refereed)
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.
Place, publisher, year, edition, pages
2012. 1885-1892 p.
Asynchronous distributed algorithms, Communication topologies, Distributed networks, Dynamical properties, Graph structures, Multi-component systems, Performance indicators, Realistic scenario
Electrical Engineering, Electronic Engineering, Information Engineering
IdentifiersURN: urn:nbn:se:kth:diva-117622DOI: 10.1109/Allerton.2012.6483452ISI: 000320654000261ScopusID: 2-s2.0-84875712227ISBN: 978-146734538-5OAI: oai:DiVA.org:kth-117622DiVA: diva2:602328
2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012; Monticello, IL; United States; 1 October 2012 through 5 October 2012
QC 201305212013-01-312013-01-312013-07-31Bibliographically approved