Further on Pinning Quasi-Synchronization of Switched Directed Networks With Event-Triggered Communication

Sampled-data-based event-triggered (SDET) communication techniques have found extensive applications in the research of synchronization and consensus in directed networks (DNs). However, as the quantity of nodes in a network expands, existing investigations encounter difficulties in obtaining solutions within finite computation times due to computational complexity. For coping with this scenario, a novel event-triggered pinning quasi-synchronization approach is explored in this research for a category of switched directed networks (SDNs) with sampling measurements. By developing a time-dependent Lyapunov–Krasovskii functional (LKF) and implementing a state-dependent switching strategy utilizing sampling measurements, sufficient conditions are formulated to assure that the synchronization errors are ultimately bounded in an exponential fashion. Different from previous relevant findings, the verification of matrix conditions in the derived synchronization criterion no longer depends on the number of nodes in networks, making it more suitable for large-scale SDNs. Ultimately, two simulation examples are incorporated to elucidate the applicability of the newly crafted synchronization methodology.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Automatic Control
Published
2025-03-17
DOI
https://doi.org/10.1109/tac.2025.3552027
Citations
4
Primary Topic
Molecular Communication and Nanonetworks
Type
article
Field-Weighted Citation Impact
2.70
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Further on Pinning Quasi-Synchronization of Switched Directed Networks With Event-Triggered Communication

Hong Sang, Jinde Cao, Chuangxia Huang, Peng Wang et al.
4 citations
IEEE Transactions on Automatic Control
Molecular Communication and Nanonetworks
2.70
article

Further on Pinning Quasi-Synchronization of Switched Directed Networks With Event-Triggered Communication

Hong Sang, Jinde Cao, Chuangxia Huang, Peng Wang, Yi Liu, Chongyi Cui
article en
4 citations

Abstract

Sampled-data-based event-triggered (SDET) communication techniques have found extensive applications in the research of synchronization and consensus in directed networks (DNs). However, as the quantity of nodes in a network expands, existing investigations encounter difficulties in obtaining solutions within finite computation times due to computational complexity. For coping with this scenario, a novel event-triggered pinning quasi-synchronization approach is explored in this research for a category of switched directed networks (SDNs) with sampling measurements. By developing a time-dependent Lyapunov–Krasovskii functional (LKF) and implementing a state-dependent switching strategy utilizing sampling measurements, sufficient conditions are formulated to assure that the synchronization errors are ultimately bounded in an exponential fashion. Different from previous relevant findings, the verification of matrix conditions in the derived synchronization criterion no longer depends on the number of nodes in networks, making it more suitable for large-scale SDNs. Ultimately, two simulation examples are incorporated to elucidate the applicability of the newly crafted synchronization methodology.

IEEE Transactions on Automatic ControlVol. 70(9)
Dalian Maritime University (CN), Changsha University of Science and Technology (CN), Southeast University (CN), Fuzhou University (CN)
Openalex Percentile: Top 11%
Molecular Communication and Nanonetworks
2.70
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.