Abstract
Two models of distributed computation are described in which the agents are anonymous finite-state sensors interacting through a communication network whose dynamics (in case the agents are mobile) and/or topology they do not control or even know about. These models were recently introduced in a series of papers by Angluin et al. [3,4,2,5].
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.
References
Albert, R., Barabasi, A., Jeong, H.: Scale-free characteristics of random networks: The topology of the world wide web. Physica A: Statistical Mechanics and its Applications 281, 69–77 (2000)
Angluin, D., Aspnes, J., Chan, M., Fischer, M.J., Jiang, H., Peralta, R.: Stably computable properties of network graphs. In: Prasanna, V.K., Iyengar, S.S., Spirakis, P.G., Welsh, M. (eds.) DCOSS 2005. LNCS, vol. 3560, pp. 63–74. Springer, Heidelberg (2005)
Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Urn automata. Technical Report YALEU/DCS/TR–1280, Yale University Department of Computer Science (November 2003)
Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. In: PODC 2004: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, pp. 290–299. ACM Press, New York (2004)
Angluin, D., Aspnes, J., Fischer, M.J., Jiang, H.: Self-stabilizing population protocols. In: Ninth International Conference on Principles of Distributed Systems (pre-proceedings), pp. 79–90 (December 2005)
Erdös, Rényi.: On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci. 17(5) (1960)
Luisi, P.L.: Autopoiesis: a review and a reappraisal. Naturwissenschaften 90, 49–59 (2003)
Schneidman, E., Berry, M.J., Segev, R., Bialek, W.: Weak pairwise correlations imply strongly correlated network states in a neural population. Nature (April 2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Peralta, R. (2006). Dark Encounter Computations. In: Burmester, M., Yasinsac, A. (eds) Secure Mobile Ad-hoc Networks and Sensors. MADNES 2005. Lecture Notes in Computer Science, vol 4074. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11801412_17
Download citation
DOI: https://doi.org/10.1007/11801412_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-36646-1
Online ISBN: 978-3-540-37863-1
eBook Packages: Computer ScienceComputer Science (R0)