Design of inner coupling matrix for robustly self-synchronizing networks

被引:2
|
作者
Liu Gequn [1 ,3 ,4 ]
Zhan Zhiguo [1 ]
Knowles, Gareth [2 ]
机构
[1] Univ Shanghai Sci & Technol, Sch Opt Elect & Comp Engn, Shanghai 200093, Peoples R China
[2] Univ Shanghai Sci & Technol, Sinobritish Coll, Shanghai, Peoples R China
[3] Shanghai Key Lab Modem Opt Syst, Shanghai, Peoples R China
[4] Minist Educ, Engn Res Ctr Opt Instrument & Syst, Shanghai, Peoples R China
关键词
Complex networks; Self-synchronizing; Inner coupling matrix; Robustness; Similarity transformation; MASTER STABILITY FUNCTIONS; DYNAMICAL NETWORKS; COMPLEX NETWORKS; SYSTEMS;
D O I
10.1016/j.physa.2015.08.006
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
A self-synchronizing network may undergo change of scale and topology during its functioning, thus adjustment of parameters is necessary to enable the synchronization. The adjustment cost and runtime-break demand a method to maintain continuous operation of the network. To address these issues, this paper presents an analytical method for the design of the inner coupling matrix. The proposed method renders the synchronization robust to change of network scale and topology. It is usual in network models that scale and topology are represented by outer coupling matrix. In this paper we only consider diffusively coupled networks. For these networks, the eigenvalues of the outer coupling matrix are all non-positive. By utilizing this property, the designed inner coupling matrix can cover the entire left half of complex plane within the synchronized region to underlie robustness of synchronization. After elaborating the applicability of several types of synchronization state for a robustly self-synchronizing network, the analytical design method is given for the stable equilibrium point case. Sometimes the Jacobian matrix of the node dynamical equation may lead to an unrealizable complex inner coupling matrix in the method. We then introduce a lemma of matrix transformation to prevent this possibility. Additionally, we investigated the choice of inner coupling matrix to get a desirable self-synchronization speed. The corresponding condition in the design procedure is given to drive the network synchronization faster than convergence of each node. Finally, the article includes examples that show effectiveness and soundness of the method. (C) 2015 Elsevier B.V. All rights reserved.
引用
收藏
页码:68 / 80
页数:13
相关论文
共 50 条
  • [1] Coupling noise effect in self-synchronizing wireless sensor networks
    Closas, Pau
    Calvo, Eduard
    Fernandez-Rubio, Juan A.
    Pages-Zamora, Alba
    2007 IEEE 8TH WORKSHOP ON SIGNAL PROCESSING ADVANCES IN WIRELESS COMMUNICATIONS, VOLS 1 AND 2, 2007, : 515 - 519
  • [2] NEW APPROACHES TO THE DESIGN OF SELF-SYNCHRONIZING STREAM CIPHERS
    MAURER, UM
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 547 : 458 - 471
  • [3] SELF-SYNCHRONIZING CARDIAC PACEMAKER
    DENOTH, F
    DONATO, LA
    IEEE TRANSACTIONS ON BIOMEDICAL ENGINEERING, 1967, BM14 (02) : 103 - &
  • [4] Unconducting the Self-Synchronizing Orchestra
    Culver, Andrew
    CIRCUIT, 2012, 22 (01): : 51 - 58
  • [5] SELF-SYNCHRONIZING COMMUNICATION PROTOCOLS
    LIN, HP
    STOVALL, HE
    IEEE TRANSACTIONS ON COMPUTERS, 1989, 38 (05) : 609 - 625
  • [6] SELF-SYNCHRONIZING HUFFMAN CODES
    FERGUSON, TJ
    RABINOWITZ, JH
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1984, 30 (04) : 687 - 693
  • [7] REMOTE CONTROL IS SELF-SYNCHRONIZING
    DUNPHY, WP
    HYDRAULICS & PNEUMATICS, 1968, 21 (05) : 110 - &
  • [8] Towards a spectral approach for the design of self-synchronizing stream ciphers
    Parriaux, Jeremy
    Guillot, Philippe
    Millerioux, Gilles
    CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2011, 3 (04): : 259 - 274
  • [9] A Fast Self-synchronizing Synchronverter Design with Easily Tuneable Parameters
    Dong, Shuan
    Chen, Yu Christine
    2018 IEEE POWER & ENERGY SOCIETY GENERAL MEETING (PESGM), 2018,
  • [10] Towards a spectral approach for the design of self-synchronizing stream ciphers
    Jérémy Parriaux
    Philippe Guillot
    Gilles Millérioux
    Cryptography and Communications, 2011, 3 : 259 - 274