Fast, silent self-stabilizing distance-k independent dominating set construction

We propose a fast, silent self-stabilizing protocol building a distance-k independent dominating set, named FID. The convergence of the protocol FID is established for any computation under the unfair distributed scheduler. The protocol FID reaches a terminal (also legitimate) configuration in at mo...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Information processing letters Jg. 114; H. 10; S. 551 - 555
1. Verfasser: Johnen, Colette
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Amsterdam Elsevier B.V 01.10.2014
Elsevier Sequoia S.A
Elsevier
Schlagworte:
Computation
Computer Science
Construction
Convergence
Data processing
Distance-k dominating set
Distance-k independent dominating set
Distance-k independent set
Distributed computing
Distributed, Parallel, and Cluster Computing
Fault tolerance
Graph theory
Networking and Internet Architecture
Networks
Protocol
Self-stabilization
Studies
Terminals
Self-stabilization
Fault tolerance
Distance-k independent dominating set
Distance-k independent set
Distance-k dominating set
Distributed computing
ISSN:0020-0190, 1872-6119
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We propose a fast, silent self-stabilizing protocol building a distance-k independent dominating set, named FID. The convergence of the protocol FID is established for any computation under the unfair distributed scheduler. The protocol FID reaches a terminal (also legitimate) configuration in at most 4n+k rounds, where n is the network size; it requires (k+1)log(n+1) bits per node. •The protocol FID builds in self-stabilizing manner distance-k independent dominating sets.•The protocol FID is silent, fast and simple.•The protocol FID works properly under any schedule.•The correctness and the termination of the protocol FID is proven.•The convergence time to reach a legitimate configuration is established: 4n+k where n is the network size.
Bibliographie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0020-0190
1872-6119
DOI:10.1016/j.ipl.2014.04.013