Mostra el registre d'ítem simple

dc.contributor.authorÁlvarez Faura, M. del Carme
dc.contributor.authorDuch Brown, Amalia
dc.contributor.authorGabarró Vallès, Joaquim
dc.contributor.authorSerna Iglesias, María José
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics
dc.date.accessioned2011-07-29T09:41:36Z
dc.date.available2011-07-29T09:41:36Z
dc.date.created2009
dc.date.issued2009
dc.identifier.citationAlvarez, 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.urihttp://hdl.handle.net/2117/13077
dc.description.abstractIn 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.extent12 p.
dc.language.isoeng
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights.urihttp://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.lcshSensor networks
dc.subject.otherTiny artifacts
dc.subject.otherSensors
dc.subject.otherComputational models
dc.subject.otherData streams
dc.subject.otherAverage monitoring problem
dc.subject.otherAlerting problem
dc.subject.otherStatic synchronous sensor field
dc.titleSensor field: a computational model
dc.typeConference lecture
dc.subject.lemacXarxes de sensors
dc.contributor.groupUniversitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals
dc.description.peerreviewedPeer Reviewed
dc.rights.accessOpen Access
local.identifier.drac2471927
dc.description.versionPostprint (author’s final draft)
local.citation.authorAlvarez, M.; Duch, A.; Gabarro, J.; Serna, M.
local.citation.contributorInternational Workshop on Algorithmic Aspects of Wireless Sensor Networks
local.citation.pubplaceRhodes
local.citation.publicationName5th International Workshop on Algorithmic Aspects of Wireless Sensor Networks
local.citation.startingPage5
local.citation.endingPage16


Fitxers d'aquest items

Thumbnail

Aquest ítem apareix a les col·leccions següents

Mostra el registre d'ítem simple