Communication-Efficient self-stabilization in wireless networks

Authors:
Tomoya Takimoto;Fukuhito Ooshita;Hirotsugu Kakugawa;Toshimitsu Masuzawa
Affiliations:
Graduate School of Information Science and Technology, Osaka University, Japan;Graduate School of Information Science and Technology, Osaka University, Japan;Graduate School of Information Science and Technology, Osaka University, Japan;Graduate School of Information Science and Technology, Osaka University, Japan
Venue:
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Year:
2012

Citing 12
Cited 0

Self-stabilization

Self-stabilization
Distributed Reset

IEEE Transactions on Computers
Stable Leader Election

DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Optimal Implementation of the Weakest Failure Detector for Solving Consensus

SRDS '00 Proceedings of the 19th IEEE Symposium on Reliable Distributed Systems
On implementing omega with weak reliability and synchrony assumptions

Proceedings of the twenty-second annual symposium on Principles of distributed computing
Communication Adaptive Self-Stabilizing Group Membership Service

IEEE Transactions on Parallel and Distributed Systems
Communication-efficient leader election and consensus with limited link synchrony

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Optimal message-driven implementations of omega with mute processes

ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Communication Efficiency in Self-Stabilizing Silent Protocols

ICDCS '09 Proceedings of the 2009 29th IEEE International Conference on Distributed Computing Systems
Brief Announcement: Communication-Efficient Self-stabilizing Protocols for Spanning-Tree Construction

OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Low communication self-stabilization through randomization

DISC'10 Proceedings of the 24th international conference on Distributed computing
Silence is golden: self-stabilizing protocols communication-efficient after convergence

SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

A self-stabilizing protocol is guaranteed to eventually reach a safe (or legitimate) configuration even when started from an arbitrary configuration. Most of self-stabilizing protocols require each process to keep communicating with all of its neighbors forever even after reaching a safe configuration. Such permanent communication impairs efficiency, but is necessary in nature of self-stabilization. The concept of communication-efficiency was introduced to reduce communication after reaching a safe configuration. The previous concept targets the point-to-point communication model, and is not appropriate to the wireless network model where a process can locally broadcast a message to its neighbors all at once. In this paper, we refine the concept of the communication-efficiency for the wireless network model, and investigate its possibility in self-stabilization for some fundamental problems; the minimal (connected) dominating set problem, the maximal independent set problem, and the spanning tree construction problem.