A Resilient Convex Combination for consensus-based distributed algorithms
A Resilient Convex Combination for consensus-based distributed algorithms
复制标题
基于共识的分布式算法的弹性凸组合
DOI：
10.3934/naco.2019018
复制
发表时间：
2018
期刊：
影响因子：
--
通讯作者：
S. Sundaram
中科院分区：
文献类型：
--
作者：
Xuan Wang;Shaoshuai Mou;S. Sundaram
考虑$\mathbb{R}^n$中的一组向量，分为两类：正常向量和恶意向量。恶意媒介的数量是有限的，但它们的身份未知。本文提供了一种实现弹性凸组合的方法，它是仅由法矢组成的凸组合。与已有的基于Tverberg点的方法相比，基于凸壳交的方法具有较低的计算复杂度。仿真结果表明，该方法可用于基于共识的分布式算法对拜占庭攻击的抗攻击能力。
Consider a set of vectors in $\mathbb{R}^n$, partitioned into two classes: normal vectors and malicious vectors. The number of malicious vectors is bounded but their identities are unknown. The paper provides a way for achieving a resilient convex combination, which is a convex combination of only normal vectors. Compared with existing approaches based on Tverberg points, the proposed method based on the intersection of convex hulls has lower computational complexity. Simulations suggest that the proposed method can be applied to resilience for consensus-based distributed algorithms against Byzantine attacks.
DOI：
10.1016/j.automatica.2019.06.039
发表时间：
2018-02
期刊：
Autom.
影响因子：
--
作者：
A. Mitra;S. Sundaram
通讯作者：
A. Mitra;S. Sundaram