2017/04/23 by Supasate Choochaisri, Choochaisri, Supasate, Kittipat Apicharttrisorn +3
Computer Science · #Distributed Control Multi-Agent Systems #FOS: Computer and information sciences #Networking and Internet Architecture (cs.NI) #Neural Networks Stability and Synchronization #Nonlinear Dynamics and Pattern Formation #cs.NI
paper · pdf · doi:10.48550/arxiv.1704.07010
21 pages
openalex publication_date 2017/04/23 · arxiv created 2017/04/24 · arxiv updated 2017/04/25 · openalex created_date 2022/08/27 · openalex updated_date 2026/07/28
In this paper, we use dynamical systems to analyze stability of desynchronization algorithms at equilibrium. We start by illustrating the equilibrium of a dynamic systems and formalizing force components and time phases. Then, we use Linear Approximation to obtain Jaconian (J) matrixes which are used to find the eigenvalues. Next, we employ the Hirst and Macey theorem and Gershgorins theorem to find the bounds of those eigenvalues. Finally, if the number of nodes (n) is within such bounds, the systems are stable at equilibrium. (This paper is the last part of the series Stable Desynchronization for Wireless Sensor Networks - (I) Concepts and Algorithms (II) Performance Evaluation (III) Stability Analysis)