ACM Computing Surveys (CSUR)
A self-stabilizing algorithm for minimum-depth search of graphs
Information Sciences: an International Journal
Self-stabilization
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Self-Stabilizing Depth-First Token Passing on Rooted Networks
WDAG '97 Proceedings of the 11th International Workshop on Distributed Algorithms
Self-Stabilizing Minimum Spanning Tree Construction on Message-Passing Networks
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Self-Stabilizing Local Mutual Exclusion on Networks in which Process Identifiers are not Distinct
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
Linear time self-stabilizing colorings
Information Processing Letters
Self-stabilization over unreliable communication media
Distributed Computing - Special issue: Self-stabilization
Information Processing Letters
Conflict Managers for Self-stabilization without Fairness Assumption
ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
Anonymous daemon conversion in self-stabilizing algorithms by randomization in constant space
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Randomized self-stabilizing algorithms for wireless sensor networks
IWSOS'06/EuroNGI'06 Proceedings of the First international conference, and Proceedings of the Third international conference on New Trends in Network Architectures and Services conference on Self-Organising Systems
Cached Sensornet Transformation of Non-silent Self-stabilizing Algorithms with Unreliable Links
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
A new technique for proving self-stabilizing under the distributed scheduler
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
A new analysis of a self-stabilizing maximum weight matching algorithm with approximation ratio 2
Theoretical Computer Science
Hi-index | 0.00 |
Wireless sensor networks (WSNs) suffer from resource limitations, high failure rates and faults caused by the lossy nature of wireless communication. This can lead to situations, where nodes lose synchrony and programs reach arbitrary states. Traditional approaches to fault tolerance like fault masking or global resets are not feasible for WSNs. Applying the concepts of self-stabilisation to achieve fault tolerance is a promising concept. However, the majority of self-stabilising algorithms found in the literature is based on models not suitable for WSNs. This paper proposes a problem-independent transformation for algorithms that stabilise under the central daemon scheduler such that they meet the demands of a WSN. Furthermore, a comparison with transformers from the literature is made through a series of simulations. Finally, the proposed transformer is evaluated with a real sensor network in a field test.