Resilient Recursive Filter Design for Complex Networks With Event-Triggering Random Access Scheme and Random Coupling Strengths

In this article, a recursive filter (RF) is designed for randomly coupled complex networks (CNs) subject to deception attacks under limited network bandwidth. It is assumed that the coupling strengths between nodes conform to a uniform distribution that is mutually independent. A hybrid scheduling s...

Full description

Saved in:
Bibliographic Details
Published inIEEE systems journal Vol. 18; no. 1; pp. 725 - 736
Main Authors Zha, Lijuan, Miao, Jinzhao, Liu, Jinliang, Xie, Xiangpeng, Tian, Engang
Format Journal Article
LanguageEnglish
Published New York IEEE 01.03.2024
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text
ISSN1932-8184
1937-9234
DOI10.1109/JSYST.2024.3357901

Cover

Abstract In this article, a recursive filter (RF) is designed for randomly coupled complex networks (CNs) subject to deception attacks under limited network bandwidth. It is assumed that the coupling strengths between nodes conform to a uniform distribution that is mutually independent. A hybrid scheduling scheme including the event-triggering scheme and the RA protocol is developed to alleviate the burden of network data transmission. An RF method for each node will be created, which can capably restrict the maximum of filtering errors (FEs) under the random coupling, deception attacks, and hybrid scheduling scheme. The solution to difference equations yields the upper bound of FE covariance. The satisfactory filter parameters are derived by minimizing this upper bound. The verification of mean-square boundedness of FE covariance is confirmed under specific assumptions. Finally, the validity of the proposed RF is evidenced by a simulation example.
AbstractList In this article, a recursive filter (RF) is designed for randomly coupled complex networks (CNs) subject to deception attacks under limited network bandwidth. It is assumed that the coupling strengths between nodes conform to a uniform distribution that is mutually independent. A hybrid scheduling scheme including the event-triggering scheme and the RA protocol is developed to alleviate the burden of network data transmission. An RF method for each node will be created, which can capably restrict the maximum of filtering errors (FEs) under the random coupling, deception attacks, and hybrid scheduling scheme. The solution to difference equations yields the upper bound of FE covariance. The satisfactory filter parameters are derived by minimizing this upper bound. The verification of mean-square boundedness of FE covariance is confirmed under specific assumptions. Finally, the validity of the proposed RF is evidenced by a simulation example.
Author Liu, Jinliang
Tian, Engang
Miao, Jinzhao
Zha, Lijuan
Xie, Xiangpeng
Author_xml – sequence: 1
  givenname: Lijuan
  orcidid: 0000-0003-0475-8866
  surname: Zha
  fullname: Zha, Lijuan
  email: zhalijuan@vip.163.com
  organization: College of Science, Nanjing Forestry University, Nanjing, China
– sequence: 2
  givenname: Jinzhao
  orcidid: 0009-0007-6320-5360
  surname: Miao
  fullname: Miao, Jinzhao
  email: 17766104116@163.com
  organization: College of Information Engineering, Nanjing University of Finance and Economics, Nanjing, China
– sequence: 3
  givenname: Jinliang
  orcidid: 0000-0001-5489-0246
  surname: Liu
  fullname: Liu, Jinliang
  email: liujinliang@vip.163.com
  organization: School of Computer Science, Nanjing University of Information Science and Technology, Nanjing, China
– sequence: 4
  givenname: Xiangpeng
  orcidid: 0000-0003-4822-3134
  surname: Xie
  fullname: Xie, Xiangpeng
  email: xiexiangpeng1953@163.com
  organization: Institute of Advanced Technology, Nanjing University of Posts and Telecommunications, Nanjing, China
– sequence: 5
  givenname: Engang
  orcidid: 0000-0002-8169-5347
  surname: Tian
  fullname: Tian, Engang
  email: tianengang@163.com
  organization: School of Optical-Electrical and Computer Engineering, University of Shanghai for Science and Technology, Shanghai, China
BookMark eNp9kE1LAzEQhoMoaNU_IB4Cnrfmq93NUWrrB6LQFsTTErOz2-g2qUla9eRfN7UK4sHTDDPvM-_wdtC2dRYQOqKkSymRp9eTh8m0ywgTXc57uSR0C-1RyfNMMi62v3qWFbQQu6gTwhMhvSLJ9tDHGIJpDdiIx6CXPpgV4JFpI3h8nlaNxbXzeODmixbe8C3EV-efA743cYaHq8RlU2-aBryxDR4rW7k5PtMaQsATPYM54DT7WQzcctGuhZPowTZxFg7QTq3aAIffdR9NR8Pp4DK7ubu4GpzdZJrJfsx6SlJS5SSvWK56VVHnnImakgIeeSVZLqHSj1XFFCRrnXMgUlKh-6wv-1Arvo9ONmcX3r0sIcTyyS29TY5lui-JEIwXSVVsVNq7EDzUpTZRReNs9Mq0JSXlOu3yK-1ynXb5nXZC2R904c1c-ff_oeMNZADgF5CeEUzwT9f_kCI
CODEN ISJEB2
CitedBy_id crossref_primary_10_1109_TCSI_2024_3424512
crossref_primary_10_1016_j_jfranklin_2024_107460
crossref_primary_10_1109_TNSE_2024_3422281
crossref_primary_10_1049_cth2_12688
Cites_doi 10.1109/TCYB.2021.3049461
10.1109/tase.2023.3300917
10.1109/TNNLS.2021.3105409
10.1109/TCSI.2020.3036626
10.1109/TSMC.2021.3049306
10.1109/9.754809
10.1109/TNNLS.2019.2953649
10.1109/TCYB.2021.3067822
10.1109/TFUZZ.2023.3269786
10.1109/JSYST.2020.2984797
10.1109/TNNLS.2019.2951948
10.1109/TCNS.2022.3233925
10.1109/TAC.2018.2833154
10.1109/TSMC.2022.3224432
10.1016/j.automatica.2022.110525
10.1109/TNNLS.2017.2700331
10.1109/TNNLS.2021.3137426
10.1109/JSYST.2021.3123617
10.1016/j.automatica.2015.11.008
10.1109/TCNS.2023.3256299
10.1109/TSMC.2017.2688581
10.1109/JSYST.2019.2935352
10.1109/TNSE.2022.3173310
10.1109/TNNLS.2020.3027252
10.1002/rnc.6551
10.1109/TNNLS.2019.2927554
10.1109/TNSE.2022.3164833
10.1109/TNNLS.2017.2726158
10.1109/TNNLS.2018.2817627
10.1016/j.neucom.2016.08.095
10.1109/TNNLS.2019.2946290
10.1109/JSYST.2021.3110501
10.1109/TCNS.2021.3089146
10.1109/TCSII.2017.2767859
10.1109/TCYB.2021.3125851
10.1109/TCYB.2022.3163452
10.1109/TCYB.2020.3004288
10.1109/TSMC.2019.2918002
10.1109/TNNLS.2018.2839020
10.1109/TNNLS.2019.2952249
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2024
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2024
DBID 97E
RIA
RIE
AAYXX
CITATION
DOI 10.1109/JSYST.2024.3357901
DatabaseName IEEE All-Society Periodicals Package (ASPP) 2005–Present
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Electronic Library (IEL)
CrossRef
DatabaseTitle CrossRef
DatabaseTitleList

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 1937-9234
EndPage 736
ExternalDocumentID 10_1109_JSYST_2024_3357901
10423424
Genre orig-research
GrantInformation_xml – fundername: Natural Science Foundation of Jiangsu Province of China
  grantid: BK20230063; BK20211290
– fundername: Qinglan Project of Jiangsu Province of China; Qing Lan Project
  funderid: 10.13039/501100013088
– fundername: National Natural Science Foundation of China
  grantid: 62273174; 62373252
  funderid: 10.13039/501100001809
GroupedDBID 0R~
29I
4.4
5GY
5VS
6IK
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABQJQ
ABVLG
ACIWK
AENEX
AETIX
AGQYO
AGSQL
AHBIQ
AKJIK
AKQYR
ALMA_UNASSIGNED_HOLDINGS
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CS3
DU5
EBS
EJD
HZ~
IFIPE
IPLJI
JAVBF
LAI
M43
O9-
OCL
RIA
RIE
RNS
AAYXX
CITATION
RIG
ID FETCH-LOGICAL-c296t-5a910d707d27a5d8f7324f108eb3d9279edcbdd2aeccec73e09914c62696efa3
IEDL.DBID RIE
ISSN 1932-8184
IngestDate Mon Jun 30 08:42:40 EDT 2025
Tue Jul 01 01:43:42 EDT 2025
Thu Apr 24 23:07:50 EDT 2025
Wed Aug 27 02:59:25 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 1
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-c296t-5a910d707d27a5d8f7324f108eb3d9279edcbdd2aeccec73e09914c62696efa3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0001-5489-0246
0000-0003-0475-8866
0000-0002-8169-5347
0000-0003-4822-3134
0009-0007-6320-5360
PQID 2969044238
PQPubID 85494
PageCount 12
ParticipantIDs crossref_citationtrail_10_1109_JSYST_2024_3357901
crossref_primary_10_1109_JSYST_2024_3357901
proquest_journals_2969044238
ieee_primary_10423424
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2024-March
2024-3-00
20240301
PublicationDateYYYYMMDD 2024-03-01
PublicationDate_xml – month: 03
  year: 2024
  text: 2024-March
PublicationDecade 2020
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle IEEE systems journal
PublicationTitleAbbrev JSYST
PublicationYear 2024
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
ref32
ref2
ref1
ref17
ref39
ref16
ref38
ref19
ref18
ref24
ref23
ref26
ref25
ref20
ref22
ref21
ref28
ref27
ref29
ref8
ref7
ref9
ref4
ref3
ref6
ref5
ref40
References_xml – ident: ref8
  doi: 10.1109/TCYB.2021.3049461
– ident: ref31
  doi: 10.1109/tase.2023.3300917
– ident: ref13
  doi: 10.1109/TNNLS.2021.3105409
– ident: ref39
  doi: 10.1109/TCSI.2020.3036626
– ident: ref27
  doi: 10.1109/TSMC.2021.3049306
– ident: ref35
  doi: 10.1109/9.754809
– ident: ref9
  doi: 10.1109/TNNLS.2019.2953649
– ident: ref4
  doi: 10.1109/TCYB.2021.3067822
– ident: ref28
  doi: 10.1109/TFUZZ.2023.3269786
– ident: ref17
  doi: 10.1109/JSYST.2020.2984797
– ident: ref5
  doi: 10.1109/TNNLS.2019.2951948
– ident: ref15
  doi: 10.1109/TCNS.2022.3233925
– ident: ref23
  doi: 10.1109/TAC.2018.2833154
– ident: ref30
  doi: 10.1109/TSMC.2022.3224432
– ident: ref33
  doi: 10.1016/j.automatica.2022.110525
– ident: ref34
  doi: 10.1109/TNNLS.2017.2700331
– ident: ref20
  doi: 10.1109/TNNLS.2021.3137426
– ident: ref16
  doi: 10.1109/JSYST.2021.3123617
– ident: ref37
  doi: 10.1016/j.automatica.2015.11.008
– ident: ref25
  doi: 10.1109/TCNS.2023.3256299
– ident: ref40
  doi: 10.1109/TSMC.2017.2688581
– ident: ref18
  doi: 10.1109/JSYST.2019.2935352
– ident: ref19
  doi: 10.1109/TNSE.2022.3173310
– ident: ref22
  doi: 10.1109/TNNLS.2020.3027252
– ident: ref12
  doi: 10.1002/rnc.6551
– ident: ref36
  doi: 10.1109/TNNLS.2019.2927554
– ident: ref6
  doi: 10.1109/TNSE.2022.3164833
– ident: ref2
  doi: 10.1109/TNNLS.2017.2726158
– ident: ref1
  doi: 10.1109/TNNLS.2018.2817627
– ident: ref38
  doi: 10.1016/j.neucom.2016.08.095
– ident: ref7
  doi: 10.1109/TNNLS.2019.2946290
– ident: ref14
  doi: 10.1109/JSYST.2021.3110501
– ident: ref21
  doi: 10.1109/TCNS.2021.3089146
– ident: ref3
  doi: 10.1109/TCSII.2017.2767859
– ident: ref29
  doi: 10.1109/TCYB.2021.3125851
– ident: ref32
  doi: 10.1109/TCYB.2022.3163452
– ident: ref11
  doi: 10.1109/TCYB.2020.3004288
– ident: ref24
  doi: 10.1109/TSMC.2019.2918002
– ident: ref26
  doi: 10.1109/TNNLS.2018.2839020
– ident: ref10
  doi: 10.1109/TNNLS.2019.2952249
SSID ssj0058579
Score 2.363702
Snippet In this article, a recursive filter (RF) is designed for randomly coupled complex networks (CNs) subject to deception attacks under limited network bandwidth....
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 725
SubjectTerms Bandwidth
Complex networks
Complex networks (CNs)
Coupling
Couplings
Covariance
Data transmission
deception attacks
Difference equations
Event detection
event-triggered control
Filter design (mathematics)
IIR filters
Measurement uncertainty
Protocols
Radio frequency
Random access
random access (RA) protocol
Random access memory
recursive filter (RF)
Scheduling
Security
Upper bounds
Title Resilient Recursive Filter Design for Complex Networks With Event-Triggering Random Access Scheme and Random Coupling Strengths
URI https://ieeexplore.ieee.org/document/10423424
https://www.proquest.com/docview/2969044238
Volume 18
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3NS8MwFA-6kx78FqdTcvAmrVmbNulxzI0huMNWUU8lTdI53DpxHYgX_3Vf0lZEUYQeSvsSEt5L3u8l7wOhcxm0BTwSljgRDuhb4qQp5Q4XVErAC0xyE418MwwHt_T6PrivgtVtLIzW2jqfade82rt8tZArc1QGKxyUP_XoOloHOSuDteptF2CvTaxnAIkDWojWETIkurweP4xjsAU96vo-kFUVYGotZMuq_NiLrYLpb6NhPbTSr-TJXRWpK9--ZW3899h30FYFNXGnlI1dtKbzPbT5JQHhPnof6eV0ZkIi8cgcvBtfdtyfmht0fGV9OzCAWmw2jZl-xcPSZ3yJ76bFI-4ZV0knBvN-YrvDI5GrxRx3bA1GPAZxmGsM3-of3cXKxP9OsLkKzyfF4_IAxf1e3B04VUkGR3pRWDiBAHihGGHKYyJQPGMAyLI24WCTq8hjkVYyVcoTIBlaMl8DAG1TCVZTFOpM-IeokS9yfYQw4wFPfUYCKX2qM8pDJYnIwiBjTKk0aqJ2zaFEVunKTdWMWWLNFhIllquJ4WpScbWJLj7bPJfJOv6kPjBs-kJZcqiJWrUkJNWCXiYw-4hQIODHvzQ7QRum99I_rYUaxctKnwJgKdIzK6gfNXXogA
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1LT-MwEB7xOMAeeC2ILi8fuKF03cSJnSMCqvLqoc1q2VPk2E6pKOlqm0qIC3-dsZMgtGhXSDlEyTh2NGPPN_Y8AI5V2JF4KZziVHqob6mXZUx4QjKlEC9wJWw08m0_6v1gV3fhXR2s7mJhjDHO-cy07a07y9dTNbdbZTjDUfkzny3CMip-FlbhWs3Ci8DXpdazkMRDPcSaGBkaf78a_homaA36rB0ESFbXgGn0kCus8mE1diqmuw79ZnCVZ8lDe15mbfX8V97GT49-A9ZqsElOK-nYhAVTbMGXdykIv8LLwMzGExsUSQZ26916s5Pu2J6hk3Pn3UEQ1hK7bEzME-lXXuMz8nNc3pML6yzpJWjgj9znyEAWevpITl0VRjJEgXg0BJ81L86mcxsBPCL2MLwYlfezbUi6F8lZz6uLMnjKj6PSCyUCDM0p1z6XoRY5R0iWd6hAq1zHPo-NVpnWvkTZMIoHBiFohym0m-LI5DLYgaViWphdIFyEIgs4DZUKmMmZiLSiMo_CnHOts7gFnYZDqaoTltu6GZPUGS40Th1XU8vVtOZqC07e2vyu0nX8l3rbsukdZcWhFuw3kpDWU3qW4t_HlCGB-PaPZkew0ktub9Kby_71HqzanipvtX1YKv_MzQHClzI7dEL7CoVR680
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=Resilient+Recursive+Filter+Design+for+Complex+Networks+With+Event-Triggering+Random+Access+Scheme+and+Random+Coupling+Strengths&rft.jtitle=IEEE+systems+journal&rft.au=Zha%2C+Lijuan&rft.au=Miao%2C+Jinzhao&rft.au=Liu%2C+Jinliang&rft.au=Xie%2C+Xiangpeng&rft.date=2024-03-01&rft.issn=1932-8184&rft.eissn=1937-9234&rft.volume=18&rft.issue=1&rft.spage=725&rft.epage=736&rft_id=info:doi/10.1109%2FJSYST.2024.3357901&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_JSYST_2024_3357901
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1932-8184&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1932-8184&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1932-8184&client=summon