An asynchronous self-stabilizing approximation for the minimum CDS with safe convergence in UDGs

A connected dominating set (CDS) is useful in forming a virtual backbone in wireless ad hoc or sensor networks because these networks lack a fixed infrastructure and centralized management. Self-stabilization guarantees that the system tolerates any finite number of transient faults and does not nee...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Theoretical computer science Ročník 615; s. 102 - 119
Hlavní autoři: Kamei, Sayaka, Izumi, Tomoko, Yamauchi, Yukiko
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 15.02.2016
Témata:
Algorithms
Approximation
Backbone
Construction
Convergence
Disks
Distributed approximation algorithm
Mathematical analysis
Minimum connected dominating set
Networks
Safe convergence
Self-stabilization
Unfair distributed daemon
Unit disk graph
Self-stabilization
Distributed approximation algorithm
Safe convergence
Minimum connected dominating set
Unfair distributed daemon
Unit disk graph
ISSN:0304-3975, 1879-2294
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:A connected dominating set (CDS) is useful in forming a virtual backbone in wireless ad hoc or sensor networks because these networks lack a fixed infrastructure and centralized management. Self-stabilization guarantees that the system tolerates any finite number of transient faults and does not need any initialization. The safe convergence property guarantees that the system quickly converges to a feasible safe configuration, and subsequently converges to a legitimate configuration without violating safety. A previous publication on a safely converging algorithm for the minimum CDS assumed a phase clock synchronizer, which is a very strong assumption. In this paper, we propose the first asynchronous self-stabilizing (6+ϵ)-approximation algorithm with safe convergence for the minimum CDS in networks modeled by unit disk graphs (UDGs). We assume that the feasible safe configuration satisfies the condition that a dominating set is constructed. The convergence time to a feasible safe configuration is one round, and the convergence time to a legitimate configuration in which an approximated minimum CDS is constructed is O(max⁡{d2,n}) rounds, and O(n6) steps.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2015.12.001