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

Sayaka Kamei, Tomoko Izumi, Yukiko Yamauchi

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)102-119
Number of pages18
JournalTheoretical Computer Science
Volume615
DOIs
Publication statusPublished - Feb 15 2016

Fingerprint

Unit Disk Graph
Connected Dominating Set
Wireless ad hoc networks
Approximation algorithms
Sensor networks
Clocks
Stabilization
Configuration
Approximation
Convergence Time
Self-stabilization
Transient Faults
Self-stabilizing Algorithm
Converge
Wireless Ad Hoc Networks
Dominating Set
Backbone
Initialization
Convergence Properties
Sensor Networks

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

An asynchronous self-stabilizing approximation for the minimum CDS with safe convergence in UDGs. / Kamei, Sayaka; Izumi, Tomoko; Yamauchi, Yukiko.

In: Theoretical Computer Science, Vol. 615, 15.02.2016, p. 102-119.

Research output: Contribution to journalArticle

@article{8f06b8baf6a54742acfdca471ffaf1c8,
title = "An asynchronous self-stabilizing approximation for the minimum CDS with safe convergence in UDGs",
abstract = "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.",
author = "Sayaka Kamei and Tomoko Izumi and Yukiko Yamauchi",
year = "2016",
month = "2",
day = "15",
doi = "10.1016/j.tcs.2015.12.001",
language = "English",
volume = "615",
pages = "102--119",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",

}

TY - JOUR

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

AU - Kamei, Sayaka

AU - Izumi, Tomoko

AU - Yamauchi, Yukiko

PY - 2016/2/15

Y1 - 2016/2/15

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84953291227&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84953291227&partnerID=8YFLogxK

U2 - 10.1016/j.tcs.2015.12.001

DO - 10.1016/j.tcs.2015.12.001

M3 - Article

AN - SCOPUS:84953291227

VL - 615

SP - 102

EP - 119

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

ER -