Distributed Disaster Disclosure

Authors:
Bernard Mans;Stefan Schmid;Roger Wattenhofer
Affiliations:
Department of Computing, Macquarie University, Sydney, Australia NSW 2109;Institut für Informatik, Technische Universität München, Garching, Germany 85748;Computer Engineering and Networks Laboratory (TIK), ETH Zurich, Zurich, Switzerland 8092
Venue:
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Year:
2008

Citing 8
Cited 1

Time-optimal leader election in general networks

Journal of Parallel and Distributed Computing
Fast network decomposition

PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Distributed computing: a locality-sensitive approach

Distributed computing: a locality-sensitive approach
A Distributed Algorithm for Minimum-Weight Spanning Trees

ACM Transactions on Programming Languages and Systems (TOPLAS)
Introduction to Algorithms

Introduction to Algorithms
A faster distributed protocol for constructing a minimum spanning tree

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Veracity radius: capturing the locality of distributed computations

Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Autograph: toward automated, distributed worm signature detection

SSYM'04 Proceedings of the 13th conference on USENIX Security Symposium - Volume 13

Event extent estimation

SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity

Quantified Score

Hi-index	0.03

Visualization

Abstract

Assume a set of distributed nodes which are equipped with a sensor device. When nodes sense an event, they want to know (the size of) the connected component consisting of nodes which have also sensed the event, in order to raise--if necessary--a disaster alarm. This paper presents distributed algorithms for this problem. Concretely, our algorithms aim at minimizing both the response time as well as the message complexity.