Show simple item record

dc.contributor.authorOliva, G.en
dc.contributor.authorSetola, R.en
dc.contributor.authorHadjicostis, Christoforos N.en
dc.creatorOliva, G.en
dc.creatorSetola, R.en
dc.creatorHadjicostis, Christoforos N.en
dc.date.accessioned2019-04-08T07:47:33Z
dc.date.available2019-04-08T07:47:33Z
dc.date.issued2017
dc.identifier.urihttp://gnosis.library.ucy.ac.cy/handle/7/44434
dc.description.abstractConsensus is a fundamental feature of distributed systems, and it is the prerequisite for several complex tasks, such as flocking of mobile robots, localization in wireless-sensor networks, or decentralized control of smart grids. Average consensus, in particular, is quite challenging, because it is typically obtained asymptotically, while few finite-time algorithms are available. In this paper, we provide a methodology to achieve distributed average consensus in finite time, while maintaining low computational and memory requirements, and small completion times. The provided solution, namely, finite-time average-consensus by iterated max-consensus (FAIM) is based on several runs of the maxconsensus algorithm, and has low memory requirements for each node. Compared to existing Flooding approaches, the proposed algorithm requires less memory, at the cost of a slight increase in the number of steps required for termination. The FAIM algorithm assumes that the nodes are aware of an upper bound on the network diameter. To relax this assumption, we complement this paper with a novel distributed algorithm that, in the case of undirected graphs, provides an upper bound on the network diameter which, in the worst case, is twice the actual diameter. A comparison of the proposed finite-time algorithm against the state of the art concludes this paper. © 2016 IEEE.en
dc.sourceIEEE Transactions on Control of Network Systemsen
dc.source.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85020913743&doi=10.1109%2fTCNS.2016.2524983&partnerID=40&md5=da610a238b4fb317934e79e5d35f0c4c
dc.subjectParallel algorithmsen
dc.subjectDistributed systemsen
dc.subjectComplex networksen
dc.subjectSensor networksen
dc.subjectWireless sensor networksen
dc.subjectAverage consensusen
dc.subjectDistributed algorithmsen
dc.subjectFinite-time average consensusen
dc.subjectFinite-time averagesen
dc.subjectDistributed average consensusen
dc.subjectFundamental featuresen
dc.subjectMax consensusen
dc.subjectMemory requirementsen
dc.subjectStorage capabilityen
dc.titleDistributed finite-time average-consensus with limited computational and storage capabilityen
dc.typeinfo:eu-repo/semantics/article
dc.identifier.doi10.1109/TCNS.2016.2524983
dc.description.volume4
dc.description.issue2
dc.description.startingpage380
dc.description.endingpage391
dc.author.facultyΠολυτεχνική Σχολή / Faculty of Engineering
dc.author.departmentΤμήμα Ηλεκτρολόγων Μηχανικών και Μηχανικών Υπολογιστών / Department of Electrical and Computer Engineering
dc.type.uhtypeArticleen
dc.source.abbreviationIEEE Trans.Control Netw.Syst.en
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