Computational models for networks of tiny artifacts: a survey

DOI10.1016/J.COSREV.2010.09.001MaRDI QIDQ465666zbMATH OpenOpenAlexWikidataFDO

Authors Carme Àlvarez, Ioannis Chatzigiannakis, Amalia Duch, Othon Michail, P. G. Spirakis, Joaquim Gabarró, Maria Serna

Publication date 24 October 2014

Published in Computer Science Review (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cosrev.2010.09.001

zbMATH Keywords

graph languagesmediated population protocolspopulation protocolssensing problemssensor fieldsensor networks

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Network design and communication in computer systems (68M10) Network protocols (68M12) Distributed systems (68M14) Agent technology and artificial intelligence (68T42)

Recommendations

• Computation in networks of passively mobile finite-state sensors
• Computation in networks of passively mobile finite-state sensors
• Population protocols and related models
• Recent Advances in Population Protocols
• Verification of population protocols

Cites work

• A calculus of total correctness for communicating processes
• All symmetric predicates in NSPACE\((n^{2})\) are stably computable by the mediated population protocol model
• Computation in networks of passively mobile finite-state sensors
• Computation in networks of passively mobile finite-state sensors
• Distributed Computing: A Locality-Sensitive Approach
• Fast computation by population protocols with a leader
• scientific article; zbMATH DE number 996442 (Why is no real title available?)
• scientific article; zbMATH DE number 5595162 (Why is no real title available?)
• scientific article; zbMATH DE number 5605125 (Why is no real title available?)
• scientific article; zbMATH DE number 3729228 (Why is no real title available?)
• scientific article; zbMATH DE number 1507210 (Why is no real title available?)
• Mediated Population Protocols
• Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures
• On the convergence of population protocols when population goes to infinity
• Passively mobile communicating machines that use restricted space
• Playing with population protocols
• Population protocols and related models
• Random Geometric Graphs
• Recent Advances in Population Protocols
• Semigroups, Presburger formulas, and languages
• Stably computable predicates are semilinear
• The computational power of population protocols
• The Dynamics of Probabilistic Population Protocols

Cited in

(7)

• Continuous monitoring in the dynamic sensor field model
• Computation in networks of passively mobile finite-state sensors
• The computational power of simple protocols for self-awareness on graphs
• Introduction to the special issue on foundations of adaptive networked societies of tiny artefacts
• Mediated population protocols
• Computation in networks of passively mobile finite-state sensors
• Passively mobile communicating machines that use restricted space

This page was built for publication: Computational models for networks of tiny artifacts: a survey

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q465666)