Open Problems in Data Collection Networks
View/ Open
Seltzer_OpenProblems.pdf (230.2Kb)
Access Status
Full text of the requested work is not available in DASH at this time ("restricted access"). For more information on restricted deposits, see our FAQ.Published Version
https://doi.org/10.1145/1133572.1133575Metadata
Show full item recordCitation
Ledlie, Jonathan, Jeffrey Shneidman, Matt Welsh, Mema Roussopoulos, and Margo Seltzer. 2004. Open problems in data collection networks. In Proceedings of the 11th Workshop on ACM SIGOPS European Workshop Leuven (Belgium), September 19-22, 2004, ed. Yolande Berbers, and Miguel Castro. New York, N.Y.: ACM Press.Abstract
Research in sensor networks, continuous queries (CQ), and other domains has been motivated by powerful applications that aim to aggregate, assimilate, and interact with scores of sensor networks in parallel. Numerous system ingredients are necessary to make these applications possible. Sensor network research is building some of these components from the bottom up, dealing with issues such as wireless connectivity and battery life. CQ, peer-to-peer (P2P), and other research areas are building top down, examining in-network services, naming, decentralized queries, and scale. While many research groups use the same types of applications to motivate their work, many of these applications cannot be built today because of missing bridge research. These challenges include: uniting vastly differing devices and services, managing intermittent connectivity, placing in-network services with QoS and other constraints, developing unified security models, and correlating between sensor networks. This paper distills these new problems and outlines one proposed system that explores solutions to these concerns.Citable link to this page
http://nrs.harvard.edu/urn-3:HUL.InstRepos:2962662
Collections
- FAS Scholarly Articles [18179]
Contact administrator regarding this item (to report mistakes or request changes)