Rights accessRestricted access - publisher's policy
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.
CitationÁlvarez, M. [et al.]. Sensor field: a computational model. "Lecture notes in computer science", 2009, vol. 5804, p. 3-14.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: firstname.lastname@example.org