Latest revision as of 08:41, 2 February 2021

Abstract

Wireless sensor network (WSN) architectures often feature a (single) base station in charge of coordinating the application functionality. Although this assumption simplified the path to adoption of WSN technology, researchers are now being attracted by more decentralized architectures with multiple sinks and heterogeneous nodes. These scenarios are brought to an extreme in Wireless Sensor and Actor Networks (WSANs), where sensing and acting nodes collaborate in a decentralized fashion to implement complex control loops. In these settings, new programming abstractions are required to manage complexity and heterogeneity without sacrificing efficiency.In this paper we propose and define a logical neighborhood programming abstraction. A logical neighborhood includes nearby nodes that satisfy predicates over their static (e.g., type) or dynamic (e.g., sensed values) characteristics. The span of the neighborhood and the definition of its predicates are specified declaratively, along with requirements about the cost of the communication involved. Logical neighborhoods enable the programmer to "illuminate" different areas of the network according to the application needs, effectively replacing the physical neighborhood provided by wireless broadcast with a higher-level, application-defined notion of proximity.This paper presents the definition of a declarative language for specifying logical neighborhoods, highlighting its expressiveness, flexibility and simplicity. Moreover, although the language constructs are readily implemented using existing communication mechanisms, we briefly report about a novel routing scheme we expressly designed to support efficiently our abstractions.

Original document

The different versions of the original document can be found in:

• http://dit.unitn.it/~picco/papers/mottola07programming.pdf

• http://hdl.handle.net/11311/263366

• https://re.public.polimi.it/retrieve/handle/11311/263366/214057/mottola06programming.pdf

• http://disi.unitn.it/~picco/papers/intersense06.pdf,

https://www.sics.se/%7eluca/papers/mottola06programming.pdf,

http://core.ac.uk/display/24412457,

https://home.deib.polimi.it/mottola/papers/mottola06programming.pdf,

https://doi.acm.org/10.1145/1142680.1142691,

https://dblp.uni-trier.de/db/conf/intersense/intersense2006.html#MottolaP06,

https://re.public.polimi.it/handle/11311/263366,

https://dl.acm.org/citation.cfm?id=1142691,

https://sicstus.sics.se/~luca/papers/mottola06programming.pdf,

https://eudl.eu/doi/10.1145/1142680.1142691,

http://www.sics.se/%7eluca/papers/mottola06programming.pdf,

https://academic.microsoft.com/#/detail/2031313852

• http://disi.unitn.it/~picco/papers/mottola07programming.pdf,

https://dblp.uni-trier.de/db/conf/sensys/sensys2007.html#MottolaP07,

http://portal.acm.org/citation.cfm?doid=1322263.1322311,

https://dl.acm.org/citation.cfm?doid=1322263.1322311,

https://doi.org/10.1145/1322263.1322311,

https://dl.acm.org/citation.cfm?id=1322311,

https://academic.microsoft.com/#/detail/1980444604

• http://dl.acm.org/ft_gateway.cfm?id=1142691&ftid=361005&dwn=1,

http://dx.doi.org/10.1145/1142680.1142691

• http://dl.acm.org/ft_gateway.cfm?id=1322311&ftid=479899&dwn=1,

http://dx.doi.org/10.1145/1322263.1322311

DOIS: 10.1145/1142680.1142691 10.1145/1322263.1322311