2009
DOI: 10.1201/9781584888215-c26
|View full text |Cite
|
Sign up to set email alerts
|

Self-Stabilizing Algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
4
0

Year Published

2011
2011
2022
2022

Publication Types

Select...
5
1
1

Relationship

1
6

Authors

Journals

citations
Cited by 22 publications
(5 citation statements)
references
References 65 publications
0
4
0
Order By: Relevance
“…They use an inner tempo, and their inner tempo self-synchronizes among the inner tempo of others. Self-Stabilizing algorithms are part of the distributed system domain [18]. The overall performance is self driven by messages the performers are exchanging breath, look around, noise from the movement of each other.…”
Section: 3mentioning
confidence: 99%
“…They use an inner tempo, and their inner tempo self-synchronizes among the inner tempo of others. Self-Stabilizing algorithms are part of the distributed system domain [18]. The overall performance is self driven by messages the performers are exchanging breath, look around, noise from the movement of each other.…”
Section: 3mentioning
confidence: 99%
“…A program is self-stabilizing [10], [11], [26] (or just stabilizing) if, regardless of the initial state, it eventually satisfies its specification. This elegant property enables the program to recover from transient faults or lack of initialization.…”
Section: Introductionmentioning
confidence: 99%
“…A self-stabilizing algorithm consists of mutually exclusive rules that are formed as follows: → , where is a boolean predicate which allows nodes to take an action, and is a series of statements that assign new values to the variables of the nodes and transmit messages if the message passing model is used [ 5 ]. In a self-stabilizing algorithm, each node maintains its variables by holding the precondition.…”
Section: Introductionmentioning
confidence: 99%
“…Temporal scheduling refers to the fairness of schedulers in two main types, fair and unfair (i.e., adversarial). An unfair scheduler does not promise all enabled nodes to make their moves but guarantees the global progress of the system [ 5 ]. In this paper, we use unfair distributed scheduler which subsumes both central and synchronous schedulers, and it is more realistic for WSN applications.…”
Section: Introductionmentioning
confidence: 99%