Hood: A Neighborhood Abstraction for Sensor Networks
This paper proposes a neighborhood programming abstrac-tion for sensor networks, wherein a node can identify a sub-set of nodes around it by a variety of criteria and share state with those nodes. This abstraction allows developers to design distributed algorithms in terms of the neighbor-hood abstraction itself, instead of decomposing them into component parts such as messaging protocols, data caches, and neighbor lists. In those applications that are already neighborhood-based, this abstraction is shown to facilitate good application design and to reduce algorithmic complex-ity, inter-component coupling, and total lines of code. The abstraction as defined here has been successfully used to im-plement several complex applications and is shown to cap-ture the essence of many more existing distributed sensor network algorithms.
