AN OPTIMIZED GLOBAL SYNCHRONIZATION ON SDDCN
Journal Title: Indian Journal of Computer Science and Engineering - Year 2010, Vol 1, Issue 4
Abstract
The complex networks have been gaining increasing research attention because of their potential applications in many real-world systems from a variety of fields such as biology, social systems, linguistic networks, and technological systems. In this paper, the problem of stochastic synchronization analysis is investigated for a new array of coupled discrete time stochastic complex networks with randomly occurred nonlinearities (RONs) and time delays. The discrete-time complex networks under consideration are subject to: 1) stochastic nonlinearities that occur according to the Bernoulli distributed white noise sequences; 2) stochastic disturbances that enter the coupling term, the delayed coupling term as well as the overall network; and 3) time delays that include both the discrete and distributed ones. Note that the newly introduced RONs and the multiple stochastic disturbances can better reflect the dynamical behaviors of coupled complex networks whose information transmission process is affected by a noisy environment. By constructing a novel Lyapunov-like matrix functional, the idea of delay fractioning is applied to deal with the addressed synchronization analysis problem. By employing a combination of the linear matrix inequality (LMI) techniques, the free-weighting matrix method and stochastic analysis theories, several delay-dependent sufficient conditions are obtained which ensure the asymptotic synchronization in the mean square sense for the discrete-time stochastic complex networks with time delays. The criteria derived are characterized in terms of LMIs whose solution can be solved by utilizing the standard numerical software. While these solvers are significantly faster than classical convex optimization algorithms, it should be kept in mind that the complexity of LMI computations remains higher than that of solving, say, a Riccati equation. For instance, problems with a thousand design variables typically take over an hour on today’s workstations. However, this thesis proposes LMI optimization technique to solve this problem. The advantage of the proposed approach is that resulting stability criterion can be used efficiently via existing numerical convex optimization algorithms such as the interior-point algorithms for solving LMIs
Authors and Affiliations
T. SANTHA , M. SHARANYA
Keywords
Related Articles
- EP ID EP139835
- DOI -
- Views 136
- Downloads 0
STUDY OF SDN USING MININET
The traditional architecture of networks has long supported the needs of the data centers. However, with the today’s heavy data usage by users, the need for a shift to virtualizing functions and applying a more modern ap...
Effective cum Efficient Bandwidth by LZW Compression Technique
The Internet and World Wide Web (WWW) have made electronic commerce a reality. According to an estimate the WWW presently contains more than 800 millions pages, encompassing about 6 terabytes of text data on about 3 mill...
ZONE WISE ANALYSIS OF CAVITATION IN PRESSURE DROP DEVICES OF PROTOTYPE FAST BREEDER REACTOR BY KURTOSIS BASED RECURRENT NETWORK
This paper aims to analyze the quality of pressure drop devices (orifices), which is used for flow zoning in proto type fast breeder reactor (PFBR) by analyzing the occurrence of cavitation. The magnitude of root mean sq...
Estimation of Fundamental and Formant frequencies of infants’ cries; a study of Infants with congenital Heart disorder
A congenital heart disease (CHD) is a defect in the structure of the heart and great vessels of a newborn.CHD s are classified into Cyanotic and Acyanotic. The most common cyanotic heart disorder in infants is Tetralogy...
An Approach for Graph based Planning and Quality Driven Composition of Web Services
Service Oriented Architectures enable a multitude of Web services to provide loosely coupled and interoperable services at different Quality of Service level in the recent few years. Dynamic Web services composition offe...