The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
The cougar approach to in-network query processing in sensor networks
Abstract
The widespread distribution and availability of small-scale sensors, actuators, and embedded processors is transforming the physical world into a computing platform. One such example is a sensor network consisting of a large number of sensor nodes that combine physical sensing capabilities such as temperature, light, or seismic sensors with networking and computation capabilities. Applications range from environmental control, warehouse inventory, and health care to military environments. Existing sensor networks assume that the sensors are preprogrammed and send data to a central frontend where the data is aggregated and stored for offline querying and analysis. This approach has two major drawbacks. First, the user cannot change the behavior of the system on the fly. Second, conservation of battery power is a major design factor, but a central system cannot make use of in-network programming, which trades costly communication for cheap local computation.In this paper, we introduce the Cougar approach to tasking sensor networks through declarative queries. Given a user query, a query optimizer generates an efficient query plan for in-network query processing, which can vastly reduce resource usage and thus extend the lifetime of a sensor network. In addition, since queries are asked in a declarative language, the user is shielded from the physical characteristics of the network. We give a short overview of sensor networks, propose a natural architecture for a data management system for sensor networks, and describe open research problems in this area.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Ad hoc On-Demand Distance Vector (AODV) Routing
Perkins, C., Belding-Royer, E., & Das, S. (2003) · doi:10.17487/rfc3561 · Cited by 10,686
Dynamic Source Routing in Ad Hoc Wireless Networks
Johnson, D. B., & Maltz, D. A. (2007) · The Kluwer International Series in Engineering and Computer Science · doi:10.1007/978-0-585-29603-6_5 · Cited by 8,518
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
Perkins, C. E., & Bhagwat, P. (1994) · ACM SIGCOMM Computer Communication Review · doi:10.1145/190809.190336 · Cited by 6,678
A performance comparison of multi-hop wireless ad hoc network routing protocols
Broch, J., Maltz, D. A., Johnson, D. B., Hu, Y.-C., & Jetcheva, J. (1998) · Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking · doi:10.1145/288235.288256 · Cited by 4,673
Wireless integrated network sensors
Pottie, G. J., & Kaiser, W. J. (2000) · Communications of the ACM · doi:10.1145/332833.332838 · Cited by 3,219
System architecture directions for networked sensors
Hill, J., Szewczyk, R., Woo, A., Hollar, S., Culler, D., & Pister, K. (2000) · ACM SIGPLAN Notices · doi:10.1145/356989.356998 · Cited by 3,084
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
Perkins, C. E., & Bhagwat, P. (1994) · Proceedings of the conference on Communications architectures, protocols and applications - SIGCOMM '94 · doi:10.1145/190314.190336 · Cited by 2,914
Next century challenges: scalable coordination in sensor networks
Estrin, D., Govindan, R., Heidemann, J., & Kumar, S. (1999) · Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking · doi:10.1145/313451.313556 · Cited by 2,703
Principles of Distributed Database Systems
Özsu, M. T., & Valduriez, P. (2020) · Springer eBooks · doi:10.1007/978-3-030-26253-2 · Cited by 2,345
Adaptive protocols for information dissemination in wireless sensor networks
Heinzelman, W. R., Kulik, J., & Balakrishnan, H. (1999) · Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking · doi:10.1145/313451.313529 · Cited by 2,308
Energy conserving routing in wireless ad-hoc networks
Chang, J.-H., & Tassiulas, L. (2002) · Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064) · doi:10.1109/infcom.2000.832170 · Cited by 1,669
Next century challenges: mobile networking for “Smart Dust”
Kahn, J. M., Katz, R. H., & Pister, K. S. J. (1999) · Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking · doi:10.1145/313451.313558 · Cited by 1,660
Hellerstein, J. M., Haas, P. J., & Wang, H. J. (1997) · Proceedings - ACM-SIGMOD International Conference on Management of Data · doi:10.1145/253260.253291 · Cited by 902
The state of the art in distributed query processing
Kossmann, D. (2000) · ACM Computing Surveys · doi:10.1145/371578.371598 · Cited by 813
Eddies: continuously adaptive query processing
Avnur, R., & Hellerstein, J. M. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335420 · Cited by 798
Handbook of multisensor data fusion
Hall, D. L., & Llinas, J. (2001) · CRC Press eBooks · Cited by 784
Distributed Databases: Principles and Systems
Ceri, S., & Pelagatti, G. (1984) · CERN Document Server (European Organization for Nuclear Research) · Cited by 713
Parasitic power harvesting in shoes
Kymissis, J., Kendall, C., Paradiso, J., & Gershenfeld, N. (2002) · Digest of Papers. Second International Symposium on Wearable Computers (Cat. No.98EX215) · doi:10.1109/iswc.1998.729539 · Cited by 621
(2001) · doi:10.1201/9781420038545 · Cited by 397
Eddies: continuously adaptive query processing
Avnur, R., & Hellerstein, J. M. (2000) · Proceedings of the 2000 ACM SIGMOD international conference on Management of data · doi:10.1145/342009.335420 · Cited by 381
Ripple joins for online aggregation
Haas, P. J., & Hellerstein, J. M. (1999) · ACM SIGMOD Record · doi:10.1145/304181.304208 · Cited by 369
Efficient mid-query re-optimization of sub-optimal query execution plans
Kabra, N., & DeWitt, D. J. (1998) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/276304.276315 · Cited by 331
Automatically Extracting Structure from Free Text Addresses.
Borkar, V., Deshmukh, K., & Sarawagi, S. (2000) · Cited by 313
Yu, C. T., & Chang, C. C. (1984) · ACM Computing Surveys · doi:10.1145/3872.3874 · Cited by 239
Piconet: embedded mobile networking
Bennett, F., Clarke, D., Evans, J. B., Hopper, A., Jones, A., & Leask, D. (1997) · IEEE Personal Communications · doi:10.1109/98.626977 · Cited by 213
Cost-based query scrambling for initial delays
Urhan, T., Franklin, M. J. M., & Amsaleg, L. (1998) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/276304.276317 · Cited by 211
An Architectural Overview of QNX
Hildebrand, D. (1992) · Cited by 199
Scrambling query plans to cope with unexpected delays
Amsaleg, L., Tomasic, A., Franklin, M. J. M., & Urhan, T. (2002) · International Conference on Parallel and Distributed Information Systems · doi:10.1109/pdis.1996.568681 · Cited by 102
Cited by
Routing techniques in wireless sensor networks: a survey
Al-Karaki, J. N., & Kamal, A. E. (2004) · IEEE Wireless Communications · doi:10.1109/mwc.2004.1368893 · Cited by 4,500
A survey on routing protocols for wireless sensor networks
Akkaya, K., & Younis, M. (2005) · Ad Hoc Networks · doi:10.1016/j.adhoc.2003.09.010 · Cited by 3,491
Sensor networks: Evolution, opportunities, and challenges
Chong, C.-Y., & Kumar, S. P. (2003) · Proceedings of the IEEE · doi:10.1109/jproc.2003.814918 · Cited by 3,079
TOSSIM: accurate and scalable simulation of entire TinyOS applications
Levis, P., Lee, N., Welsh, M., & Culler, D. (2003) · Proceedings of the 1st international conference on Embedded networked sensor systems · doi:10.1145/958491.958506 · Cited by 1,999
TinyDB: an acquisitional query processing system for sensor networks
Madden, S. R., Franklin, M. J., Hellerstein, J. M., & Hong, W. (2005) · ACM Transactions on Database Systems · doi:10.1145/1061318.1061322 · Cited by 1,899
Metadata
- Authors
- Yao, Y., & Gehrke, J.
- Venue
- ACM SIGMOD Record
- Published
- 2002-09
- Volume
- 31
- Issue
- 3
- Pages
- 9-18
- ISSN
- 0163-5808 (ISSN-L)
- OpenAlex
- W2125572812
- Cited by
- 1,328
- References
- 28
- FWCI
- 55.89
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.