Construction of a fault-tolerant wireless communication topology using distributed agreement

Authors:
Heinrich Moser;Bernd Thallner
Affiliations:
Vienna University of Technology;Vienna University of Technology
Venue:
DIWANS '06 Proceedings of the 2006 workshop on Dependability issues in wireless ad hoc networks and sensor networks
Year:
2006

Citing 10
Cited 1

Impossibility of distributed consensus with one faulty process

Journal of the ACM (JACM)
Unreliable failure detectors for reliable distributed systems

Journal of the ACM (JACM)
Non-blocking atomic commitment

Distributed systems (2nd Ed.)
On Quiescent Reliable Communication

SIAM Journal on Computing
Topology control and routing in ad hoc networks: a survey

ACM SIGACT News
A Case Study of Agreement Problems in Distributed Systems: Non-Blocking Atomic Commitment

HASE '97 Proceedings of the 2nd High-Assurance Systems Engineering Workshop
Revistiting the Relationship Between Non-Blocking Atomic Commitment and Consensus

WDAG '95 Proceedings of the 9th International Workshop on Distributed Algorithms
The weakest failure detectors to solve certain fundamental problems in distributed computing

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
FLSS: a fault-tolerant topology control algorithm for wireless networks

Proceedings of the 10th annual international conference on Mobile computing and networking
Failure detection and consensus in the crash-recovery model

Distributed Computing

Topology control for fault-tolerant communication in wireless ad hoc networks

Wireless Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a proven correct implementation of a distributed topology construction algorithm based upon agreement on minimal-weight clusters for creating a k - regular, k -node connected fault-tolerant communication network. It adapts to crashing nodes, moving nodes and changing communication cost and is guaranteed to converge. We analyze the requirements imposed upon the system model by this class of agreement-based algorithms and show that our implementation works in asynchronous distributed systems augmented with unreliable failure detectors.