Robust Distributed Averaging in Networks
From MaRDI portal
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.
This page was built for publication: Robust Distributed Averaging in Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6240214)
