Event extent estimation

Marcin Bienkowski, Leszek Ga̧sieniec, Marek Klonowski, Miroslaw Korzeniowski, Stefan Schmid

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

This paper studies local-control strategies to estimate the size of a certain event affecting an arbitrary connected subset of nodes in a network. For example, our algorithms allow nodes in a peer-to-peer system to explore the remaining connected components after a Denial-of-Service attack, or nodes in a sensor network to assess the magnitude of a certain environmental event. In our model, each node can keep some extra information about its neighborhood computed during the deployment phase of the network. On the arrival of the event, the goal of the active nodes is to learn the network topology induced by the event, without the help of the remaining nodes. This paper studies the tradeoffs between message and time complexity of possible distributed solutions.

Original languageEnglish (US)
Title of host publicationStructural Information and Communication Complexity - 17th International Colloquium, SIROCCO 2010, Proceedings
Pages57-71
Number of pages15
DOIs
StatePublished - 2010
Externally publishedYes
Event17th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2010 - Sirince, Turkey
Duration: Jun 7 2010Jun 11 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6058 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference17th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2010
Country/TerritoryTurkey
CitySirince
Period6/7/106/11/10

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Event extent estimation'. Together they form a unique fingerprint.

Cite this