Complicated Event Query Processing Algorithms in Wireless Sensor Networks

Article Preview

Abstract:

In this paper, we propose two bloom filter based algorithms to solve the complicated event query adopting the separate DCS scheme. By using bloom filter, the communication cost involved in the procedure of query processing can be reduced. Experimental results show that our bloom filter based complicated event query processing algorithms achieve significant performance improvement in terms of energy consumption.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 482-484)

Pages:

206-209

Citation:

Online since:

February 2012

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Information on http://www.xbow.com/

Google Scholar

[2] R. Ratnasamy, B. Karp, L. Yin etc. GHT: a Geographic Hash Table for Data Centric Storage. in Proceedings of WSNA, 2002.

DOI: 10.1145/570738.570750

Google Scholar

[3] H. H. Chan, M. Li, H. Jin etc. MDS: Efficient Multi-dimensional Query Processing in Data-centric WSNs. in Proceedings of RTSS, 2008.

DOI: 10.1109/rtss.2008.26

Google Scholar

[4] X. Li, Y. J. Kim, R. Govindan etc. Multi-dimensional Range Queries in Sensor Networks. in Proceedings of ACM SenSys, 2003.

Google Scholar

[5] X. Liu, Q. F. Huang and Y. Zhang. Comb, Needles, Haystacks: Balancing Push and Pull for Discovery in Large-scale Sensor Networks. in Proceedings of ACM SenSys, 2004.

DOI: 10.1145/1031495.1031510

Google Scholar

[6] R. Sarkar, X. Zhu and J. Gao. Double Rulings for Information Brokerage in Sensor Networks. in Proceedings of ACM MobiCom, 2006.

Google Scholar

[7] D. Guo, Y. Liu, X. Li and P. Yang. False Negative Problem of Counting Bloom Filter. IEEE/ACM TKDE, Vol. 22(5), pp.651-664, 2011.

DOI: 10.1109/tkde.2009.209

Google Scholar