A Calculus for Sensor Networks

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We consider the problem of providing a rigorous model for programming wireless sensor networks. Assuming that collisions, packet losses, and errors are dealt with at the lower layers of the protocol stack, we propose a Calculus for Sensor Networks (CSN) that captures the main abstractions for programming applications for this class of devices. Besides providing the syntax and semantics for the calculus, we show its expressiveness by providing implementations for several examples of typical operations on sensor networks. Also included is a detailed discussion of possible extensions to CSN that enable the modeling of other important features of these networks such as sensor state, sampling strategies, and network security.
24 pages, 1 figure, submitted for publication

Keywords

Distributed, Parallel, and Cluster Computing, Programming Languages

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/120252

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0612093
 http://arxiv.org/abs/cs/0612093

Collections

arXiv