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.
Supported by MNiSW grant number N206 257335, 2008-2011, PBZ/MNiSW/ 07/2006/46.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Alon, N., Spencer, J.: The Probabilistic Method. John Wiley, Chichester (1991)
Birk, Y., Keidar, I., Liss, L., Schuster, A., Wolff, R.: Veracity Radius: Capturing the Locality of Distributed Computations. In: Proc. 25th ACM Symp. on Principles of Distributed Computing (PODC), pp. 102–111 (2006)
Davison, A.: Laptops as Earthquake Sensors. In: MIT Technology Review (2008)
Gabow, H.N., Westermann, H.H.: Forests, Frames, and Games: Algorithms for Matroid Sums and Applications. Algorithmica 7(1), 465–497 (1992)
Jacob, R., Richa, A., Scheideler, C., Schmid, S., Taeubig, H.: A Polylogarithmic Time Algorithm for Distributed Self-Stabilizing Skip Graphs. In: Proc. 28th ACM Symposium on Principles of Distributed Computing, PODC (2009)
Jiang, C., Dong, G., Wang, B.: Detection and Tracking of Region-Based Evolving Targets in Sensor Networks. In: Proc. 14th International Conference on Computer Communications and Networks, ICCCN (2005)
Kim, H.-A., Karp, B.: Autograph: Toward Automated, Distributed Worm Signature Detection. In: Proc. 13th Usenix Security Symposium, Security (2004)
Lipton, R.J., Tarjan, R.E.: A Separator Theorem for Planar Graphs. SIAM Journal of Applied Mathematics 36, 177–189 (1979)
Mans, B., Schmid, S., Wattenhofer, R.: Distributed Disaster Disclosure. In: Proc. 11th Scandinavian Workshop on Algorithm Theory, SWAT (2008)
Nash-Williams, C.S.J.: Edge-disjoint spanning trees of finite graphs. J. of London Mathematical Society 36, 445–450 (1961)
Peleg, D.: Distributed Computing: A Locality-sensitive Approach, Philadelphia, PA, USA. Society for Industrial and Applied Mathematics (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bienkowski, M., Gąsieniec, L., Klonowski, M., Korzeniowski, M., Schmid, S. (2010). Event Extent Estimation. In: Patt-Shamir, B., Ekim, T. (eds) Structural Information and Communication Complexity. SIROCCO 2010. Lecture Notes in Computer Science, vol 6058. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13284-1_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-13284-1_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13283-4
Online ISBN: 978-3-642-13284-1
eBook Packages: Computer ScienceComputer Science (R0)