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.