Abstract
In the population protocol model introduced by Angluin et al. [2], a collection of agents, which are modelled by finite state machines, move around unpredictably and have pairwise interactions. The ability of such systems to compute functions on a multiset of inputs that are initially distributed across all of the agents has been studied in the absence of failures. Here, we show that essentially the same set of functions can be computed in the presence of halting and transient failures, provided preconditions on the inputs are added so that the failures cannot immediately obscure enough of the inputs to change the outcome. We do this by giving a general-purpose transformation that makes any algorithm for the fault-free setting tolerant to failures.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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.: Computation in networks of passively mobile finite-state sensors. In: Proc. 23rd ACM Symposium on Principles of Distributed Computing, pp. 290–299 (2004) (Expanded version to appear in Distributed Computing)
Angluin, D., Aspnes, J., Eisenstat, D.: Stably computable predicates are semilinear. In: Proc. 25th ACM Symposium on Principles of Distributed Computing, July 2006 (to appear)
Angluin, D., Aspnes, J., Eisenstat, D., Ruppert, E.: On the power of anonymous one-way communication. In: Anderson, J.H., Prencipe, G., Wattenhofer, R. (eds.) OPODIS 2005. LNCS, vol. 3974, pp. 396–411. Springer, Heidelberg (2006)
Angluin, D., Aspnes, J., Fischer, M.J., Jiang, H.: Self-stabilizing behavior in networks of nondeterministically interacting sensors. In: Proc. 9th International Conference on Principles of Distributed Systems (2005)
Catullus, G.V.: Carmen 3. In: Carmina. But curse upon you, cursed shades of Orcus, which devour all pretty things! Such a pretty sparrow you have taken away. (Transl. Francis Warre Cornish)
Delporte-Gallet, C., Fauconnier, H., Guerraoui, R.: What dependability for networks of mobile sensors? In: Proc. First Workshop on Hot Topics in System Dependability (2005)
Dolev, S.: Self-stabilization. MIT Press, Cambridge (2000)
Hadzilacos, V.: On the relationship between the atomic commitment and consensus problems. In: Proc. Workshop on Fault-Tolerant Distributed Computing, pp. 201–208 (1990)
Kahn, J.M., Katz, R.H., Pister, K.S.J.: Next century challenges: Mobile networking for “smart dust”. In: Proc. 5th ACM/IEEE International Conference on Mobile Computing and Networking, pp. 271–278 (1999)
Madden, S., Franklin, M.J., Hellerstein, J.M., Hong, W.: TAG: a tiny aggregation service for ad-hoc sensor networks. In: Proc. 5th Symposium on Operating Systems Design and Implementation, pp. 131–146 (2002)
Mostefaoui, A., Rajsbaum, S., Raynal, M.: Conditions on input vectors for consensus solvability in asynchronous distributed systems. Journal of the ACM 50(6), 922–954 (2003)
Patt-Shamir, B.: A note on efficient aggregate queries in sensor networks. In: Proc. 23rd ACM Symposium on Principles of Distributed Computing, pp. 283–289 (2004)
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
Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Ruppert, E. (2006). When Birds Die: Making Population Protocols Fault-Tolerant. In: Gibbons, P.B., Abdelzaher, T., Aspnes, J., Rao, R. (eds) Distributed Computing in Sensor Systems. DCOSS 2006. Lecture Notes in Computer Science, vol 4026. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11776178_4
Download citation
DOI: https://doi.org/10.1007/11776178_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35227-3
Online ISBN: 978-3-540-35228-0
eBook Packages: Computer ScienceComputer Science (R0)