ACM Home Page
Please provide us with feedback. Feedback
TAG: a Tiny AGgregation service for ad-hoc sensor networks
Full text PdfPdf (2.19 MB)
Source ACM SIGOPS Operating Systems Review archive
Volume 36 ,  Issue SI  (Winter 2002) table of contents
OSDI '02: Proceedings of the 5th symposium on Operating systems design and implementation
SPECIAL ISSUE: Physical interface table of contents
Pages: 131 - 146  
Year of Publication: 2002
ISSN:0163-5980
Authors
Samuel Madden  UC Berkeley
Michael J. Franklin  UC Berkeley
Joseph M. Hellerstein  UC Berkeley
Wei Hong  Intel Research, Berkeley
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 18,   Downloads (12 Months): 100,   Citation Count: 49
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/844128.844142
What is a DOI?

ABSTRACT

We present the Tiny AGgregation (TAG) service for aggregation in low-power, distributed, wireless environments. TAG allows users to express simple, declarative queries and have them distributed and executed efficiently in networks of low-power, wireless sensors. We discuss various generic properties of aggregates, and show how those properties affect the performance of our in network approach. We include a performance study demonstrating the advantages of our approach over traditional centralized, out-of-network methods, and discuss a variety of optimizations for improving the performance and fault tolerance of the basic solution.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
 
3
D. Barbarfá, W. DuMouchel, C. Faloutsos, P. J. Haas, J. M. Hellerstein, Y. E. Ioannidis, H. Jagadish, T. Johnson, R. T. Ng, V. Poosala, K. A. Ross, and K. C. Sevcik. The New Jersey data reduction report. Data Engineering Bulletin, 20(4):3--45, 1997.
4
5
 
6
 
7
D. Ganesan. Network dynamics in rene motes. PowerPoint Presentation, January 2002.
8
 
9
10
11
 
12
C. Intanagonwiwat, D. Estrin, R. Govindan, and J. Heidemann. Impact of network density on data aggregation in wireless sensor networks. Submitted for Publication, ICDCS-22, November 2001.
13
 
14
J. Kulik, W. Rabiner, and H. Balakrishnan. Adaptive protocols for information dissemination in wireless sensor networks. In MobiCOM, 1999.
 
15
P.-Å. Larson. Data reduction by partial preaggregation. In ICDE, 2002.
 
16
P. Levis and D. Culler. Maté: A tiny virtual machine for sensor networks. Submitted for Publication.
 
17
J. Lin and S. Paul. RMTP: A Reliable Multicast Transport Protocol. In INFOCOM, pages 1414--1424, 1996.
 
18
S. Madden and M. J. Franklin. Fjording the stream: An architechture for queries over streaming sensor data. In ICDE, 2002.
 
19
S. Madden, W. Hong, J. Hellerstein, and M. Franklin. TinyDB web page. http://telegraph.cs.berkeley.edu/tinydb.
 
20
21
 
22
 
23
 
24
25
26
 
27
 
28
 
29
 
30
D. L. Tennenhouse, J. M. Smith, W. D. Sincoskie, D. J. Wetherall, and G. J. Minden. A survery of active network research. IEEE Communications, 1997.
 
31
UC Berkeley. Smart buildings admit their faults. Web Page, November 2001. Lab Notes: Research from the College of Engineering, UC Berkeley. http://coe.berkeley.edu/labnotes/1101.smartbuildings.html.
32
 
33
 
34
W. Ye, J. Heidemann, and D. Estrin. An energy-efficient MAC protocol for wireless sensor networks. In IEEE Infocom, 2002.
 
35
A. Yu and J. Chen. The POSTGRES95 User Manual. UC Berkeley, 1995.

CITED BY  49

Collaborative Colleagues:
Samuel Madden: colleagues
Michael J. Franklin: colleagues
Joseph M. Hellerstein: colleagues
Wei Hong: colleagues