Next century challenges: scalable coordination in sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
System architecture directions for networked sensors
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
Wireless sensor networks for habitat monitoring
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Directed diffusion for wireless sensor networking
IEEE/ACM Transactions on Networking (TON)
The nesC language: A holistic approach to networked embedded systems
PLDI '03 Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation
Hood: a neighborhood abstraction for sensor networks
Proceedings of the 2nd international conference on Mobile systems, applications, and services
TinyDB: an acquisitional query processing system for sensor networks
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Programming ad-hoc networks of mobile and resource-constrained devices
Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation
Algorithms for generic role assignment in wireless sensor networks
Proceedings of the 3rd international conference on Embedded networked sensor systems
Programming sensor networks using abstract regions
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Using logical neighborhoods to enable scoping in wireless sensor networks
Proceedings of the 3rd international Middleware doctoral symposium
Building virtual sensors and actuators over logical neighborhoods
Proceedings of the international workshop on Middleware for sensor networks
Complex query processing in wireless sensor networks
Proceedings of the 2nd ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
Scenes: Abstracting interaction in immersive sensor networks
Pervasive and Mobile Computing
An adaptive communication architecture for wireless sensor networks
Proceedings of the 5th international conference on Embedded networked sensor systems
Programming wireless sensor networks with logical neighborhoods: a road tunnel use case
Proceedings of the 5th international conference on Embedded networked sensor systems
An interrelational grouping abstraction for heterogeneous sensors
ACM Transactions on Sensor Networks (TOSN)
Programming pervasive and mobile computing applications: The TOTA approach
ACM Transactions on Software Engineering and Methodology (TOSEM)
A compilation framework for macroprogramming networked sensors
DCOSS'07 Proceedings of the 3rd IEEE international conference on Distributed computing in sensor systems
Programming wireless sensor networks: Fundamental concepts and state of the art
ACM Computing Surveys (CSUR)
LARK: A Lightweight Authenticated ReKeying Scheme for Clustered Wireless Sensor Networks
ACM Transactions on Embedded Computing Systems (TECS)
Logical neighborhoods: a programming abstraction for wireless sensor networks
DCOSS'06 Proceedings of the Second IEEE international conference on Distributed Computing in Sensor Systems
Addressing the semantic gap between video sensors and applications
Proceeding of the 23rd ACM Workshop on Network and Operating Systems Support for Digital Audio and Video
| Hi-index | 0.00 |
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.