Pith. sign in

REVIEW

Stable Desynchronization for Wireless Sensor Networks: (III) Stability Analysis

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1704.07010 v1 pith:F7JNL4CX submitted 2017-04-24 cs.NI

Stable Desynchronization for Wireless Sensor Networks: (III) Stability Analysis

classification cs.NI
keywords desynchronizationequilibriumstabilitystablesystemsalgorithmsanalysisbounds
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

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)

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.