Computational models for networks of tiny artifacts: a survey
DOI10.1016/j.cosrev.2010.09.001zbMath1298.68039WikidataQ57608036 ScholiaQ57608036MaRDI QIDQ465666
Othon Michail, Amalia Duch, Carme Àlvarez, Ioannis Chatzigiannakis, Paul G. Spirakis, Maria J. Serna, Joaquim Gabarró
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
sensor networks; population protocols; graph languages; mediated population protocols; sensing problems; sensor field
68M10: Network design and communication in computer systems
68-02: Research exposition (monographs, survey articles) pertaining to computer science
68M14: Distributed systems
68M12: Network protocols
68T42: Agent technology and artificial intelligence
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Passively mobile communicating machines that use restricted space
- On the convergence of population protocols when population goes to infinity
- A calculus of total correctness for communicating processes
- The computational power of population protocols
- Computation in networks of passively mobile finite-state sensors
- Fast computation by population protocols with a leader
- Semigroups, Presburger formulas, and languages
- Recent Advances in Population Protocols
- The Dynamics of Probabilistic Population Protocols
- All Symmetric Predicates in NSPACE(n 2) Are Stably Computable by the Mediated Population Protocol Model
- Mediated Population Protocols
- Random Geometric Graphs
- Distributed Computing: A Locality-Sensitive Approach
- Stably computable predicates are semilinear
- Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures
- Population Protocols and Related Models
- Computation in networks of passively mobile finite-state sensors
