dc.contributor.author | Hadjicostis, Christoforos N. | en |
dc.contributor.author | Domínguez-Garcia, A. D. | en |
dc.contributor.author | Vaidya, N. H. | en |
dc.creator | Hadjicostis, Christoforos N. | en |
dc.creator | Domínguez-Garcia, A. D. | en |
dc.creator | Vaidya, N. H. | en |
dc.date.accessioned | 2019-04-08T07:46:04Z | |
dc.date.available | 2019-04-08T07:46:04Z | |
dc.date.issued | 2012 | |
dc.identifier.uri | http://gnosis.library.ucy.ac.cy/handle/7/43560 | |
dc.description.abstract | We address the average-consensus problem for a distributed system whose components (nodes) can exchange information via unreliable interconnections (edges) that form an arbitrary, possibly directed topology (digraph). We consider a general setting where heterogeneous communication links may drop packets with generally unequal probabilities, independently between different links. We develop a distributed linear-iterative algorithm in which nodes maintain and update certain values based on the corresponding values they successfully receive from their in-neighbors. We demonstrate that, even when communication links drop packets with unequal probabilities, the proposed algorithm allows nodes to asymptotically reach average-consensus almost surely, as long as the underlying (possibly directed) communication topology forms a strongly connected digraph. Additionally, we provide a bound on the algorithm convergence rate. © 2012 IEEE. | en |
dc.source | Proceedings of the IEEE Conference on Decision and Control | en |
dc.source | Proceedings of the IEEE Conference on Decision and Control | en |
dc.source.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-84874248409&doi=10.1109%2fCDC.2012.6426666&partnerID=40&md5=21f1688c3381a7ada4a55414a2881c2e | |
dc.subject | Algorithms | en |
dc.subject | Distributed systems | en |
dc.subject | Communication topologies | en |
dc.subject | Directed graphs | en |
dc.subject | Strongly connected | en |
dc.subject | Average consensus | en |
dc.subject | Algorithm convergence | en |
dc.subject | Directed topology | en |
dc.subject | Heterogeneous communication | en |
dc.subject | Packet dropping | en |
dc.title | Resilient average consensus in the presence of heterogeneous packet dropping links | en |
dc.type | info:eu-repo/semantics/conferenceObject | |
dc.identifier.doi | 10.1109/CDC.2012.6426666 | |
dc.description.startingpage | 106 | |
dc.description.endingpage | 111 | |
dc.author.faculty | Πολυτεχνική Σχολή / Faculty of Engineering | |
dc.author.department | Τμήμα Ηλεκτρολόγων Μηχανικών και Μηχανικών Υπολογιστών / Department of Electrical and Computer Engineering | |
dc.type.uhtype | Conference Object | en |
dc.contributor.orcid | Hadjicostis, Christoforos N. [0000-0002-1706-708X] | |
dc.gnosis.orcid | 0000-0002-1706-708X | |