Show simple item record

dc.contributor.authorSundaram, S.en
dc.contributor.authorHadjicostis, Christoforos N.en
dc.creatorSundaram, S.en
dc.creatorHadjicostis, Christoforos N.en
dc.date.accessioned2019-04-08T07:48:23Z
dc.date.available2019-04-08T07:48:23Z
dc.date.issued2011
dc.identifier.urihttp://gnosis.library.ucy.ac.cy/handle/7/44908
dc.description.abstractGiven a network of interconnected nodes, each with its own value (such as a measurement, position, vote, or other data), we develop a distributed strategy that enables some or all of the nodes to calculate any arbitrary function of the node values, despite the actions of malicious nodes in the network. Our scheme assumes a broadcast model of communication (where all nodes transmit the same value to all of their neighbors) and utilizes a linear iteration where, at each time-step, each node updates its value to be a weighted average of its own previous value and those of its neighbors. We consider a node to be malicious or faulty if, instead of following the predefined linear strategy, it updates its value arbitrarily at each time-step (perhaps conspiring with other malicious nodes in the process). We show that the topology of the network completely characterizes the resilience of linear iterative strategies to this kind of malicious behavior. First, when the network contains 2f or fewer vertex-disjoint paths from some node xj to another node xi, we provide an explicit strategy for f malicious nodes to follow in order to prevent node xi from receiving any information about xj's value. Next, if node xi has at least 2f+1 vertex-disjoint paths from every other (non-neighboring) node, we show that xi is guaranteed to be able to calculate any arbitrary function of all node values when the number of malicious nodes is f or less. Furthermore, we show that this function can be calculated after running the linear iteration for a finite number of time-steps (upper bounded by the number of nodes in the network) with almost any set of weights (i.e., for all weights except for a set of measure zero). © 2011 IEEE.en
dc.sourceIEEE Transactions on Automatic Controlen
dc.source.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-79960124958&doi=10.1109%2fTAC.2010.2088690&partnerID=40&md5=28876cfa4280f6d1d97714000a9b3638
dc.subjectMulti agent systemsen
dc.subjectDistributed computer systemsen
dc.subjectObservabilityen
dc.subjectNetworked controlsen
dc.subjectFault-toleranten
dc.subjectDistributed consensusen
dc.subjectDistributed functionen
dc.subjectDistributed function calculationen
dc.subjectMulti-agent systemsen
dc.subjectFault-tolerant consensusen
dc.subjectIntelligent agentsen
dc.subjectNetworked controlen
dc.subjectObservability theoryen
dc.subjectStructured systemsen
dc.subjectWireless broadcast modelen
dc.titleDistributed function calculation via linear iterative strategies in the presence of malicious agentsen
dc.typeinfo:eu-repo/semantics/article
dc.identifier.doi10.1109/TAC.2010.2088690
dc.description.volume56
dc.description.issue7
dc.description.startingpage1495
dc.description.endingpage1508
dc.author.facultyΠολυτεχνική Σχολή / Faculty of Engineering
dc.author.departmentΤμήμα Ηλεκτρολόγων Μηχανικών και Μηχανικών Υπολογιστών / Department of Electrical and Computer Engineering
dc.type.uhtypeArticleen
dc.source.abbreviationIEEE Trans Autom Controlen
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