Consensus in the presence of an adversary

Ali Khanafer, Behrouz Touri, Tamer Başar

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this work, we consider two types of adversarial attacks on a network of nodes seeking to reach consensus. The first type involves an adversary that is capable of breaking a specific number of links at each time instant. In the second attack, the adversary is capable of corrupting the values of the nodes by adding a noise signal. In this latter case, we assume that the adversary is constrained by a power budget. We consider the optimization problem of the adversary and fully characterize its optimum strategy for each scenario.

Original languageEnglish (US)
Title of host publication3rd IFAC Workshop on Distributed Estimation and Control in Networked Systems, NECSYS 2012
PublisherIFAC Secretariat
Pages276-281
Number of pages6
Edition26
ISBN (Print)9783902823229
DOIs
StatePublished - Jan 1 2012
Event3rd IFAC Workshop on Distributed Estimation and Control in Networked Systems, NECSYS 2012 - Santa Barbara, CA, United States
Duration: Sep 14 2012Sep 15 2012

Publication series

NameIFAC Proceedings Volumes (IFAC-PapersOnline)
Number26
Volume45
ISSN (Print)1474-6670

Other

Other3rd IFAC Workshop on Distributed Estimation and Control in Networked Systems, NECSYS 2012
CountryUnited States
CitySanta Barbara, CA
Period9/14/129/15/12

Keywords

  • Decentralized system
  • Maximum principle
  • Networks
  • Optimal control
  • Security

ASJC Scopus subject areas

  • Control and Systems Engineering

Cite this