### 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.

Original language | English |
---|---|

Title of host publication | Algorithm Theory - SWAT 2008 - 11th Scandinavian Workshop on Algorithm Theory, Proceedings |

Editors | Joachim Gudmundsson |

Place of Publication | Berlin; New York |

Publisher | Springer, Springer Nature |

Pages | 246-257 |

Number of pages | 12 |

Volume | 5124 LNCS |

ISBN (Print) | 3540699007, 9783540699002 |

DOIs | |

Publication status | Published - 2008 |

Event | 11th Scandinavian Workshop on Algorithm Theory, SWAT 2008 - Gothenburg, Sweden Duration: 2 Jul 2008 → 4 Jul 2008 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 5124 LNCS |

ISSN (Print) | 03029743 |

ISSN (Electronic) | 16113349 |

### Other

Other | 11th Scandinavian Workshop on Algorithm Theory, SWAT 2008 |
---|---|

Country | Sweden |

City | Gothenburg |

Period | 2/07/08 → 4/07/08 |

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

## Cite this

Mans, B., Schmid, S., & Wattenhofer, R. (2008). Distributed disaster disclosure. In J. Gudmundsson (Ed.),

*Algorithm Theory - SWAT 2008 - 11th Scandinavian Workshop on Algorithm Theory, Proceedings*(Vol. 5124 LNCS, pp. 246-257). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5124 LNCS). Berlin; New York: Springer, Springer Nature. https://doi.org/10.1007/978-3-540-69903-3_23