Generative communication in Linda
ACM Transactions on Programming Languages and Systems (TOPLAS)
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
Sparse Power Efficient Topology for Wireless Networks
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
Hood: a neighborhood abstraction for sensor networks
Proceedings of the 2nd international conference on Mobile systems, applications, and services
TinyLIME: Bridging Mobile and Sensor Networks through Middleware
PERCOM '05 Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications
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 wireless sensor networks with logical neighborhoods
InterSense '06 Proceedings of the first international conference on Integrated internet ad hoc and sensor networks
Building virtual sensors and actuators over logical neighborhoods
Proceedings of the international workshop on Middleware for sensor networks
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Programming sensor networks using abstract regions
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Logical neighborhoods: a programming abstraction for wireless sensor networks
DCOSS'06 Proceedings of the Second IEEE international conference on Distributed Computing in Sensor Systems
Building programming abstractions for wireless sensor networks using watershed segmentation
NEW2AN'11/ruSMART'11 Proceedings of the 11th international conference and 4th international conference on Smart spaces and next generation wired/wireless networking
Hi-index | 0.00 |
Wireless Sensor Networks (WSNs) are now enabling applications whose objective is not just to monitor the environment, but also to perform actions on it so as to implement complex control loops. Unlike early WSN projects where the application tasks were mainly relegated to the fringes of the network, e.g., to a powerful base station, in sensing and acting scenarios the application intelligence is brought in the network, and distributed among the nodes [1]. These applications are often composed of many collaborating sub-tasks, each involving only a subset of the nodes in the system. Therefore, the programmers must worry about how to identify these subsets and address them, before concentrating on the application goals. This results in additional programming effort and more complex code, affecting the reliability of the resulting application.In this work, we propose a programming abstraction called Logical Neighborhood, whose goal is to raise the level of abstraction from the physical neighborhood of a node to a logical notion of proximity. The programmers can specify the nodes part of a logical neighborhood using a declarative language we devised, based on application-defined attributes of the nodes. To address the members of a logical neighborhood, our framework provides a general communication API, supported by a dedicated routing scheme. Here, we present the logical neighborhood abstraction, illustrate our dedicated routing solution briefly reporting on some performance results, and point at current and future investigations based on the logical neighborhood abstraction.