dc.contributor.author | Sundaram, S. | en |
dc.contributor.author | Hadjicostis, Christoforos N. | en |
dc.creator | Sundaram, S. | en |
dc.creator | Hadjicostis, Christoforos N. | en |
dc.date.accessioned | 2019-04-08T07:48:24Z | |
dc.date.available | 2019-04-08T07:48:24Z | |
dc.date.issued | 2008 | |
dc.identifier.isbn | 978-1-4244-2079-7 | |
dc.identifier.uri | http://gnosis.library.ucy.ac.cy/handle/7/44917 | |
dc.description.abstract | Given a network of interconnected nodes, each with a given initial value, we develop a distributed strategy that enables some or all of the nodes to calculate any arbitrary function of these initial values, despite the presence of some malicious (or faulty) nodes. Our scheme utilizes a linear iterative strategy 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 if, instead of following the predefined linear iterative strategy, it updates its value arbitrarily at each time-step (perhaps by conspiring and coordinating with other malicious nodes). When there are up to f malicious nodes, we show that any node in the network is guaranteed to be able to calculate any arbitrary function of all initial node values if the graph of the network is at least (2f +1)-connected. Specifically, we show that under this condition, the nodes can calculate their desired functions after running the linear iteration for a finite number of timesteps (upper bounded by the number of nodes in the network) using almost any set of weights (i.e., for all weights except for a set of measure zero). Our approach treats the problem of fault-tolerant distributed consensus, where all nodes have to calculate the same function despite the presence of faulty or malicious nodes, as a special case. ©2008 AACC. | en |
dc.source | Proceedings of the American Control Conference | en |
dc.source | Proceedings of the American Control Conference | en |
dc.source.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-52449119147&doi=10.1109%2fACC.2008.4586681&partnerID=40&md5=dcb200627f006317e6182272fd954cc7 | |
dc.subject | Set theory | en |
dc.subject | Interconnected nodes | en |
dc.subject | Linear iteration | en |
dc.subject | Initial values | en |
dc.subject | Finite numbers | en |
dc.subject | Iterative strategy | en |
dc.subject | Malicious nodes | en |
dc.subject | Fault-tolerant | en |
dc.subject | Distributed consensus | en |
dc.subject | Arbitrary functions | en |
dc.subject | Computer programming languages | en |
dc.subject | Distributed functions | en |
dc.subject | Time stepping | en |
dc.subject | Weighted averaging | en |
dc.subject | Malicious behaviors | en |
dc.subject | Number of nodes | en |
dc.title | Distributed function calculation via linear iterations in the presence of malicious agents - Part II: Overcoming malicious behavior | en |
dc.type | info:eu-repo/semantics/conferenceObject | |
dc.identifier.doi | 10.1109/ACC.2008.4586681 | |
dc.description.startingpage | 1356 | |
dc.description.endingpage | 1361 | |
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 | |