A self-stabilizing 6-approximation for the minimum connected dominating set with safe convergence in unit disk graphs

Authors:
Sayaka Kamei;Hirotsugu Kakugawa
Affiliations:
Department of Information Engineering, Graduate School of Engineering, Hiroshima University, 1-4-1 Kagamiyama, Higashi-Hiroshima, Hiroshima, 739-8527, Japan;Department of Computer Science, Graduate School of Information Science and Technology, Osaka University, 1-5 Yamadaoka, Suita, Osaka, 565-0871, Japan
Venue:
Theoretical Computer Science
Year:
2012

Citing 31
Cited 0

Unit disk graphs

Discrete Mathematics - Topics on domination
Stabilizing Communication Protocols

IEEE Transactions on Computers - Special issue on protocol engineering
Stabilizing phase-clocks

Information Processing Letters
Uniform Dynamic Self-Stabilizing Leader Election

IEEE Transactions on Parallel and Distributed Systems
A transformation of self-stabilizing serial model programs for asynchronous parallel computing environments

Information Processing Letters
Fundamentals of fault-tolerant distributed computing in asynchronous environments

ACM Computing Surveys (CSUR)
Self-stabilization

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

Communications of the ACM
Approximation algorithms

Approximation algorithms
Distributed Reset

IEEE Transactions on Computers
Stabilization of general loop-free routing

Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
A Timestamp Based Transformation of Self-Stabilizing Programs for Distributed Computing Environments

WDAG '96 Proceedings of the 10th International Workshop on Distributed Algorithms
Constant-time distributed dominating set approximation

Proceedings of the twenty-second annual symposium on Principles of distributed computing
Distributed construction of connected dominating set in wireless ad hoc networks

Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks

IEEE Transactions on Parallel and Distributed Systems
A new distributed approximation algorithm for constructing minimum connected dominating set in wireless ad hoc networks: Research Articles

International Journal of Communication Systems
On greedy construction of connected dominating sets in wireless networks: Research Articles

Wireless Communications & Mobile Computing - RRM for Next-Generation Wireless and Mobile Communication Systems
A Distributed Self-Stabilizing Algorithm for Finding a Connected Dominating Set in a Graph

PDCAT '05 Proceedings of the Sixth International Conference on Parallel and Distributed Computing Applications and Technologies
Distributed algorithms for connected domination in wireless networks

Journal of Parallel and Distributed Computing
A Self-Stabilizing Leader Election Algorithm in Highly Dynamic Ad Hoc Mobile Networks

IEEE Transactions on Parallel and Distributed Systems
Theoretical Bound and Practical Analysis of Connected Dominating Set in Ad Hoc and Sensor Networks

DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Robust self-stabilizing weight-based clustering algorithm

Theoretical Computer Science
A new local algorithm for backbone formation in ad hoc networks

Proceedings of the 6th ACM symposium on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
A self-stabilizing algorithm for the shortest path problem assuming the distributed demon

Computers & Mathematics with Applications
A framework of safe stabilization

SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
Route preserving stabilization

SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
Local algorithms for dominating and connected dominating sets of unit disk graphs with location aware nodes

LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Robust self-stabilizing construction of bounded size weight-based clusters

EuroPar'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part I
A self-stabilizing minimal dominating set algorithm with safe convergence

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Self-stabilizing wireless connected overlays

OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
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

Quantified Score

Hi-index	5.23

Visualization

Abstract

In wireless ad hoc or sensor networks, a connected dominating set (CDS) is useful as the virtual backbone because there is no fixed infrastructure or centralized management. Additionally, in such networks, transient faults and topology changes occur frequently. A self-stabilizing system tolerates any kind and any finite number of transient faults, and does not need any initialization. An ordinary self-stabilizing algorithm has no safety guarantee and requires that the network remains static while converging to a legitimate configuration. Safe converging self-stabilization is one extension of self-stabilization. The safe convergence property guarantees that the system quickly converges to a safe configuration, and then, it moves to an optimal configuration without breaking safety. In this paper, we propose a self-stabilizing fully distributed 6-approximation algorithm with safe convergence for the minimum CDS in the networks modeled by unit disk graphs.