Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler

Authors:
Volker Turau
Affiliations:
Hamburg University of Technology, Institute of Telematics, Schwarzenbergstraße 95, 21073 Hamburg, Germany
Venue:
Information Processing Letters
Year:
2007

Citing 4
Cited 9

Self-stabilization

Self-stabilization
Self-stabilizing systems in spite of distributed control

Communications of the ACM
Self-Stabilizing Protocols for Maximal Matching and Maximal Independent Sets for Ad Hoc Networks

IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
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

Fault tolerance in wireless sensor networks through self-stabilisation

International Journal of Communication Networks and Distributed Systems
Convergence Time Analysis of Self-stabilizing Algorithms in Wireless Sensor Networks with Unreliable Links

SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems
A self-stabilizing algorithm for constructing weakly connected minimal dominating sets

Information Processing Letters
A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs

Journal of Parallel and Distributed Computing
Distributed fault tolerant computation of weakly connected dominating set in ad hoc networks

The Journal of Supercomputing
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
Efficient transformation of distance-2 self-stabilizing algorithms

Journal of Parallel and Distributed Computing
Correctness of Self-Stabilizing Algorithms Under the Dolev Model When Adapted to Composite Atomicity Models

International Journal of Artificial Life Research

Quantified Score

Hi-index	0.89

Visualization

Abstract

This paper presents distributed self-stabilizing algorithms for the maximal independent and the minimal dominating set problems. Using an unfair distributed scheduler the algorithms stabilizes in at most max{3n-5,2n} resp. 9n moves. All previously known algorithms required O(n^2) moves.