Asynchronous approximate Byzantine consensus: A multi-hop relay method and tight graph conditions

We study a multi-agent resilient consensus problem, where some agents are of the Byzantine type and try to prevent the normal ones from reaching consensus. In our setting, normal agents communicate with each other asynchronously over multi-hop relay channels with delays. To solve this asynchronous B...

Celý popis

Podrobná bibliografia

Vydané v:	Automatica (Oxford) Ročník 171; s. 111908
Hlavní autori:	Yuan, Liwei, Ishii, Hideaki
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Ltd 01.01.2025
Predmet:	Asynchronous distributed algorithms Byzantine consensus Cyber-security Multi-hop communication Byzantine consensus Cyber-security Asynchronous distributed algorithms Multi-hop communication
ISSN:	0005-1098
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!