Abstract
Interest dissemination in constrained environments such as wireless sensor networks utilizes Bloom filters commonly. A Bloom filter is a probabilistic data structure of fixed length, which can be used to encode the set of sensor nodes to be awake. In this way an application can disseminate interest in specific sensor nodes by broadcasting the Bloom filter throughout the complete wireless sensor network. The probabilistic nature of a Bloom filter induces false positives, that is some sensor nodes will be awake without the application having interest in their sensor values. As the interest is often depending on location such as in adaptive sampling applications, we present a novel method to encode both interest and possible location of information into one probabilistic data structure simultaneously. While our algorithm is able to encode any kind of tree-structured information into a fixed length bit array we exemplify its use through a wireless sensor network. In comparison to traditional Bloom encoding techniques we are able to reduce the overall number of false positives and furthermore reduce the average distance of false positives from the next true positive of the same interest. In our example this helps to reduce the overall energy consumption of the sensor network by only requesting sensor nodes that are likely to store the requested information.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
That is, because the root node’s OVSF code is precisely one bit long.
References
Almeida, P.S., Baquero, C., Preguia, N., Hutchison, D.: Scalable bloom filters. Inf. Process. Lett. 101(6), 255–261 (2007)
Bloom, B.H.: Space/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422–426 (1970)
Bose, P., Guo, H., Kranakis, E., Maheshwari, A., Morin, P., Morrison, J., Smid, M., Tang, Y.: On the false-positive rate of bloom filters. Inf. Process. Lett. 108(4), 210–213 (2008)
Dharmapurikar, S., Krishnamurthy, P., Sproull, T.S., Lockwood, J.W.: Deep packet inspection using parallel bloom filters. Micro IEEE 24(1), 52–61 (2004)
Jardak, C., Riihijarvi, J., Mahonen, P.: Analyzing the optimal use of bloom filters in wireless sensor networks storing replicas. In: IEEE Wireless Communications and Networking Conference, 2009, WCNC 2009, pp. 1–6. IEEE (2009)
Mitzenmacher, M.: Compressed bloom filters. IEEE/ACM Trans. Netw. 10(5), 604–612 (2002)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Schönfeld, M., Werner, M. (2014). Node Wake-Up via OVSF-Coded Bloom Filters in Wireless Sensor Networks. In: Sherif, M., Mellouk, A., Li, J., Bellavista, P. (eds) Ad Hoc Networks. ADHOCNETS 2013. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 129. Springer, Cham. https://doi.org/10.1007/978-3-319-04105-6_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-04105-6_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-04104-9
Online ISBN: 978-3-319-04105-6
eBook Packages: Computer ScienceComputer Science (R0)