TL;DR: A distributed observer-type consensus protocol based on relative output measurements is proposed and a new framework is introduced to address in a unified way the consensus of multiagent systems and the synchronization of complex networks.
Abstract: In this paper, we revisit the topic "Consensus of Multiagent Systems and Synchronization Consensus and High Order Consensus of Complex Networks". We also revisit the topic "New Approach to Synchronization Analysis of Linearly Coupled Ordinary Differential Systems". It is revealed that two topics are closely relating to each other. The relationship between them as well as the relationship between consensus, including high order consensus and synchronization is revealed.
TL;DR: In this article, a dynamic PL synchronization (PLS) of a manufacturer adopting public PL services is investigated, and the S-CM operation framework, operation logic, and PLS infrastructure are presented with an industrial case.
Abstract: Cloud manufacturing (CM) and Internet of things (IoT) are interlinked, yet most works only focused on one of them and take the other as a constituent technology unit. This is practically inadequate, especially for a highly service-driven manufacturing execution system which entails systematical CM supports to respond to the real-time dynamics captured from the IoT-enabled execution hierarchy. To deal with the dynamics occurring in production logistics (PL) processes, this paper investigates a dynamic PL synchronization (PLS) of a manufacturer adopting public PL services. Contemporary CM and IoT infrastructures are systematically integrated to enable a smart PLS control mechanism with multi-level dynamic adaptability. The S-CM operation framework, operation logic, and PLS infrastructure are presented with an industrial case, and the effectiveness is also demonstrated and analyzed.
TL;DR: A comprehensive survey of the entire wireless radio frequency chaos-based communication systems, which categorizes different transmission techniques by elaborating on its modulation, receiver type, data rate, complexity, energy efficiency, multiple access scheme, and performance.
Abstract: Since the early 1990s, a large number of chaos-based communication systems have been proposed exploiting the properties of chaotic waveforms. The motivation lies in the significant advantages provided by this class of non-linear signals. For this aim, many communication schemes and applications have been specially designed for chaos-based communication systems where energy, data rate, and synchronization awareness are considered in most designs. Recently, the major focus, however, has been given to the non-coherent chaos-based systems to benefit from the advantages of chaotic signals and non-coherent detection and to avoid the use of chaotic synchronization, which suffers from weak performance in the presence of additive noise. This paper presents a comprehensive survey of the entire wireless radio frequency chaos-based communication systems. First, it outlines the challenges of chaos implementations and synchronization methods, followed by comprehensive literature review and analysis of chaos-based coherent techniques and their applications. In the second part of the survey, we offer a taxonomy of the current literature by focusing on non-coherent detection methods. For each modulation class, this paper categorizes different transmission techniques by elaborating on its modulation, receiver type, data rate, complexity, energy efficiency, multiple access scheme, and performance. In addition, this survey reports on the analysis of tradeoff between different chaos-based communication systems. Finally, several concluding remarks are discussed.
TL;DR: The developed impulsive synchronization method is applied to build a spatiotemporal chaotic cryptosystem that can transmit an encrypted image and verify that the proposed image-encrypting cryptos system has the advantages of large key space and high security against some traditional attacks.
Abstract: This paper presents a new impulsive synchronization criterion of two identical reaction–diffusion neural networks with discrete and unbounded distributed delays. The new criterion is established by applying an impulse-time-dependent Lyapunov functional combined with the use of a new type of integral inequality for treating the reaction–diffusion terms. The impulse-time-dependent feature of the proposed Lyapunov functional can capture more hybrid dynamical behaviors of the impulsive reaction–diffusion neural networks than the conventional impulse-time-independent Lyapunov functions/functionals, while the new integral inequality, which is derived from Wirtinger’s inequality, overcomes the conservatism introduced by the integral inequality used in the previous results. Numerical examples demonstrate the effectiveness of the proposed method. Later, the developed impulsive synchronization method is applied to build a spatiotemporal chaotic cryptosystem that can transmit an encrypted image. The experimental results verify that the proposed image-encrypting cryptosystem has the advantages of large key space and high security against some traditional attacks.
TL;DR: A high-gain observer like-protocol and a cooperative FTC controller are presented, with a synchronization condition to govern the global behavior in undirected/directed graphs, for active fault-tolerant control of nonidentical high-order multi-agent systems.
Abstract: This paper studies the active fault-tolerant control (FTC) problem for nonidentical high-order multi-agent systems, in the presence of actuator faults and network disconnections. The follower agents are enabled to track the output of a leader agent in faulty cases, by performing output feedback actuator fault compensations and distributed accommodations of network disconnections. In view of nonidentical nonlinearities, a high-gain observer like-protocol and a cooperative FTC controller are presented, with a synchronization condition to govern the global behavior in undirected/directed graphs. To distributively achieve the synchronization condition by updating local controller parameters, two broadcast mechanisms are presented on a spanning tree (for undirected graphs) and a cycle containing all nodes (for directed graphs). To ensure the tolerance to disconnections, the proposed broadcast mechanisms are redesigned by adding redundant information flows on spanning trees (for undirected graphs) and cycles containing all nodes (for directed graphs).
TL;DR: It is found that the coupled reaction-diffusion neural networks with state coupling under the given linear feedback pinning controllers can realize synchronization when the coupling strength is very large, which is contrary to the coupled Reaction-Diffusion Neural networks with spatial diffusion coupling.
Abstract: Two types of coupled neural networks with reaction–diffusion terms are considered in this paper In the first one, the nodes are coupled through their states In the second one, the nodes are coupled through the spatial diffusion terms For the former, utilizing Lyapunov functional method and pinning control technique, we obtain some sufficient conditions to guarantee that network can realize synchronization In addition, considering that the theoretical coupling strength required for synchronization may be much larger than the needed value, we propose an adaptive strategy to adjust the coupling strength for achieving a suitable value For the latter, we establish a criterion for synchronization using the designed pinning controllers It is found that the coupled reaction–diffusion neural networks with state coupling under the given linear feedback pinning controllers can realize synchronization when the coupling strength is very large, which is contrary to the coupled reaction–diffusion neural networks with spatial diffusion coupling Moreover, a general criterion for ensuring network synchronization is derived by pinning a small fraction of nodes with adaptive feedback controllers Finally, two examples with numerical simulations are provided to demonstrate the effectiveness of the theoretical results
TL;DR: In this paper, a joint solution for localization and time synchronization is proposed, in which the stratification effect of underwater medium is considered, so that the bias in the range estimates caused by assuming sound waves travel in straight lines in water environments is compensated.
Abstract: Time synchronization and localization are basic services in a sensor network system. Although they often depend on each other, they are usually tackled independently. In this work, we investigate the time synchronization and localization problems in underwater sensor networks, where more challenges are introduced because of the unique characteristics of the water environment. These challenges include long propagation delay and transmission delay, low bandwidth, energy constraint, mobility, etc. We propose a joint solution for localization and time synchronization, in which the stratification effect of underwater medium is considered, so that the bias in the range estimates caused by assuming sound waves travel in straight lines in water environments is compensated. By combining time synchronization and localization, the accuracy of both are improved jointly. Additionally, an advanced tracking algorithm interactive multiple model (IMM) is adopted to improve the accuracy of localization in the mobile case. Furthermore, by combining both services, the number of required exchanged messages is significantly reduced, which saves on energy consumption. Simulation results show that both services are improved and benefit from this scheme.
TL;DR: The proposed results proved that the error system is globally asymptotically stable in the mean square and the criteria which ensure the synchronization between the uncontrolled system and controlled system are established through designed feedback controllers and linear matrix inequalities.
TL;DR: The pinning adaptive synchronization problem is investigated, and a general criterion for ensuring network synchronization is established and a numerical example is provided to illustrate the effectiveness of the proposed criteria.
Abstract: This paper proposes a directed complex dynamical network consisting of ${N}$ linearly and diffusively coupled identical reaction-diffusion neural networks. Based on the Lyapunov functional method and the pinning control technique, some sufficient conditions are obtained to guarantee the synchronization of the proposed network model. In addition, an adaptive strategy is proposed to obtain appropriate coupling strength for achieving network synchronization. Furthermore, the pinning adaptive synchronization problem is also investigated in this paper, and a general criterion for ensuring network synchronization is established. Finally, a numerical example is provided to illustrate the effectiveness of the proposed criteria.
TL;DR: It is shown that a unified controller design framework is derived for the CDN with or without coupling delays, and the asymptotic convergence of synchronization errors is analyzed by combining algebraic graph theory and Lyapunov theory.
Abstract: This paper is concerned with the problem of synchronization control of complex dynamical networks (CDN) subject to nonlinear couplings and uncertainties An fuzzy logical system-based adaptive distributed controller is designed to achieve the synchronization The asymptotic convergence of synchronization errors is analyzed by combining algebraic graph theory and Lyapunov theory In contrast to the existing results, the proposed synchronization control method is applicable for the CDN with system uncertainties and unknown topology Especially, the considered uncertainties are allowed to occur in the node local dynamics as well as in the interconnections of different nodes In addition, it is shown that a unified controller design framework is derived for the CDN with or without coupling delays Finally, simulations on a Chua’s circuit network are provided to validate the effectiveness of the theoretical results
TL;DR: The control law presented in this paper covers both continuous controllers and discontinuous ones, which were studied separately in the past, and is generalized to any network topologies containing a directed spanning tree.
Abstract: This paper is concerned with the finite-time synchronization issue of nonlinear coupled neural networks by designing a new switching pinning controller. For the fixed network topology and control strength, the newly designed controller could optimize the synchronization time by regulating a parameter $\alpha $ ( $0\leq \alpha ). The control law presented in this paper covers both continuous controllers and discontinuous ones, which were studied separately in the past. Some criteria are discussed in detail on how to shorten the synchronization time for the strongly connected networks. Finally, the results are generalized to any network topologies containing a directed spanning tree, and one numerical example is given to demonstrate the effectiveness of the theoretical results.
TL;DR: This paper considers optimal output synchronization of heterogeneous linear multi-agent systems and shows that this optimal distributed approach implicitly solves the output regulation equations without actually doing so.
TL;DR: The problem of exponential stabilization and synchronization for fuzzy model of memristive neural networks (MNNs) is investigated by using periodically intermittent control with novel and useful stabilization criteria and synchronization conditions derived by using Lyapunov functional and differential inequality techniques.
TL;DR: This work proposes a general framework to assess the stability of the synchronized state in networks with multiple interaction layers, deriving a necessary condition that generalizes the master stability function approach and shows that highly rich phenomenology emerges from this.
Abstract: The structure of many real-world systems is best captured by networks consisting of several interaction layers. Understanding how a multilayered structure of connections affects the synchronization properties of dynamical systems evolving on top of it is a highly relevant endeavor in mathematics and physics and has potential applications in several socially relevant topics, such as power grid engineering and neural dynamics. We propose a general framework to assess the stability of the synchronized state in networks with multiple interaction layers, deriving a necessary condition that generalizes the master stability function approach. We validate our method by applying it to a network of Rossler oscillators with a double layer of interactions and show that highly rich phenomenology emerges from this. This includes cases where the stability of synchronization can be induced even if both layers would have individually induced unstable synchrony, an effect genuinely arising from the true multilayer structure of the interactions among the units in the network.
TL;DR: By modeling the switching of network topologies as a Markov process, a novel event-triggered synchronization strategy is proposed and a sufficient condition for the mean square synchronization of the complex networks subject to Markovian switching topologies is established.
TL;DR: Finite-time synchronization for a class of fuzzy cellular neural networks with time-varying delays is investigated based on the finite-time stability theory and some new and useful criteria are derived in terms of p-norm.
TL;DR: An algorithm is obtained to construct the feedback controller that guarantees the synchronization of master and slave BCNs and two biological examples are provided to illustrate the effectiveness of the obtained results.
Abstract: This brief investigates the partial and complete synchronization of two Boolean control networks (BCNs). Necessary and sufficient conditions for partial and complete synchronization are established by the algebraic representations of logical dynamics. An algorithm is obtained to construct the feedback controller that guarantees the synchronization of master and slave BCNs. Two biological examples are provided to illustrate the effectiveness of the obtained results.
TL;DR: By combining the method of backstepping design with the finite-time control technique, a distributed delayed attitude control algorithm is proposed which is the neighbor-based design which can be achieved asymptotically.
Abstract: The attitude synchronization problem for a group of flexible spacecraft is discussed in this note. Meanwhile, the communication delay among these spacecraft is also considered. By combining the method of backstepping design with the finite-time control technique, a distributed delayed attitude control algorithm is proposed which is the neighbor-based design. Under the proposed control algorithm, it is shown that the attitude synchronization can be achieved asymptotically. Finally, an example is given to verify the efficiency of the proposed method.
TL;DR: The standardized protocols and technologies for providing synchronization of devices connected by packet-switched networks are surveyed and a review of synchronization impairments and the state-of-the-art mechanisms to improve the synchronization accuracy are presented.
Abstract: Clock synchronization is a prerequisite for the realization of emerging applications in various domains such as industrial automation and the intelligent power grid. This paper surveys the standardized protocols and technologies for providing synchronization of devices connected by packet-switched networks. A review of synchronization impairments and the state-of-the-art mechanisms to improve the synchronization accuracy is then presented. Providing microsecond to sub-microsecond synchronization accuracy under the presence of asymmetric delays in a cost-effective manner is a challenging problem, and still an open issue in many application scenarios. Further, security is of significant importance for systems where timing is critical. The security threats and solutions to protect exchanged synchronization messages are also discussed.
TL;DR: An event-triggered strategy able to guarantee the existence of a minimum lower bound between inter-event times for broadcasted information and for control signal updating is proposed, thus allowing applications where both the communication bandwidth and the maximum updating frequency of actuators are critical.
TL;DR: A novel distributed regulator for groups of identical and non-identical linear agents based on their transient state components or estimates thereof in the output feedback case to improve the cooperative behavior of the group in transient phases and guarantee a desired decay rate of the synchronization error.
TL;DR: A new event-triggered sampled-data transmission strategy, where only local and event-triggering states are utilized to update the broadcasting state of each agent, is proposed to realize cluster synchronization of the coupled neural networks.
TL;DR: In this paper, the authors propose a live synchronization feature in a data storage management system, which can reduce the downtime that arises in failover situations by using backup data to create and maintain a ready (or "warm") virtualized computing platform comprising one or more virtual machines (VMs) that are configured and ready to be activated and take over data processing from another data processing platform operating in the production environment.
Abstract: An illustrative “Live Synchronization” feature in a data storage management system can reduce the downtime that arises in failover situations. The illustrative Live Sync embodiment uses backup data to create and maintain a ready (or “warm”) virtualized computing platform comprising one or more virtual machines (“VMs”) that are configured and ready to be activated and take over data processing from another data processing platform operating in the production environment. The “warm” computing platform awaits activation as a failover solution for the production system(s) and can be co-located at the production data center, or configured at a remote or disaster recovery site, which in some embodiments is configured “in the cloud.” Both local and remote illustrative embodiments are discussed herein. An “incremental forever” approach can be combined with deduplication and synthetic full backups to speed up data transfer and update the disaster recovery sites.
TL;DR: This work decomposes the plan synthesis problem into finite horizon planning problems that are solved iteratively, upon the run of the agents, and introduces an event-based synchronization that allows the approach to efficiently adapt to different time durations of different agents' discrete steps.
TL;DR: In this article, Burer and Monteiro proposed a heuristic to solve large semidefinite programs by restricting the search space to low-rank matrices, and provided theoretical guarantees shedding light on the remarkable efficiency of this heuristic.
Abstract: To address difficult optimization problems, convex relaxations based on semidefinite programming are now common place in many fields. Although solvable in polynomial time, large semidefinite programs tend to be computationally challenging. Over a decade ago, exploiting the fact that in many applications of interest the desired solutions are low rank, Burer and Monteiro proposed a heuristic to solve such semidefinite programs by restricting the search space to low-rank matrices. The accompanying theory does not explain the extent of the empirical success. We focus on Synchronization and Community Detection problems and provide theoretical guarantees shedding light on the remarkable efficiency of this heuristic.
TL;DR: Based on the stability theory of fractional order systems, synchronization of general fractional-order uncertain complex networks with delay is investigated in this article, by the inequality of the fractional derivative and the comparison principle of the linear fractional equation with delay.
Abstract: Based on the stability theory of fractional-order systems, synchronization of general fractional-order uncertain complex networks with delay is investigated in this paper. By the inequality of the fractional derivative and the comparison principle of the linear fractional equation with delay, synchronization of complex networks with delay is realized under adaptive control. Some sufficient criteria ensuring local asymptotical synchronization under adaptive control and global asymptotical synchronization under adaptive pinning control are derived, respectively. Finally, numerical simulations are presented to demonstrate the validity and feasibility of the proposed synchronization criteria.
TL;DR: In this paper, the authors re-examine the relationship between trade and business cycle synchronization using new value-added trade data for 63 advanced and emerging economies during 1995-2013 and identify a significantly positive impact of bilateral (value-added) trade intensity on business cycle synchrony.
TL;DR: This paper surveys and categorizes the timing and carrier synchronization techniques proposed for the different communication systems focusing on the system model assumptions for synchronization, the synchronization challenges, and the state-of-the-art synchronization solutions and their limitations.
Abstract: Timing and carrier synchronization is a fundamental requirement for any wireless communication system to work properly. Timing synchronization is the process by which a receiver node determines the correct instants of time at which to sample the incoming signal. Carrier synchronization is the process by which a receiver adapts the frequency and phase of its local carrier oscillator with those of the received signal. In this paper, we survey the literature over the last 5 years (2010–2014) and present a comprehensive literature review and classification of the recent research progress in achieving timing and carrier synchronization in single-input single-output (SISO), multiple-input multiple-output (MIMO), cooperative relaying, and multiuser/multicell interference networks. Considering both single-carrier and multi-carrier communication systems, we survey and categorize the timing and carrier synchronization techniques proposed for the different communication systems focusing on the system model assumptions for synchronization, the synchronization challenges, and the state-of-the-art synchronization solutions and their limitations. Finally, we envision some future research directions.
TL;DR: It is theoretically proved that the introduced sliding mode technique has finite-time convergence and stability in both reaching and sliding mode phases and numerical simulation results are shown to verify the effectiveness and applicability of the finite- time synchronization.
Abstract: Based on the synchronization of real-variable chaotic systems, the problem of synchronization between two complex-variable chaotic systems with unknown parameters is investigated via nonsingular terminal sliding mode control in a finite time. On the basic of the adaptive laws and finite-time stability theory, a nonsingular terminal sliding mode control is developed to guarantee the synchronization between two complex-variable chaotic systems in a given finite time. It is theoretically proved that the introduced sliding mode technique has finite-time convergence and stability in both reaching and sliding mode phases. Numerical simulation results are shown to verify the effectiveness and applicability of the finite-time synchronization.
TL;DR: Investigating the performance, in relaxed synchronization scenario, of a new contender waveform making its appearance recently named Weighted Overlap and Add based OFDM shows that WOLA-OFDM could be a promising candidate waveform, outperforming both CP- OFDM and UFMC in any asynchronous scenario.
Abstract: This paper investigates the performance, in relaxed synchronization scenario, of a new contender waveform making its appearance recently named Weighted Overlap and Add based OFDM (WOLA-OFDM). Indeed, its performance will be studied and compared to the classical CP-OFDM and the wellknown UFMC that offers particular benefits for 5G use cases. Results show that WOLA-OFDM could be a promising candidate waveform, outperforming both CP-OFDM and UFMC in any asynchronous scenario.