Mostra el registre d'ítem simple
Sensor field: a computational model
dc.contributor.author | Álvarez Faura, M. del Carme |
dc.contributor.author | Duch Brown, Amalia |
dc.contributor.author | Gabarró Vallès, Joaquim |
dc.contributor.author | Serna Iglesias, María José |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics |
dc.date.accessioned | 2011-07-29T09:41:36Z |
dc.date.available | 2011-07-29T09:41:36Z |
dc.date.created | 2009 |
dc.date.issued | 2009 |
dc.identifier.citation | Alvarez, M. [et al.]. Sensor field: a computational model. A: International Workshop on Algorithmic Aspects of Wireless Sensor Networks. "5th International Workshop on Algorithmic Aspects of Wireless Sensor Networks". Rhodes: 2009, p. 5-16. |
dc.identifier.uri | http://hdl.handle.net/2117/13077 |
dc.description.abstract | In this work we introduce a formal model for studying networks of tiny artifacts, the static synchronous sensor field model (SSSF). The model consider that these devices communicate among them by means of a communication graph. A sensor field interacts with the environment with input/output data streams. We start analyzing the behavior of networks in which at every step each sensor takes a new input data item and outputs (with some possible latency) an output data item. Accordingly we introduce adequate performance measures like latency, message number, or message length. We study two sensing problems the Average Monitoring and the Alerting problems. For the Average Monitoring problem we give upper bounds on the latency, number of required messages and their size and optimal algorithms to solve it in specific topologies. We show that the Alerting problem can be solved with sensing devices of constant memory. When the SSSFs are allowed to use only devices with constant memory capacity we demonstrate that the decisional version of the functions computed by such SSSFs are in the class DSPACE(max(n,m)) where n is the number of nodes of the communication graph and m its number of edges. If in this kind of SSSFs we consider the possibility of using more non-sensing tiny devices than input data streams we show that monitoring a property that is polynomial time computable can be solved by SSSFs of polynomial size and latency with respect to the number of input data streams. |
dc.format.extent | 12 p. |
dc.language.iso | eng |
dc.rights | Attribution-NonCommercial-NoDerivs 3.0 Spain |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/es/ |
dc.subject | Àrees temàtiques de la UPC::Enginyeria electrònica::Instrumentació i mesura::Sensors i actuadors |
dc.subject.lcsh | Sensor networks |
dc.subject.other | Tiny artifacts |
dc.subject.other | Sensors |
dc.subject.other | Computational models |
dc.subject.other | Data streams |
dc.subject.other | Average monitoring problem |
dc.subject.other | Alerting problem |
dc.subject.other | Static synchronous sensor field |
dc.title | Sensor field: a computational model |
dc.type | Conference lecture |
dc.subject.lemac | Xarxes de sensors |
dc.contributor.group | Universitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals |
dc.description.peerreviewed | Peer Reviewed |
dc.rights.access | Open Access |
local.identifier.drac | 2471927 |
dc.description.version | Postprint (author’s final draft) |
local.citation.author | Alvarez, M.; Duch, A.; Gabarro, J.; Serna, M. |
local.citation.contributor | International Workshop on Algorithmic Aspects of Wireless Sensor Networks |
local.citation.pubplace | Rhodes |
local.citation.publicationName | 5th International Workshop on Algorithmic Aspects of Wireless Sensor Networks |
local.citation.startingPage | 5 |
local.citation.endingPage | 16 |