Logical Neighborhoods: A Programming Abstraction for . . . (2006)
Cached
Download Links
- [www.elet.polimi.it]
- [dit.unitn.it]
- [www.dit.unitn.it]
- DBLP
Other Repositories/Bibliography
| Venue: | IN PROC. OF THE THE 2 ND INT. CONF. ON DISTRIBUTED COMPUTING ON SENSOR SYSTEMS (DCOSS |
| Citations: | 33 - 15 self |
BibTeX
@INPROCEEDINGS{Mottola06logicalneighborhoods:,
author = {Luca Mottola and Gian Pietro Picco},
title = {Logical Neighborhoods: A Programming Abstraction for . . . },
booktitle = {IN PROC. OF THE THE 2 ND INT. CONF. ON DISTRIBUTED COMPUTING ON SENSOR SYSTEMS (DCOSS},
year = {2006},
publisher = {}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
activities. However, decentralized architectures are rapidly emerging, as witnessed by wireless sensor and actuator networks (WSANs), and in general by solutions involving multiple data sinks, heterogeneous nodes, and in-network coordination. These settings demand new programming abstractions to tame complexity without sacrificing efficiency. In this work we introduce the notion of logical neighborhood, which replaces the physical neighborhood provided by wireless broadcast with a higher-level, application-defined notion of proximity. The span of a logical neighborhood is specified declaratively based on the characteristics of nodes, along with requirements about communication costs. This paper presents the SPIDEY programming language for defining logical neighborhoods, and a routing strategy that efficiently supports the communication enabled by its programming constructs.
