Optimal Strategies for Dynamic Weight Selection in Consensus Protocols in the Presence of an Adversary

Abstract : In this paper, we consider optimal design strategies in consensus protocols for networks vulnerable to adversarial attacks. First we study dynamic (multi-stage) weight selection optimal control for consensus protocols. For the general (multi-stage) case, the solution exists but can rarely be expressed in closed-form. In view of this, we apply optimization techniques to obtain a locally (and possibly globally) optimizing feasible control path. For the one-stage case, however, we obtain a closed-form solution for the optimal control and provide sufficient conditions for the existence of a control that makes the system reach consensus in only one iteration. We then consider a game theoretical model for the problem of a network with an adversary corrupting the control signal with noise. We derive the optimal strategies for both players (the adversary and the network designer) of the resulting game using a saddle point equilibrium (SPE) solution in mixed strategies.
Type de document :
Communication dans un congrès
IEEE 53rd Annual Conference on Decision and Control (CDC 2014), Dec 2014, Los Angeles, United States
Liste complète des métadonnées

https://hal.inria.fr/hal-01095645
Contributeur : Mahmoud El Chamie <>
Soumis le : mardi 16 décembre 2014 - 04:22:31
Dernière modification le : samedi 27 janvier 2018 - 01:31:41

Identifiants

  • HAL Id : hal-01095645, version 1

Collections

Citation

Mahmoud El Chamie, Tamer Başar. Optimal Strategies for Dynamic Weight Selection in Consensus Protocols in the Presence of an Adversary. IEEE 53rd Annual Conference on Decision and Control (CDC 2014), Dec 2014, Los Angeles, United States. 〈hal-01095645〉

Partager

Métriques

Consultations de la notice

100