When birds die: Making population protocols fault-tolerant

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4026 LNCS, Issue , 2006, Pages 51-66

  Delporte Gallet, Carole ^a   Fauconnier, Hugues ^a   Guerraoui, Rachid ^a,b   Ruppert, Eric ^c  

^a EPFL   (Switzerland)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c YORK UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS; FAULT TOLERANT COMPUTER SYSTEMS; MULTI AGENT SYSTEMS; NETWORK PROTOCOLS;

FAULT FREE SETTING; HALTING; POPULATION PROTOCOL MODEL; TRANSIENT FAILURES;

COMPUTER NETWORKS;

EID: 33746053506     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11776178_4     Document Type: Conference Paper

References (14)

1. DANA ANGLUIN, JAMES ASPNES, MELODY CHAN, MICHAEL J. FISCHER, HONG JIANG, AND RENÉ PERALTA. Stably computable properties of network graphs. In Proc. International Conference on Distributed Computing in Sensor Systems, volume 3560 of LNCS, pages 63-74, 2005.
2. DANA ANGLUIN, JAMES ASPNES, ZOË DIAMADI, MICHAEL J. FISCHER, AND RENÉ PERALTA. Computation in networks of passively mobile finite-state sensors. In Proc. 23rd ACM Symposium on Principles of Distributed Computing, pages 290-299, 2004.
3. Expanded version to appear in Distributed Computing.
4. DANA ANGLUIN, JAMES ASPNES, AND DAVID EISENSTAT. Stably computable predicates are semilinear. In Proc. 25th ACM Symposium on Principles of Distributed Computing, July 2006. To appear.
5. DANA ANGLUIN, JAMES ASPNES, DAVID EISENSTAT, AND ERIC RUPPERT. On the power of anonymous one-way communication. In Proc. 9th International Conference on Principles of Distributed Systems, 2005.
6. DANA ANGLUIN, JAMES ASPNES, MICHAEL J. FISCHER, AND HONG JIANG. Self-stabilizing behavior in networks of nondeterministically interacting sensors. In Proc. 9th International Conference on Principles of Distributed Systems, 2005.
7. GAIUS VALERIUS CATULLUS. 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).
8. CAROLE DELPORTE-GALLET, HUGUES FAUCONNIER, AND RACHID GUERRAOUI. What dependability for networks of mobile sensors? In Proc. First Workshop on Hot Topics in System Dependability, 2005.
9. SHLOMI DOLEV. Self-stabilization. MIT Press, 2000.
10. VASSOS HADZILACOS. On the relationship between the atomic commitment arid consensus problems. In Proc. Workshop on Fault-Tolerant Distributed Computing, pages 201-208, 1990.
11. J. M. KAHN, R. H. KATZ, AND K. S. J. PISTER. Next century challenges: Mobile networking for "smart dust". In Proc. 5th ACM/IEEE International Conference on Mobile Computing and Networking, pages 271-278, 1999.
12. SAMUEL MADDEN, MICHAEL J. FRANKLIN, JOSEPH M. HELLERSTEIN, AND WEI HONG. TAG: a tiny aggregation service for ad-hoc sensor networks. In Proc. 5th Symposium on Operating Systems Design and Implementation, pages 131-146, 2002.
13. ACHOUR MOSTEFAOUI, SERGIO RAJSBAUM, AND MICHEL RAYNAL. Conditions on input vectors for consensus solvability in asynchronous distributed systems. Journal of the ACM, 50(6), pages 922-954, 2003.
14. BOAZ PATT-SHAMIR. A note on efficient aggregate queries in sensor networks. In Proc. 23rd ACM Symposium on Principles of Distributed Computing, pages 283-289, 2004.