DSpace DSpace UPC
 Català   Castellano   English  

E-prints UPC >
Altres >
Enviament des de DRAC >

Empreu aquest identificador per citar o enllaçar aquest ítem: http://hdl.handle.net/2117/13077

Arxiu Descripció MidaFormat
ADGS-algsens.pdfArticle principal enviat258,25 kBAdobe PDFThumbnail
Veure/Obrir

Citació: 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.
Títol: Sensor field: a computational model
Autor: Álvarez Faura, M. del Carme Veure Producció científica UPC; Duch Brown, Amalia Veure Producció científica UPC; Gabarró Vallès, Joaquim Veure Producció científica UPC; Serna Iglesias, María José Veure Producció científica UPC
Data: 2009
Tipus de document: Conference lecture
Resum: 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.
URI: http://hdl.handle.net/2117/13077
Apareix a les col·leccions:Altres. Enviament des de DRAC
ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals. Ponències/Comunicacions de congressos
Departament de Ciències de la Computació. Ponències/Comunicacions de congressos
Comparteix:


Stats Mostra les estadístiques d'aquest ítem

SFX Query

Aquest ítem (excepte textos i imatges no creats per l'autor) està subjecte a una llicència de Creative Commons Llicència Creative Commons
Creative Commons

 

Valid XHTML 1.0! Programari DSpace Copyright © 2002-2004 MIT and Hewlett-Packard Comentaris
Universitat Politècnica de Catalunya. Servei de Biblioteques, Publicacions i Arxius