Yayınlanmış 1 Ocak 2018
| Sürüm v1
Konferans bildirisi
Açık
Approximate Byzantine Group Consensus in Robust Networks
Oluşturanlar
- 1. Bogazici Univ, Dept Elect & Elect Engn, TR-34342 Istanbul, Turkey
Açıklama
In this paper, a fault tolerant algorithm, so called L-MSR, is proposed for non-faulty nodes to achieve approximate Byzantine consensus on one or more equilibrium points in the presence of unstructured Byzantine (uStrBYZ) agents. For the first time, the notion of approximate Byzantine group consensus is introduced. We first present the topological conditions for non-faulty nodes to achieve approximate Byzantine consensus using the L-MSR algorithm. Then, these results are extended to the case where non-faulty nodes achieve approximate Byzantine group consensus. Finally, we present numerical analysis to illustrate our results.
Dosyalar
bib-ad411b24-232b-460a-bea4-e193280c42ef.txt
Dosyalar
(132 Bytes)
| Ad | Boyut | Hepisini indir |
|---|---|---|
|
md5:1c5b6099cb875c605dd2cc0d7ae65c79
|
132 Bytes | Ön İzleme İndir |