Dark encounter computations

Authors:
René Peralta
Affiliations:
Information Technology Laboratory, National Institute of Standards and Technology
Venue:
MADNES'05 Proceedings of the First international conference on Secure Mobile Ad-hoc Networks and Sensors
Year:
2005

Citing 3
Cited 0

Computation in networks of passively mobile finite-state sensors

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Stably computable properties of network graphs

DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
Self-stabilizing population protocols

OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

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].