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.issued2008
dc.identifier.isbn978-1-4244-2079-7
dc.identifier.urihttp://gnosis.library.ucy.ac.cy/handle/7/44916
dc.description.abstractWe consider the problem of distributed function calculation in the presence of faulty or malicious agents. In particular, we consider a setup where each node has an initial value and the goal is for (a subset of) the nodes to calculate a function of these values in a distributed manner. We focus on linear iterative strategies for function calculation, where each node updates its value at each time-step to be a weighted average of its own previous value and those of its neighbors; after a sufficiently large number of time-steps, each node is expected to have enough information to calculate the desired function of the initial node values. We study the susceptibility of such strategies to misbehavior by some nodes in the network; specifically, we consider a node to be malicious if it updates its value arbitrarily at each time-step, instead of following the predefined linear iterative strategy. If the connectivity of the network topology is 2f or less, we show that it is possible for a set of f malicious nodes to conspire in a way that makes it impossible for a subset of the other nodes in the network to correctly calculate an arbitrary function of all node values. Our analysis is constructive, in that it provides a specific scheme for the malicious nodes to follow in order to obfuscate the network in this fashion. ©2008 AACC.en
dc.sourceProceedings of the American Control Conferenceen
dc.sourceProceedings of the American Control Conferenceen
dc.source.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-52449121020&doi=10.1109%2fACC.2008.4586680&partnerID=40&md5=9bc68b4a9186759162624627e2c504ab
dc.subjectInitial valuesen
dc.subjectIterative strategyen
dc.subjectMalicious nodesen
dc.subjectArbitrary functionsen
dc.subjectComputer programming languagesen
dc.subjectDistributed functionsen
dc.subjectElectric network topologyen
dc.subjectNetwork topologiesen
dc.subjectTime steppingen
dc.subjectWeighted averagingen
dc.titleDistributed function calculation via linear iterations in the presence of malicious agents - Part I: Attacking the networken
dc.typeinfo:eu-repo/semantics/conferenceObject
dc.identifier.doi10.1109/ACC.2008.4586680
dc.description.startingpage1350
dc.description.endingpage1355
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