- About this Journal ·
- Abstracting and Indexing ·
- Advance Access ·
- Aims and Scope ·
- Annual Issues ·
- Article Processing Charges ·
- Articles in Press ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents

Journal of Applied Mathematics

Volume 2013 (2013), Article ID 367457, 16 pages

http://dx.doi.org/10.1155/2013/367457

## Delay-Dependent Synchronization for Complex Dynamical Networks with Interval Time-Varying and Switched Coupling Delays

^{1}Department of Mathematics, Faculty of Science, Srinakharinwirot University, Bangkok 10110, Thailand^{2}Center of Excellence in Mathematics CHE, Si Ayutthaya Road, Bangkok 10400, Thailand^{3}Department of Mathematics, Faculty of Science, Chiang Mai University, Chiang Mai 50200, Thailand^{4}Materials Science Research Center, Faculty of Science, Chiang Mai University, Chiang Mai 50200, Thailand

Received 29 December 2012; Accepted 31 January 2013

Academic Editor: Xinzhi Liu

Copyright © 2013 T. Botmart and P. Niamsup. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

We investigate the local exponential synchronization for complex dynamical networks with interval time-varying delays in the dynamical nodes and the switched coupling term simultaneously. The constraint on the derivative of the time-varying delay is not required which allows the time delay to be a fast time-varying function. By using common unitary matrix for different subnetworks, the problem of synchronization is transformed into the stability analysis of some linear switched delay systems. Then, when subnetworks are synchronizable and nonsynchronizable, a delay-dependent sufficient condition is derived and formulated in the form of linear matrix inequalities (LMIs) by average dwell time approach and piecewise Lyapunov-Krasovskii functionals which are constructed based on the descriptor model of the system and the method of decomposition. The new stability condition is less conservative and is more general than some existing results. A numerical example is also given to illustrate the effectiveness of the proposed method.

#### 1. Introduction

Complex dynamical network, as an interesting subject, has been thoroughly investigated for decades. These networks show very complicated behavior and can be used to model and explain many complex systems in nature such as computer networks [1], the World Wide Web [2], food webs [3], cellular and metabolic networks [4], social networks [5], and electrical power grids [6]. In general, a complex network is a large set of interconnected nodes, in which a node is a fundamental unit with specific contents. As an implicit assumption, these networks are described by the mathematical term *graph*. In such graphs, each vertex represents an individual element in the system, while edges represent the relationship between them. Two nodes are joined by an edge if and only if they interact.

In the last decade, the synchronization of complex dynamical networks has attracted much attention by several researchers in this field [7–12]. Synchronization of complex dynamical networks is one of the most important dynamical mechanisms for creating order in complex dynamical networks. Wang and Chen introduced a uniform dynamical network model and also investigated its synchronization [10, 11, 13]. They have shown that the synchronizability of a scale-free dynamical network is robust against random removal of nodes and yet is fragile to specific removal of the most highly connected nodes [11]. Li and Chen [7] considered the synchronization of complex dynamical network models with coupling delays (continuous and discrete-time) and derived delay-independent and delay-dependent synchronization conditions. By utilizing Lyapunov functional method, Yue and Li [12] studied the synchronization of continuous and discrete complex dynamical networks with interval time-varying delays in the dynamical nodes and the coupling term simultaneously in which delay-dependent synchronization conditions are derived in the form of linear matrix inequalities (LMIs). In [8], Li et al. studied the synchronization problem of general complex dynamical networks with time-varying delays in the network couplings and in the dynamical nodes, respectively. However, the time-varying delays are required to be differentiable.

It is well known that the existence of time delay in a system may cause instability and oscillations. Examples of time-delay systems are chemical engineering systems, biological modeling, electrical networks, physical networks, and many others, [14–20]. The stability criteria for systems with time delays can be classified into two categories: delay-independent and delay-dependent. Delay-independent criteria do not employ any information on the size of the delay, while delay-dependent criteria make use of such information at different levels. Delay-dependent stability conditions are generally less conservative than the delay-independent ones especially when the delay is small [20]. Recently, delay-dependent stability for interval time-varying delay was investigated in [12, 15–17, 19]. Interval time-varying delay is a time delay that varies in an interval in which the lower bound is not restricted to be 0. Jiang and Han [17] considered the problem of robust control for uncertain linear systems with interval time-varying delay based on the Lyapunov functional approach in which restriction on the differentiability of the interval time-varying delay was removed. Shao [19] presented a new delay-dependent stability criterion for linear systems with interval time-varying delay without introducing any free-weighting matrices. In order to reduce further the conservatism introduced by descriptor model transformation and bounding techniques, a free-weighting matrices method is proposed in [15, 21–24]. An advantage of this transformation is to transform the original system to an equivalent descriptor representation without introducing additional dynamics in the sense defined in [21]. In [22], based on the descriptor model transformation and decomposition technique of coefficient matrix, some new robust stability criteria are derived. In [12], the synchronization problem has been investigated for continuous/discrete complex dynamical networks with interval time-varying delays. Based on piecewise analysis method and the Lyapunov functional method, some new delay-dependent synchronization criteria are derived in the form of LMIs by introducing free-weighting matrices. It will be pointed out later that some existing results require more free-weighting matrix variables than our result.

Switched systems are special class of hybrid systems which consist of a family of continuous-time or discrete-time subsystems and a switching law that orchestrates the switching between them. Such systems have drawn considerable attention in control and computer communities in the last decade [25–31]. In [32], some stability properties of switched linear systems consisting of both stable and unstable subsystems have been derived by using an average dwell time approach and piecewise Lyapunov functions. It was shown that when the average dwell time is sufficiently large and the total activation time of the unstable subsystems is relatively small compared with that of stable subsystems, then global exponential stability is guaranteed. Liu and Zhao [9] investigated synchronization of complex delayed networks with switching topology via switched system stability theory. In [9], when all subnetworks are synchronizable, a delay-dependent synchronization condition is given in terms of LMIs which guarantees the solvability of the synchronization problem under an average dwell time scheme. Liu et al. [33] studied the local and global exponential synchronization of a complex dynamical network with switching topology and time-varying coupling delays. However, the time-varying delays in the dynamical nodes were not considered.

In this paper, we will investigate the local exponential synchronization of complex dynamical networks with interval time-varying delays in both dynamical nodes and in switched coupling terms simultaneously. The restriction on the differentiability of interval time-varying delays is removed, which means that a fast time-varying delay is allowed. We use a common unitary matrix for different subnetworks to transform the synchronization problem of the network into the stability analysis of pieces of linear switched systems. Then by using the average dwell time approach, the descriptor model transformation, and the decomposition technique of coefficient matrix, a new class of piecewise Lyapunov-Krasovskii functionals are constructed in order to get improved delay-dependent synchronization criteria which are derived in the form of LMIs. Finally, numerical examples are given to demonstrate that the derived conditions are less conservative than some existing results given in the literature.

The rest of the paper is organized as follows. In Section 2, a complex dynamical network model with interval time-varying and switched coupling delays as well as some useful lemmas is given. In Section 3, common unitary matrix and descriptor system transformation strategy are introduced to reformulate the network model. Then delay-dependent synchronization criteria are presented based on this novel model. Numerical examples that illustrated the obtained results are given in Section 4. The paper ends with conclusions in Section 5 and cited references.

#### 2. Network Model and Mathematic Preliminaries

The following notation will be used in this paper: denotes the -dimensional Euclidean space; and denote the minimum and maximum eigenvalue of a real symmetric matrix, respectively; denotes the Euclidean vector norm of ; denotes the transpose of the vector/matrix ; is symmetric if ; denotes the identity matrix; . The notation stands for a block-diagonal matrix.

Consider a complex dynamical switched network consisting of identical coupled nodes, with each node being an -dimensional dynamical system as where is the state vector of th node, for all are the state of node th; is the continuously differentiable function; is piecewise constant and left continuous and is called a switching signal; the constant is the coupling strength; is a constant inner-coupling matrix, if some pairs , , , with which means two coupled nodes are linked through their th and th state variables, otherwise ; is the outer-coupling matrix of the network, in which is defined as follows: if there is a connection between node and node , then ; otherwise, , and the diagonal elements of matrix are defined by It is assumed that switched network (1) is connected in the sense that there are no isolated clusters; that is namely, is an irreducible matrix. The time delay is a time-varying continuous function satisfying The initial condition function is a continuous vector-valued function for .

Corresponding to the switching signal , we have the switching sequence ; , , and when , the subnetwork is activated. Assume that there are no jumps in the state at the switching instants, and every network in (1) is connected; that is, , is irreducible.

*Remark 1. *For fixed , the system model (1) turns into the delayed complex dynamical network proposed by Yue and Li [12] as
Therefore, (1) is a general complex networks model, with (4) as a special case.

*Definition 2 (see [26]). *For any , let denote the number of switching of over . If holds for , , then is called average dwell time and is called a chatter bound.

*Definition 3 (see [12]). *The delayed dynamical switched network (1) is said to achieve asymptotic synchronization if
where is a solution of an isolated node satisfying

*Definition 4 (see [34]). *If the matrix is similar to a diagonal matrix, then is said to be diagonalizable.

In this paper, we assume that is an orbitally stable solution of the above system. Clearly, the stability of the synchronized states (5) of network (1) is determined by the dynamics of the isolated node, the coupling strength , the inner-coupling matrix , the outer-coupling matrix , and the fast time-varying delays .

The following lemmas will be used in the proof of the main result.

Lemma 5 (see [34]). *Let G be a family of diagonalizable matrices. Then G is a commuting family (under multiplication) if and only if it is a simultaneously diagonalizable family. *

Lemma 6 (see [14]). *For any constant symmetric matrix , , , , and any differentiable vector function , we have
*

#### 3. Synchronization of Switched Network

In this section, we will obtain some delay-dependent synchronization criteria for general complex dynamical network with interval time-varying delay and switched coupling delays (1) by strict LMI approaches. Let , , is the Jacobian of at with the derivative of with respect to . is the Jacobian of at with the derivative of with respect to .

Lemma 7. *Consider the switched coupling delays dynamical network described by (1). Let be the eigenvalues of the outer-coupling matrix . If the -dimensional linear switched system
**
is asymptotically (or exponentially) stable, then the synchronized state (5) is asymptotically (or exponentially) stable. *

*Proof. *To investigate the stability of the synchronized states (5), set
Substituting (9) into (1), for , we have
Since is continuous differentiable, it is easy to show that the origin of the nonlinear system (1) is an asymptotically stable equilibrium point if it is an asymptotically stable equilibrium point of the following linear switched time-varying delays systems:
where is the Jacobian of at and is the Jacobian of at .

Letting and , we have
Obviously, is diagonalizable for fixed . If , , for all , and commute pairwise;, that is, , then based on Lemma 5, one can get a common unitary matrix with such that
where , , , are eigenvalues of . In addition, with (2) and the irreducible feature of , we may choose such that , for all .

From (12), by using the nonsingular transform , we have the following matrix equation:
namely,
where and . Thus, we have transformed the stability problem of the synchronized state (5) to the stability problem of the pieces of -dimensional linear switched time-varying delays differential equations (15). Note that corresponding to the synchronization of the system states (5), where the state is an orbitally stable solution of the isolated node as assumed above in (5). If the following pieces of -dimensional linear switched time-varying delays systems
are asymptotically (or exponentially) stable, then will tend to the origin asymptotically (or exponentially), which is equivalent to the fact that the synchronized states (5) are asymptotically (or exponentially) stable. This completes the proof.

Next, we consider the nonswitched system We rewrite system (17) in the following equivalent descriptor system form: To derive delay-dependent stability conditions, which include the information of the time-varying delay , one usually uses the fact to transform the original system to a system with distributed delays. In order to improve the bound of time-varying delay , let us decompose the matrix , where are are appropriate constant matrices to be determined later. Then the original system (17) can be represented in the form of a descriptor system with time-varying and distributed delays as Let . Let be defined by where For given , the following lemma provides an estimation of .

Lemma 8. *Assume that the time-varying delay satisfies and let . If there exist symmetric positive definite matrices , , , , , and and appropriately dimensioned matrices , , and for , such that the following LMIs hold:
**, where
**
Then, along the trajectory of system (17), we have
*

*Proof. *By taking the derivative of Lyapunov-Krasovskii functional candidate (22) along the trajectory of the system (21), we obtain
where
Using Lemma 6, we obtain
On the other hand, we have
Let . Then, we obtain
From Lemma 6, we have
Therefore, from (21) and (30)–(34), it follows that
where , , and are defined in (24), (25), and (26), respectively, and
Since , is a convex combination of and . Therefore, is equivalent to and . Thus, it follows from (24), (25), and (35) that
By integrating this inequality from to , we obtain (27).

*Remark 9. *If in (24) and (25), then it follows from Lemma 8 that the network system (17) is asymptotically stable.

Next, we define as follows: where For given , the following lemma provides an estimation of .

Lemma 10. *Assume that the time-varying delay satisfies and let . If there exist symmetric positive definite matrices , , , , , and and appropriately dimensioned matrices , , and for , such that the following symmetric LMIs hold:
**, where
**
Then, along the trajectory of system (17), we have
*

*Proof. *With the same argument as in Lemma 8, by taking the derivative of Lyapunov-Krasovskii functional candidate (38) along the trajectory of the system (21), we obtain
Integrating this inequality from to , we get (42).

We are now ready to derive some new sufficient conditions for exponential synchronization of the switched network We rewrite system (44) in the following equivalent descriptor system form:

We consider the case when synchronizable and non-synchronizable subnetworks coexist. Without loss of generality, we suppose that each subnetwork is synchronizable, where , and each subnetwork is non-synchronizable.

For each subnetwork of the system (45) which satisfies Lemma 8, the Lyapunov-Krasovskii functional candidate can be chosen as where , , , , , , , and are positive definite matrices and Similarly, for each subnetwork of the system (45) which satisfies Lemma 10, the Lyapunov-Krasovskii functional candidate can be chosen as where , , , , , , , and are positive definite matrices.

Consider the following piecewise Lyapunov-Krasovskii functional candidate:

From Lemmas 8 and 10, the following properties of the Lyapunov-Krasovskii functional candidate (49) are obtained.(i)There exist such that (ii)There exists a constant such that (iii)The Lyapunov functional candidate (49) satisfies

Now, for any piecewise constant switching signal and any , we let ( resp.) denote the total activation time of the synchronizable subnetworks (the ones of non-synchronizable subnetworks resp.) during . Then, we choose a scalar arbitrarily to propose the following switching law. (*S*1): Determine the switching signal so that
holds on time interval . Meanwhile, we choose as the average dwell time scheme: for any ,

Theorem 11. *For a given constant , and time-varying delay satisfying (3), suppose that the subnetwork of switched network (1) satisfies the conditions of Lemma 8, and the others satisfy the conditions of Lemma 10. Assume that there exists such that
**
Then the synchronous manifold (5) of network (1) is locally exponentially stable for switching signal satisfying (53) and (54), and the state decay estimate is given by
**
where
*

*Proof. *Suppose that . For piecewise Lyapunov-Krasovskii functional candidate (49), along trajectory of network system (45), we have
Since is true from (51) at the switching point , where and from , we obtain
Under the switching law for any , , we have
Thus,
where , . According to (49), we have
Combining (61) and (62) leads to
Therefore,
which means that synchronous solution to (1) is locally exponentially stable. The proof is completed.

#### 4. Numerical Examples

In this section, we give examples to show the effectiveness of theoretical results obtained in Lemma 8 and Theorem 11.

*Example 12. *Consider a nonswitched network model with 5 nodes, where each node is a three-dimensional stable linear system described by
which is asymptotically stable at the equilibrium point , and its Jacobin matrices are , . Assume that the inner-coupling matrix is , and the outer-coupling matrix is given by the following irreducible symmetric matrix satisfying condition (2):
The eigenvalues of are , . Therefore, if the delayed subsystem in (17) is asymptotically stable, then the synchronized state is asymptotically stable.

In this example, we have , , and . Let us decompose the matrix , where

By using Lemma 8, we will give the maximum upper bounds of the time-varying delay for different lower bounds and coupling strength . Applying Lemma 8 with , we obtain the maximum upper bound of delays as shown in Table 1. We see that, Lemma 8 provides a less conservative result than those obtained via the methods of [8, 12]. When especially, the result in [8] is not discussed while Lemma 8 in this paper also considers the case . Note that we use MATLAB LMI Control Toolbox in order to solve the LMI in (24) and (25).

The numerical simulations are carried out using the explicit Runge-Kutta-like method (dde45), interpolation and extrapolation by spline of the third order. Figure 1 shows the synchronization state curves , with , and the initial function

*Example 13. *Consider a linear switched network model with 5 nodes where each node is described by the following delayed dynamical system:
which is asymptotically stable at the equilibrium point , . Jacobian matrices and are
Assume that the inner-coupling matrices are , and the coupling strengths are and , and the outer-coupling matrices are
The eigenvalues of and are , , and , respectively. Obviously, there exists a unitary matrix which diagonalizes and simultaneously. The subnetwork associated with is synchronizable and the subnetwork associated with is non-synchronizable.

From the above conditions, we obtain matrices
, and . Let us decompose the matrix , where

Given , , , and , it is found that LMIs (24), (25), (42), and (42) have feasible solutions. We may choose . Let . Then, from the switching law , it is required that and the average dwell time is computed as .

Let and the initial function