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 141
- Downloads 0
A STUDY OF INTELLIGENT CONTROLLERS APPLICATION IN DISTRIBUTED SYSTEMS
Intelligent Control emulates the human intelligence and achieves automation in various areas of Engineering. Intelligent Controls have been used mainly in the areas of Electrical Systems; Machine Intelligence based syste...
A Novel Architecture for Domain Specific Parallel Crawler
The World Wide Web is an interlinked collection of billions of documents formatted using HTML. Due to the growing and dynamic nature of the web, it has become a challenge to traverse all URLs in the web documents and han...
A SECURITY FRAMEWORK FOR AN ENTERPRISE SYSTEM ON CLOUD
Enterprise systems provide integrated information for all activities in an organization. These systems serve as a vital asset to any organization and hence it becomes mandatory to ensure their security. Information secur...
AN EFFICIENT APPROACH TO PERFORM PRE-PROCESSING
Nowadays, WWW (World Wide Web) becomes more popular and user friendly for transferring information. Therefore people are more interested in analyzing log files which can offer more useful insight into web site usage. Web...
PRIVACY AWARE SPATIAL QUERIES
The advancement in mobile communications and its integration with Geographical Information System result in tremendous increase in Location aware computing. Users thirst for Geo-Point of interest leads to exploration of...