Show simple item record

dc.contributor.authorShames, I.en
dc.contributor.authorCharalambous, T.en
dc.contributor.authorHadjicostis, Christoforos N.en
dc.contributor.authorJohansson, M.en
dc.creatorShames, I.en
dc.creatorCharalambous, T.en
dc.creatorHadjicostis, Christoforos N.en
dc.creatorJohansson, M.en
dc.date.accessioned2019-04-08T07:48:17Z
dc.date.available2019-04-08T07:48:17Z
dc.date.issued2012
dc.identifier.isbn978-1-4673-4538-5
dc.identifier.urihttp://gnosis.library.ucy.ac.cy/handle/7/44854
dc.description.abstractMany 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. © 2012 IEEE.en
dc.source2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012en
dc.source2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012en
dc.source.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84875712227&doi=10.1109%2fAllerton.2012.6483452&partnerID=40&md5=3f8095f3a410073b0e1e047bad05265b
dc.subjectEstimationen
dc.subjectAlgorithmsen
dc.subjectCommunicationen
dc.subjectCommunication topologiesen
dc.subjectDirected graphsen
dc.subjectMulti-component systemsen
dc.subjectAsynchronous distributed algorithmsen
dc.subjectBenchmarkingen
dc.subjectDistributed networksen
dc.subjectDynamical propertiesen
dc.subjectGraph structuresen
dc.subjectPerformance indicatorsen
dc.subjectRealistic scenarioen
dc.subjectRenewable energy resourcesen
dc.titleDistributed network size estimation and average degree estimation and control in networks isomorphic to directed graphsen
dc.typeinfo:eu-repo/semantics/conferenceObject
dc.identifier.doi10.1109/Allerton.2012.6483452
dc.description.startingpage1885
dc.description.endingpage1892
dc.author.facultyΠολυτεχνική Σχολή / Faculty of Engineering
dc.author.departmentΤμήμα Ηλεκτρολόγων Μηχανικών και Μηχανικών Υπολογιστών / Department of Electrical and Computer Engineering
dc.type.uhtypeConference Objecten
dc.contributor.orcidHadjicostis, Christoforos N. [0000-0002-1706-708X]
dc.gnosis.orcid0000-0002-1706-708X


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record