Distributed disaster disclosure

Bernard Mans*, Stefan Schmid, Roger Wattenhofer

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review

2 Citations (Scopus)


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.

Original languageEnglish
Title of host publicationAlgorithm Theory - SWAT 2008 - 11th Scandinavian Workshop on Algorithm Theory, Proceedings
EditorsJoachim Gudmundsson
Place of PublicationBerlin; New York
PublisherSpringer, Springer Nature
Number of pages12
Volume5124 LNCS
ISBN (Print)3540699007, 9783540699002
Publication statusPublished - 2008
Event11th Scandinavian Workshop on Algorithm Theory, SWAT 2008 - Gothenburg, Sweden
Duration: 2 Jul 20084 Jul 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5124 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349


Other11th Scandinavian Workshop on Algorithm Theory, SWAT 2008


Dive into the research topics of 'Distributed disaster disclosure'. Together they form a unique fingerprint.

Cite this