Energy efficient schemes for accuracy-guaranteed sensor data aggregation using scalable counting

IEEE Transactions on Knowledge and Data Engineering

Volumn 24, Issue 8, 2012, Pages 1463-1477

  Fan, Yao Chung ^a   Chen, Arbee L P ^b  

^a NATIONAL TSING HUA UNIVERSITY   (Taiwan)

^b NATIONAL CHENGCHI UNIVERSITY   (Taiwan)

Author keywords

distributed data structures; query processing; reliability and robustness; Wireless sensor networks

Indexed keywords

COMMUNICATION FAILURE; DISTRIBUTED DATA STRUCTURES; ENERGY EFFICIENT; NOVEL TECHNIQUES; RELIABILITY AND ROBUSTNESS; SENSOR DATA; SENSOR DATA AGGREGATION; SENSOR READINGS; THEORETICAL RESULT;

DATA STRUCTURES; ENERGY EFFICIENCY; QUERY PROCESSING; SENSOR NODES; WIRELESS SENSOR NETWORKS;

AGGREGATES;

EID: 84863469623     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2011.76     Document Type: Article

References (21)

1. S. Madden et al., "TAG: A Tiny AGgregation service for ad-hoc Sensor Networks," ACM SIGOPS Operating System Rev., vol. 36, no. SI, pp. 131-146, 2002.
2. S.R. Madden et al., "TinyDB: An Acquisitional Query Processing System for Sensor Networks," ACM Trans. Database Systems, vol. 30, no. 1, pp. 122-173, 2005. (Pubitemid 41201813)
3. Y. Yao and J. Gehrke, "The Cougar Approach to In-network Query Processing in Sensor Networks," SIGMOD Record, vol. 31, no. 3, pp. 9-18, 2002.
4. N. Alon, Y. Matias, and M. Szegedy, "The Space Complexity of Approximating the Frequency Moments," Proc. 28th Ann. ACM Symp. Theory of Computing, pp. 137-147, 1996.
5. J.Y. Chen, G. Pandurangan, and D. Xu, "Robust Computation of Aggregates in Wireless Sensor Networks: Distributed Randomized Algorithms and Analysis," IEEE Trans. Parallel and Distributed Systems, vol. 17, no. 9, pp. 987-1000, Sept. 2006. (Pubitemid 44263827)
6. J. Considine et al., "Robust Approximate Aggregation in Sensor Data Management Systems," ACM Trans. Database Systems, vol. 34, no. 1, pp. 1-35, 2009.
7. Y.-C. Fan and A.L.P. Chen, "Efficient and Robust Sensor Data Aggregation Using Linear Counting Sketches," Proc. IEEE 22nd Int'l Symp. Parallel and Distributed Processing, pp. 1-12, 2008.
8. A. Manjhi, S. Nath, and P.B. Gibbons, "Tributaries and Deltas: Efficient and Robust Aggregation in Sensor Network Streams," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 287-298, 2005. (Pubitemid 43038935)
9. S. Nath et al., "Synopsis Diffusion for Robust Aggregation in Sensor Networks," Proc. Second Int'l Conf. Embedded Networked Sensor Systems, pp. 250-262, 2004. (Pubitemid 41563364)
10. M. Durand and P. Flajolet, "LogLog Counting of Large Cardinalities," Proc. Ann. European Symp. Algorithms, pp. 605-617, 2003. (Pubitemid 37325419)
11. P. Flajolet and G.N. Martin, "Probabilistic Counting Algorithms for Data Base Applications," J. Computer and System Science, vol. 31, no. 2, pp. 182-209, 1985.
12. K.-Y. Whang, B.T. Vander-Zanden, and H.M. Taylor, "A Linear-Time Probabilistic Counting Algorithm for Database Applications," ACM Trans. Database Systems, vol. 15, no. 2, pp. 208-229, 1990.
13. Z. Bar-Yossef et al., "Counting Distinct Elements in a Data Stream," Proc. Sixth Int'l Workshop Randomization and Approximation Techniques (RANDOM '02), pp. 1-10, 2002.
14. D. Woodruff, "Optimal Space Lower Bounds for All Frequency Moments," Proc. 15th Ann. ACM-SIAM Symp. Discrete Algorithms, pp. 167-175, 2004.
15. C. Estan, G. Varghese, and M. Fisk, "Bitmap Algorithms for Counting Active Flows on High-Speed Links," IEEE/ACM Trans. Networking, vol. 14, no. 5, pp. 925-937, Oct. 2006. (Pubitemid 44615105)
16. A. Metwally, D. Agrawal, and A.E. Abbadi, "Why Go Logarithmic If We Can Go Linear?: Towards Effective Distinct Counting of Search Traffic," Proc. 11th Int'l Conf. Extending Database Technology: Advances in Database Technology, 2008.
17. M. Charikar et al., "Towards Estimation Error Guarantees for Distinct Values," Proc. 18th ACM SIGMOD-SIGACT-SIGART Symp. Principles of Database Systems, pp. 268-279, 2000.
18. N. Shrivastava et al., "Medians and Beyond: New Aggregation Techniques for Sensor Networks," Proc. Second Int'l Conf. Embedded Networked Sensor Systems, pp. 239-249, 2004. (Pubitemid 41563363)
19. G. Cormode and S. Muthukrishnan, "An Improved Data Stream Summary: The Count-Min Sketch and Its Applications," J. Algorithms, vol. 55, no. 1, pp. 58-75, 2005. (Pubitemid 40357145)
20. A. Pavan and S. Tirthapura, "Range-Efficient Computation of F0 over Massive Data Streams," Proc. 21st Int'l Conf. Data Eng., pp. 32-43, 2005. (Pubitemid 41731113)
21. S. Boyd et al., "Gossip Algorithms: Design, Analysis and Applications," Proc. IEEE 24th Ann. Joint Conf. Computer and Comm., pp. 1653-1664, 2005. (Pubitemid 41390681)