Skip to main content

Prediction Based Quantile Filter for Top-k Query Processing in Wireless Sensor Networks

  • Conference paper
Intelligent Computing Theories and Technology (ICIC 2013)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 7996))

Included in the following conference series:

  • 3032 Accesses

Abstract

Processing top-k queries in energy-efficient manner is an important topic in wireless sensor networks. It can keep sensor nodes from transmitting redundant data to base station by filtering methods utilizing thresholds on sensor nodes, which decreases the communication cost between the base station and sensor nodes. Quantiles installed on sensor nodes as thresholds can filter many unlikely top-k results from transmission for saving energy. However, existing quantile filter methods consume much energy when getting the thresholds. In this paper, we develop a new top-k query algorithm named QFBP which is to get thresholds by prediction. That is, QFBP algorithm predicts the next threshold on a sensor node based on historical information by AutoregRessive Integrated Moving Average models. By predicting using ARIMA time series models, QFBF can decrease the communication cost of maintaining thresholds. Experimental results show that our QFBP algorithm is more energy-efficient than existing quantile filter algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Intel Berkeley Research Lab, http://www.select.cs.cmu.edu/data/labapp3/index.html

  2. Abbasi, A., Khonsari, A., Farri, N.: MOTE: Efficient Monitoring of Top-k Set in Sensor Networks. In: IEEE Symposium on Computers and Communications (ISCC), pp. 957–962 (2008)

    Google Scholar 

  3. Akyildiz, I., Su, W., Sankarasubramaniam, Y., et al.: Wireless sensor networks: a survey. The International Joural of Computer and Telecommunications Networking 38(4), 393–422 (2002)

    Google Scholar 

  4. Anastasi, G., Conti, M., Francesco, M., et al.: Energy conservation in wireless sensor networks: A survey. Ad Hoc Networks (2009)

    Google Scholar 

  5. Chen, B., Liang, W.: Energy-Efficient Top-k Query Processing in Wireless Sensor Networks. In: Proc. of the 19th ACM International Conference on Information and Knowledge Management (CIKM), pp. 329–338 (2010)

    Google Scholar 

  6. Cho, Y.H., Son, J., Chung, Y.D.: POT: An Efficient Top-k Monitoring Method for Spatially Correlated Sensor Readings. In: Proc. of the 5th Workshop on Data Management for Sensor Networks (DMSN), pp. 8–13 (2008)

    Google Scholar 

  7. Iiyas, I., Beskales, G., Soliman, M.: A survey of top-k query processing techniques in relational database systems. ACM Computing Surveys (CSUR) 40(4), 1–11 (2008)

    Google Scholar 

  8. Liu, C., Wu, K., Tsao, M.: Energy Efficient Information Collection with the ARIMA model in Wireless Sensor Networks. In: Proc. of Global Telecommunications Conference, pp. 2470–2474. IEEE (2005)

    Google Scholar 

  9. Liu, X., Xu, J., Lee, et al.: A Cross Pruning Framework for Top-k Data Collection in Wireless Sensor Networks. In: Proc. of the 11th International Conference on Mobile Data Management (MDM), pp. 157–166 (2010)

    Google Scholar 

  10. Madden, S., Franklin, M., Hellerstein, J., et al.: TAG: A tiny aggregation service for ad-hoc sensor networks. In: Proc. of USENIX OSDI, pp. 131–146 (2002)

    Google Scholar 

  11. Mai, H., Lee, Y., Lee, K., et al.: Distributed adaptive top-k monitoring in wireless sensor networks. The Journal of Systems and Software, 314–327 (2011)

    Google Scholar 

  12. Soliman, M.A., Ilyas, I.F., et al.: Probabilistic top-k and ranking-aggregate queries. ACM Trans. on Database Systems (TODS) 33(3), 13 (2008)

    Google Scholar 

  13. Soliman, M.A., Ilyas, I.F.: Top-k Query Processing in Uncertain Databases. In: Proc. of the 23nd Int Conf on Data Engineering (ICDE), pp. 896–905 (2007)

    Google Scholar 

  14. Thanh, M., Lee, K., Lee, Y., et al.: Processing Top-k Monitoring Queries in Wireless Sensor Networks. In: Proc. of Third International Conference on Sensor Technologies and Applications, pp. 545–552. 545-552 (2009)

    Google Scholar 

  15. Tulone, D., Madden, S.: PAQ: Time series forecasting for approximate query answering in sensor networks. In: Römer, K., Karl, H., Mattern, F. (eds.) EWSN 2006. LNCS, vol. 3868, pp. 21–37. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  16. Wu, M., Xu, J., Tang, X., et al.: Top-k Monitoring Top-k Query in Wireless Sensor Networks. IEEE Trans. on Knowledge and Data Engineering, 962–976 (2006)

    Google Scholar 

  17. Wu, M., Xu, J., Tang, X., et al.: Monitoring Top-k Query in Wireless Sensor Networks. In: Proc. of the 22nd International Conference on Data Engineering, ICDE (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, H., Zheng, J., Han, Q., Song, B., Wang, H. (2013). Prediction Based Quantile Filter for Top-k Query Processing in Wireless Sensor Networks. In: Huang, DS., Jo, KH., Zhou, YQ., Han, K. (eds) Intelligent Computing Theories and Technology. ICIC 2013. Lecture Notes in Computer Science(), vol 7996. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39482-9_44

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-39482-9_44

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-39481-2

  • Online ISBN: 978-3-642-39482-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics