A note on efficient aggregate queries in sensor networks

Theoretical Computer Science

Volumn 370, Issue 1-3, 2007, Pages 254-264

  Patt Shamir, Boaz ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Aggregate queries; Communication complexity; Median computation; Sensor networks

Indexed keywords

COMPUTATIONAL COMPLEXITY; DISTRIBUTED COMPUTER SYSTEMS; NETWORK PROTOCOLS; QUERY LANGUAGES;

AGGREGATE QUERIES; COMMUNICATION COMPLEXITY; MEDIAN COMPUTATION; SENSOR NETWORKS;

SENSORS;

EID: 33846207418     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.10.032     Document Type: Article

References (16)

1. Alon N., Matias Y., and Szegedy M. The space complexity of approximating the frequency moments. J. Comput. System Sci. 58 1 (1999) 137-147 Prel. version in STOC'96
2. Jeffrey Considine, Feifei Li, George Kollios, John Byers, Approximate aggregation techniques for sensor databases, in: Proc. 20th Int. Conf. on Data Engineering, ICDE, April 2004, pp. 449-460
3. Marianne Durand, Philippe Flajolet, Loglog counting of large cardinalities, in: Proc. 11th European Symposium on Algorithms, ESA, September 2003, pp. 605-617
4. Michael B. Greenwald, Sanjeev Khanna, Power-conserving computation of order-statistics over sensor networks, in: Proc. 23rd ACM Symp. on Principles of Database Systems, PODS, June 2004, pp. 275-285
5. Bala Kalyanasundaram, Georg Schnitger, The probabilistic communication complexity of set intersection, in: 2nd Annual Structure in Complexity Theory Conference, STRUCTURES, 1987, pp. 41-49
6. David Kempe, Alin Dobra, Johannes Gehrke, Gossip-based computation of aggregate information, in: 44th Annual Symposium on Foundations of Computer Science, 2003, pp. 482-491
7. Kirschenhofer P., and Prodinger H. A result in order statistics related to probabilistic counting. Computing 51 (1993) 15-27
8. Kushilevitz E., and Nisan N. Communication Complexity (1997), Cambridge University Press
9. Samuel Madden, Michael J. Franklin, Joseph M. Hellerstein, Wei Hong, TAG: A tiny aggregation service for ad-hoc sensor networks, in: 5th Ann. Symp. on Operating Systems Design and Implemntation, OSDI, December 2002, pp. 131-146
10. S. Nath, P.B. Gibbons, S. Seshan, Z.R. Anderson, Synopsis diffusion for robust aggregation in sensor networks, in: SenSys'04: Proc. 2nd International Conference on Embedded Networked Sensor Systems, November 2004, pp. 250-262
11. Negro A., Santoro N., and Urrutia J. Efficient distributed selection with bounded messages. IEEE Trans. Parallel and Dist. Systems 8 4 (1997) 397-401
12. Boaz Patt-Shamir, A note on efficient aggregate queries in sensor networks, in: Proc. 23rd Ann. ACM Symp. on Principles of Distributed Computing, July 2004, pp. 283-289
13. Peleg D. Distributed Computing: A Locality-Sensitive Approach (2000), Society for Industrial and Applied Mathematics, Philadelphia, PA, USA
14. Mitali Singh, Viktor K. Prasanna, Optimal energy balanced algorithm for selection in single hop sensor network, in: IEEE International Workshop on Sensor Network Protocols and Applications (SNPA) ICC, May 2003
15. Yao Y., and Gehrke J. The Cougar approach to in-network query processing in sensor networks. ACM SIGMOD Record 31 3 (2002) 9-18
16. Jerry Zhao, Ramesh Govindan, Deborah Estrin, Computing aggregates for monitoring wireless sensor networks, in: The First IEEE International Workshop on Sensor Network Protocols and Applications, SNPA'03, Anchorage, AK, May 2003