Sign up & Download
Sign in

Hood: a neighborhood abstraction for sensor networks

by Kamin Whitehouse, Cory Sharp, Eric Brewer, David Culler
MobiSys 04 Proceedings of the 2nd international conference on Mobile systems applications and services (2004)

Abstract

This paper proposes a neighborhood programming abstraction for sensor networks, wherein a node can identify a subset 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 neighborhood 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 complexity, inter-component coupling, and total lines of code. The abstraction as defined here has been successfully used to implement several complex applications and is shown to capture the essence of many more existing distributed sensor network algorithms.

Cite this document (BETA)

Sign up today - FREE

Mendeley saves you time finding and organizing research. Learn more

  • All your research in one place
  • Add and import papers easily
  • Access it anywhere, anytime

Start using Mendeley in seconds!

Already have an account? Sign in

Readership Statistics

21 Readers on Mendeley
by Discipline
 
 
 
by Academic Status
 
43% Ph.D. Student
 
10% Post Doc
 
10% Researcher (at an Academic Institution)
by Country
 
38% United States
 
10% China
 
10% Sweden

Groups

pool