Abstract
Due to its pervasiveness and communication capabilities, Bluetooth can be used as an infrastructure for several situated interaction and massive sensing scenarios. This paper shows how Bluetooth scanning can be used in gate counting scenarios, where the main goal is to provide an accurate count for the number of unique devices sighted. To this end, we present an analysis of several stochastic counting techniques that not only provide an accurate count for the number of unique devices, but offer privacy guarantees as well.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Almeida, P.S., Baquero, C., Preguiça, N.M., Hutchison, D.: Scalable bloom filters. Information Processing Letters 101, 255–261 (2007)
Bloom, B.: Space/time trade-offs in hash coding with allowable errors. Communications of the ACM 13(7), 422–426 (1970)
Durand, M., Flajolet, P.: Loglog Counting of Large Cardinalities. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 605–617. Springer, Heidelberg (2003)
Fan, Y.C., Chen, A.L.P.: Efficient and robust schemes for sensor data aggregation based on linear counting. IEEE Trans. Parallel Distrib. Syst. 21, 1675–1691 (2010)
Fan, Y., Chen, A.: Efficient and robust sensor data aggregation using linear counting sketches. In: IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2008, pp. 1–12 (2008)
Flajolet, P., Nigel Martin, G.: Probabilistic counting algorithms for data base applications. Journal of Computer and System Sciences 31(2), 182–209 (1985)
Éric Fusy, G.O., Meunier, F.: Hyperloglog: The analysis of a near-optimal cardinality estimation algorithm. In: AofA 2007: Proceedings of the 2007 International Conference on Analysis of Algorithms (2007)
O’Neill, E., Kostakos, V., Kindberg, T., Schiek, A.F.g., Penn, A., Fraser, D.S., Jones, T.: Instrumenting the City: Developing Methods for Observing and Understanding the Digital Cityscape. In: Dourish, P., Friday, A. (eds.) UbiComp 2006. LNCS, vol. 4206, pp. 315–332. Springer, Heidelberg (2006)
Whang, K., Vander-Zanden, B., Taylor, H.: A linear-time probabilistic counting algorithm for database applications. ACM Transactions on Database Systems (TODS) 15(2), 229 (1990)
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
Gonçalves, N., José, R., Baquero, C. (2011). Privacy Preserving Gate Counting with Collaborative Bluetooth Scanners. In: Meersman, R., Dillon, T., Herrero, P. (eds) On the Move to Meaningful Internet Systems: OTM 2011 Workshops. OTM 2011. Lecture Notes in Computer Science, vol 7046. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25126-9_65
Download citation
DOI: https://doi.org/10.1007/978-3-642-25126-9_65
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25125-2
Online ISBN: 978-3-642-25126-9
eBook Packages: Computer ScienceComputer Science (R0)