Distributed Disaster Disclosure

Distributed Disaster Disclosure

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

Grafik Top
Authors
  • Mans, Bernard
  • Schmid, Stefan
  • Wattenhofer, Roger
Grafik Top
Supplemental Material
Shortfacts
Category
Paper in Conference Proceedings or in Workshop Proceedings (Paper)
Event Title
11th Scandinavian Workshop on Algorithm Theory (SWAT)
Divisions
Communication Technologies
Subjects
Informatik Allgemeines
Event Location
Gothenburg, Sweden
Event Type
Workshop
Event Dates
July 2008
Date
2008
Export
Grafik Top