Abstract
We introduce a formal model of computation for networks of tiny artifacts, the static synchronous sensor field model (SSSF) which considers that the devices communicate through a fixed communication graph and interact with the environment through input/output data streams. We analyze the performance of SSSFs solving two sensing problems the Average Monitoring and the Alerting problems. For constant memory SSSFs we show that the set of recognized languages is contained in DSPACE(n + m) where n is the number of nodes of the communication graph and m its number of edges. Finally we explore the capabilities of SSSFs having sensing and additional non-sensing constant memory devices. © 2009 Springer-Verlag.
Cite
CITATION STYLE
Àlvarez, C., Duch, A., Gabarro, J., & Serna, M. (2009). Sensor field: A computational model. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5804 LNCS, pp. 3–14). https://doi.org/10.1007/978-3-642-05434-1_3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
