Abstract
Count queries in wireless sensor networks (WSNs) report the number of sensor nodes whose measured values satisfy a given predicate. However, measurements in WSNs are typically imprecise due, for instance, to limited accuracy of the sensor hardware. In this context, we present four algorithms for computing continuous probabilistic count queries on a WSN, i.e., given a query Q we compute a probability distribution over the number of sensors satisfying Q’s predicate. These algorithms aim at maximizing the lifetime of the sensors by minimizing the communication overhead and data processing cost. Our performance evaluation shows that by using a distributed and incremental approach we are able to reduce the number of message transfers within the WSN by up to a factor of 5 when compared to a straightforward centralized algorithm.
Research partially supported by NSERC (Canada) and DAAD (Germany).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Hua, M., et al.: Ranking queries on uncertain data: a probabilistic threshold approach. In: Proc. of ACM SIGMOD, pp. 673–686 (2008)
Schurgers, C., et al.: Optimizing sensor networks in the energy-latency-density design space. IEEE TMC 1, 70–80 (2002)
Madden, S., et al.: Tag: a tiny aggregation service for ad-hoc sensor networks. SIGOPS Operating Systems Review 36, 131–146 (2002)
Dalvi, N., Suciu, D.: Efficient query evaluation on probabilistic databases. The VLDB Journal 16, 523–544 (2007)
Cheng, R., et al.: Efficient indexing methods for probabilistic threshold queries over uncertain data. In: Proc. of VDLB, pp. 876–887 (2004)
Kriegel, H.P., et al.: Probabilistic similarity join on uncertain data. In: Li Lee, M., Tan, K.-L., Wuwongse, V. (eds.) DASFAA 2006. LNCS, vol. 3882, pp. 295–309. Springer, Heidelberg (2006)
Bernecker, T., et al.: Scalable probabilistic similarity ranking in uncertain databases. IEEE TKDE 22(9), 1234–1246 (2010)
Sarma, A., et al.: Working models for uncertain data. In: Proc. of IEEE ICDE, pp. 7–7 (2006)
Ross, R., Subrahmanian, V.S., Grant, J.: Aggregate operators in probabilistic databases. J. ACM 52, 54–101 (2005)
Soliman, M.A., Ilyas, I.F., Chang, K.C.C.: Top-k query processing in uncertain databases. In: Proc. of IEEE ICDE, pp. 896–905 (2007)
Yi, K., et al.: Efficient processing of top-k queries in uncertain databases. In: Proc. of IEEE ICDE, pp. 1406–1408 (2008)
Cormode, G., Li, F., Yi, K.: Semantics of ranking queries for probabilistic data and expected ranks. In: Proc. of IEEE ICDE, pp. 305–316 (2009)
Li, J., Saha, B., Deshpande, A.: A unified approach to ranking in probabilistic databases. Proc. of VLDB 2, 502–513 (2009)
Malhotra, B., Nascimento, M.A., Nikolaidis, I.: Exact top-k queries in wireless sensor networks. IEEE TKDE (2010) (to appear)
Ye, W., Heidemann, J., Estrin, D.: An energy-efficient mac protocol for wireless sensor networks. In: Proc. of IEEE INFOCOM, pp. 1567–1576 (2002)
Pinedo-Frausto, E., Garcia-Macias, J.: An experimental analysis of zigbee networks. In: 33rd IEEE Conference on Local Computer Networks, LCN 2008, pp. 723–729 (2008)
Wang, S., Wang, G., Gao, X., Tan, Z.: Frequent items computation over uncertain wireless sensor network. In: Proc. of ICHIS, pp. 223–228 (2009)
Kripke, S.A.: Semantical analysis of modal logic i normal modal propositional calculi. Mathematical Logic Quaterly 9, 67–96 (1963)
Antova, L., Koch, C., Olteanu, D.: 10 worlds and beyond: efficient representation and processing of incomplete information. The VLDB Journal 18, 1021–1040 (2009)
Lange, K.: Numerical analysis for statisticians. Springer, Heidelberg (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Follmann, A., Nascimento, M.A., Züfle, A., Renz, M., Kröger, P., Kriegel, HP. (2011). Continuous Probabilistic Count Queries in Wireless Sensor Networks. In: Pfoser, D., et al. Advances in Spatial and Temporal Databases. SSTD 2011. Lecture Notes in Computer Science, vol 6849. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22922-0_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-22922-0_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22921-3
Online ISBN: 978-3-642-22922-0
eBook Packages: Computer ScienceComputer Science (R0)