Consensus-Based Clock Synchronization in Wireless Sensor Networks With Truncated Exponential Delays

Robust consensus of multi‐agent systems with multiplicative uncertainties and its application in time synchronization

“…Recently, the study of time synchronization is receiving more and more attention from researchers [28][29][30][31][32] due to the fact that many applications such as data fusion and target tracking in Internet of Things (IoT) and WSNs need a global time synchronization for all nodes, where a typical time synchronization algorithm design strategy is the consensus-based strategy. 32,33 Up to now, based on this strategy, some consensus-based time synchronization (CBTS) algorithms have been proposed, such as Average TimeSynch (ATS) algorithm, 31 WMTS algorithm. 34 The performance of the time synchronization algorithm is heavily affected by the communication delay, under which generally only bounded time synchronization can be achieved (i.e., the bounded time synchronization error can be guaranteed).…”

“…Second, we will use the obtained consensus conclusion to give the convergence analysis of LSTS algorithm in a more general switching network. Recently, the study of time synchronization is receiving more and more attention from researchers 28‐32 due to the fact that many applications such as data fusion and target tracking in Internet of Things (IoT) and WSNs need a global time synchronization for all nodes, where a typical time synchronization algorithm design strategy is the consensus‐based strategy 32,33 . Up to now, based on this strategy, some consensus‐based time synchronization (CBTS) algorithms have been proposed, such as Average TimeSynch (ATS) algorithm, 31 WMTS algorithm 34 .…”

“…Reference 32 shows that compared with LSTS algorithm, most existing CBTS algorithms such as ATS algorithm and WMTS algorithm cannot achieve bounded time synchronization. In addition to LSTS algorithm and its relevant work, some new convergence conclusions or algorithms also have been given 33,35 . For example, Reference 33 gives some CBTS convergence conclusions in the stochastic sense, while they are built under the undirected network together with the truncated exponential delay assumption.…”

Distributed impulsive control for secure consensus of nonlinear dynamical networks with node delay under denial‐of‐service attacks

“…Nonlinear dynamical networks (NDNs) are composed of multiple interconnected nodes, which are described by nonlinear dynamics and the interconnected structure among nodes is often modeled as a graph. Consensus problems of NDNs have attracted a great deal of research interest from a wide range variety of scientific communities disciplines due to its extensive applications in various domains, for example, smart grid [1][2][3], sensor networks [4][5][6], teaming of robots [7,8], distributed optimization [9,10], and block chain [11]. The core challenge of the consensus in NDNs is how to design appropriate controller Abbreviations: ANA, anti-nuclear antibodies; APC, antigen-presenting cells; IRF, interferon regulatory factor.…”

Reaching Consensus with Byzantine Faulty Controllers in Software‐Defined Networks

“…In a distributed system, we can establish the system's fault tolerance capability by solving the consensus problem. Common applications of the consensus protocol include the leader election problem in the P2P network [33], duplicated files storage coordination problem [34], cruise control problem in the car platoon [35], and clock synchronization [36,37]. The requirements of the consensus protocol are shown in…”