Event-Triggered Approximate Byzantine Consensus With Multi-Hop Communication

In this article, we consider a resilient consensus problem for the multi-agent network where some of the agents are subject to Byzantine attacks and may transmit erroneous state values to their neighbors. In particular, we develop two event-triggered update schemes to tackle this problem as well as...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on signal processing Vol. 71; pp. 1742 - 1754
Main Authors Yuan, Liwei, Ishii, Hideaki
Format Journal Article
LanguageEnglish
Published New York IEEE 2023
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Algorithms
byzantine attack
Communication
Delays
distributed algorithms
event-triggered updates
multi-hop communication
Multiagent systems
Protocols
Relaying
Relays
Resilience
Resilient consensus
Robustness
Signal processing algorithms
Spread spectrum communication
Online AccessGet full text
ISSN1053-587X
1941-0476
DOI10.1109/TSP.2023.3266975

Cover

Abstract In this article, we consider a resilient consensus problem for the multi-agent network where some of the agents are subject to Byzantine attacks and may transmit erroneous state values to their neighbors. In particular, we develop two event-triggered update schemes to tackle this problem as well as reduce the communication for each agent. Our approach is based on the mean subsequence reduced (MSR) algorithm with agents being capable to communicate with multi-hop neighbors through relaying process. Since communication delays are critical in such an environment, we provide necessary graph conditions for the proposed algorithms to perform well with delays in the communication. Moreover, a novel multi-hop relay scheme with event-triggered feature is proposed. It can reduce more transmissions than the conventional one-hop event-triggered algorithm. We also highlight that through multi-hop communication, the network connectivity can be reduced especially in comparison with the common one-hop communication case. Lastly, we show the effectiveness of the proposed algorithms by numerical examples.
AbstractList In this article, we consider a resilient consensus problem for the multi-agent network where some of the agents are subject to Byzantine attacks and may transmit erroneous state values to their neighbors. In particular, we develop two event-triggered update schemes to tackle this problem as well as reduce the communication for each agent. Our approach is based on the mean subsequence reduced (MSR) algorithm with agents being capable to communicate with multi-hop neighbors through relaying process. Since communication delays are critical in such an environment, we provide necessary graph conditions for the proposed algorithms to perform well with delays in the communication. Moreover, a novel multi-hop relay scheme with event-triggered feature is proposed. It can reduce more transmissions than the conventional one-hop event-triggered algorithm. We also highlight that through multi-hop communication, the network connectivity can be reduced especially in comparison with the common one-hop communication case. Lastly, we show the effectiveness of the proposed algorithms by numerical examples.
Author Ishii, Hideaki
Yuan, Liwei
Author_xml – sequence: 1
  givenname: Liwei
  orcidid: 0000-0002-4532-3685
  surname: Yuan
  fullname: Yuan, Liwei
  email: yuanliwei@hnu.edu.cn
  organization: College of Electrical and Information Engineering, Hunan University, Changsha, China
– sequence: 2
  givenname: Hideaki
  orcidid: 0000-0003-0367-824X
  surname: Ishii
  fullname: Ishii, Hideaki
  email: ishii@c.titech.ac.jp
  organization: Department of Computer Science, Tokyo Institute of Technology, Yokohama, Japan
BookMark eNp9kDFPwzAQhS1UJNrCzsAQiTnFThwnHktVKFIRSBTBFjnOubhqnWA7iPLrcWkHxMB0J9377u69AeqZxgBC5wSPCMH8avH0OEpwko7ShDGeZ0eoTzglMaY564UeZ2mcFfnrCRo4t8KYUMpZH82nH2B8vLB6uQQLdTRuW9t86o3wEF1vv4Tx2kA0aYwD4zoXvWj_Ft13a6_jWdOGwWbTGS2F1405RcdKrB2cHeoQPd9MF5NZPH-4vZuM57FMeOJjLkAxLDKucgaMVEApISSXVZELxTOqFJYMVF0XilUpkxjjqq7zjFUZkxKLdIgu93vDq-8dOF-ums6acLJMiuCaM07zoMJ7lbSNcxZU2drgy25LgstdZmXIrNxlVh4yCwj7g0jtf6x5K_T6P_BiD2oA-HWH4CThPP0Gvwt8mQ
CODEN ITPRED
CitedBy_id crossref_primary_10_1109_TAC_2024_3426387
crossref_primary_10_1109_LCSYS_2024_3457851
crossref_primary_10_1109_TCSI_2024_3381191
crossref_primary_10_1109_LCSYS_2023_3291724
crossref_primary_10_1109_TNSE_2023_3342165
crossref_primary_10_1109_TCYB_2024_3430324
Cites_doi 10.1109/TSIPN.2017.2742859
10.23919/ACC53348.2022.9867187
10.1109/TAC.2011.2174666
10.1109/TSP.2020.3044843
10.1016/j.automatica.2021.109775
10.1145/2332432.2332505
10.1109/CDC51059.2022.9993067
10.1109/MSP.2013.2262116
10.1109/TSP.2012.2236832
10.1109/TSP.2017.2788420
10.1109/TSP.2013.2286102
10.1016/j.ic.2016.12.003
10.1109/TSP.2020.2993643
10.1109/TAC.2014.2372932
10.1109/TSP.2019.2931171
10.1109/TCNS.2020.3016839
10.1109/MSP.2018.2842097
10.1109/TCNS.2019.2924235
10.1002/rnc.5815
10.1016/j.nahs.2021.101091
10.1109/JSAC.2013.130413
10.1109/TSP.2008.2007335
10.1016/0196-6774(82)90004-9
10.1109/TSP.2010.2091277
10.1017/CBO9780511841224
10.1016/j.automatica.2016.01.027
10.1145/3382734.3405724
10.1109/TCNS.2017.2732169
10.1109/TSP.2021.3075147
10.1109/CDC45484.2021.9683181
10.1109/TSP.2015.2450191
10.1109/TAC.2008.929381
10.1109/CDC.2012.6425820
10.1109/TSP.2013.2264056
10.1109/TSP.2009.2036046
10.1016/j.automatica.2017.03.008
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2023
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2023
DBID 97E
RIA
RIE
AAYXX
CITATION
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
DOI 10.1109/TSP.2023.3266975
DatabaseName IEEE All-Society Periodicals Package (ASPP) 2005–Present
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Electronic Library (IEL)
CrossRef
Computer and Information Systems Abstracts
Electronics & Communications Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Technology Research Database
Computer and Information Systems Abstracts – Academic
Electronics & Communications Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
DatabaseTitleList
Technology Research Database
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1941-0476
EndPage 1754
ExternalDocumentID 10_1109_TSP_2023_3266975
10102299
Genre orig-research
GrantInformation_xml – fundername: China Scholarship Council
  funderid: 10.13039/501100004543
– fundername: JSPS Grants-in-Aid for Scientific Research
  grantid: 18H01460; 22H01508
GroupedDBID -~X
.DC
0R~
29I
3EH
4.4
53G
5GY
5VS
6IK
85S
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABFSI
ABQJQ
ABVLG
ACGFO
ACIWK
ACKIV
ACNCT
AENEX
AETIX
AGQYO
AGSQL
AHBIQ
AI.
AIBXA
AJQPL
AKJIK
AKQYR
ALLEH
ALMA_UNASSIGNED_HOLDINGS
ASUFR
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CS3
E.L
EBS
EJD
F5P
HZ~
H~9
ICLAB
IFIPE
IFJZH
IPLJI
JAVBF
LAI
MS~
O9-
OCL
P2P
RIA
RIE
RNS
TAE
TN5
VH1
AAYOK
AAYXX
CITATION
RIG
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c292t-9aef60a59f76e61be441117cb87af954ff0c6efdd8f6b36c000bdd756b56cc0a3
IEDL.DBID RIE
ISSN 1053-587X
IngestDate Mon Jun 30 08:23:36 EDT 2025
Tue Jul 01 02:53:27 EDT 2025
Thu Apr 24 23:11:11 EDT 2025
Wed Aug 27 02:18:07 EDT 2025
IsPeerReviewed true
IsScholarly true
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
https://doi.org/10.15223/policy-029
https://doi.org/10.15223/policy-037
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c292t-9aef60a59f76e61be441117cb87af954ff0c6efdd8f6b36c000bdd756b56cc0a3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0003-0367-824X
0000-0002-4532-3685
PQID 2819496947
PQPubID 85478
PageCount 13
ParticipantIDs ieee_primary_10102299
proquest_journals_2819496947
crossref_primary_10_1109_TSP_2023_3266975
crossref_citationtrail_10_1109_TSP_2023_3266975
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 20230000
2023-00-00
20230101
PublicationDateYYYYMMDD 2023-01-01
PublicationDate_xml – year: 2023
  text: 20230000
PublicationDecade 2020
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle IEEE transactions on signal processing
PublicationTitleAbbrev TSP
PublicationYear 2023
Publisher IEEE
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml – name: IEEE
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References ref13
ref35
ref12
ref34
ref15
ref37
ref14
ref36
ref31
ref30
ref11
ref33
ref10
ref2
ref17
ref39
ref16
ref38
ref19
ref18
chen (ref32) 0
ref24
ref23
ref26
ref25
ref20
ref22
lynch (ref1) 1996
ref28
ref27
ref29
ref8
ref7
azadmanesh (ref21) 2002; 5
ref9
ref4
ref3
ref6
ref5
References_xml – ident: ref28
  doi: 10.1109/TSIPN.2017.2742859
– start-page: 5055
  year: 0
  ident: ref32
  article-title: LAG: Lazily aggregated gradient for communication-efficient distributed learning
  publication-title: Proc Adv Neural Inf Process Syst
– ident: ref29
  doi: 10.23919/ACC53348.2022.9867187
– ident: ref33
  doi: 10.1109/TAC.2011.2174666
– ident: ref31
  doi: 10.1109/TSP.2020.3044843
– ident: ref27
  doi: 10.1016/j.automatica.2021.109775
– ident: ref11
  doi: 10.1145/2332432.2332505
– ident: ref37
  doi: 10.1109/CDC51059.2022.9993067
– ident: ref16
  doi: 10.1109/MSP.2013.2262116
– ident: ref25
  doi: 10.1109/TSP.2012.2236832
– ident: ref18
  doi: 10.1109/TSP.2017.2788420
– ident: ref8
  doi: 10.1109/TSP.2013.2286102
– ident: ref4
  doi: 10.1016/j.ic.2016.12.003
– ident: ref13
  doi: 10.1109/TSP.2020.2993643
– ident: ref34
  doi: 10.1109/TAC.2014.2372932
– ident: ref7
  doi: 10.1109/TSP.2019.2931171
– ident: ref5
  doi: 10.1109/TCNS.2020.3016839
– ident: ref2
  doi: 10.1109/MSP.2018.2842097
– ident: ref36
  doi: 10.1109/TCNS.2019.2924235
– ident: ref35
  doi: 10.1002/rnc.5815
– ident: ref38
  doi: 10.1016/j.nahs.2021.101091
– ident: ref3
  doi: 10.1109/JSAC.2013.130413
– ident: ref17
  doi: 10.1109/TSP.2008.2007335
– ident: ref14
  doi: 10.1016/0196-6774(82)90004-9
– year: 1996
  ident: ref1
  publication-title: Distributed Algorithms
– ident: ref20
  doi: 10.1109/TSP.2010.2091277
– ident: ref24
  doi: 10.1017/CBO9780511841224
– ident: ref26
  doi: 10.1016/j.automatica.2016.01.027
– ident: ref22
  doi: 10.1145/3382734.3405724
– ident: ref6
  doi: 10.1109/TCNS.2017.2732169
– ident: ref19
  doi: 10.1109/TSP.2021.3075147
– ident: ref23
  doi: 10.1109/CDC45484.2021.9683181
– ident: ref15
  doi: 10.1109/TSP.2015.2450191
– ident: ref39
  doi: 10.1109/TAC.2008.929381
– ident: ref30
  doi: 10.1109/CDC.2012.6425820
– ident: ref10
  doi: 10.1109/TSP.2013.2264056
– volume: 5
  start-page: 26
  year: 2002
  ident: ref21
  article-title: Asynchronous approximate agreement in partially connected networks
  publication-title: Int J Parallel Distrib Syst Networks
– ident: ref9
  doi: 10.1109/TSP.2009.2036046
– ident: ref12
  doi: 10.1016/j.automatica.2017.03.008
SSID ssj0014496
Score 2.4981241
Snippet In this article, we consider a resilient consensus problem for the multi-agent network where some of the agents are subject to Byzantine attacks and may...
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 1742
SubjectTerms Algorithms
byzantine attack
Communication
Delays
distributed algorithms
event-triggered updates
multi-hop communication
Multiagent systems
Protocols
Relaying
Relays
Resilience
Resilient consensus
Robustness
Signal processing algorithms
Spread spectrum communication
Title Event-Triggered Approximate Byzantine Consensus With Multi-Hop Communication
URI https://ieeexplore.ieee.org/document/10102299
https://www.proquest.com/docview/2819496947
Volume 71
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1LS8QwEA7qSQ--xfVFD148tPaRR3NUURYREVxxb6VJJyrK7qJdUH-9M2lXVkXx1kOShswjM5nHx9i-U4kxaHag9ktViJIIYZ4mWSjiTPDMJJQPRdkWl7J7w8_7ot8Wq_taGADwyWcQ0aeP5VdDO6anMpRw8k-0nmWzyGdNsdZnyIBzD8aF9gL-KVf9SUwy1oe966uIYMIjtFWkppTCqTvIg6r80MT-ejlbYpeTjTVZJY_RuDaRff_Ws_HfO19mi62hGRw1nLHCZmCwyham2g-usYtTSnYMe-ig3xFkZ3BEDcZfH9CIheD47b0kFAkICNOTADFegtuH-j7wJbthdzgKvhSXrLObs9PeSTds0RVCm-q0DnUJTsal0E5JkIkBNIySRFmTq9JpwZ2LrQRXVbmTJpMWdaepKiWkEdLauMw22NxgOIBNFsSp4zgbjBKGA7lkKOkWNQHnTugcOuxwct6FbVuPEwLGU-FdkFgXSKGCKFS0FOqwg88Zo6btxh9j1-nAp8Y1Z91hOxOaFq1gvhQUN0RG0Vxt_TJtm83T6s0zyw6bq5_HsIuGR232PMN9AJan0sQ
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1Lb9QwEB5Be4Ae2gKt2D4gBy4ckubhR3wsqNUCywqJrdhbFDtjqIp2qzYrQX99Z5xstRQVccvBli2PZ_xN5vEBvPE6s5ZgB1m_XMekiRiXeVbEMi2kKGzG-VCcbTFWwzPxcSqnfbF6qIVBxJB8hgl_hlh-M3cL_lVGGs7-iTGPYV2SW1F25Vp3QQMhAh0XIQZaq9TTZVQyNUeTr18SJgpPCK0ow0mFK69QoFX5yxaHB-Z0C8bLrXV5JRfJorWJu7nXtfG_974Nmz3UjI67u_EMHuHsOWysNCB8AaMTTneMJ-Sif2fSzuiYW4z_OicYi9G73zc180hgxKyeTIlxHX07b39EoWg3Hs4voz_KS3bg7PRk8n4Y9_wKsctN3samRq_SWhqvFarMIkGjLNPOlrr2RgrvU6fQN03plS2UI-tpm0ZLZaVyLq2LXVibzWf4EqI094Jmo9XSCmSnjHTdkS0QwktT4gCOluddub75OHNg_KyCE5KaiiRUsYSqXkIDeHs347JrvPGPsTt84CvjurMewMFSplWvmtcVRw7pohih9x6Y9hqeDCefR9Xow_jTPjzllbqfLgew1l4t8JBgSGtfhct3C9jA1hc
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Event-Triggered+Approximate+Byzantine+Consensus+With+Multi-Hop+Communication&rft.jtitle=IEEE+transactions+on+signal+processing&rft.au=Yuan%2C+Liwei&rft.au=Ishii%2C+Hideaki&rft.date=2023&rft.pub=IEEE&rft.issn=1053-587X&rft.volume=71&rft.spage=1742&rft.epage=1754&rft_id=info:doi/10.1109%2FTSP.2023.3266975&rft.externalDocID=10102299
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1053-587X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1053-587X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1053-587X&client=summon