Privacy Preserving Gate Counting with Collaborative Bluetooth Scanners | SpringerLink
Skip to main content

Privacy Preserving Gate Counting with Collaborative Bluetooth Scanners

  • Conference paper
On the Move to Meaningful Internet Systems: OTM 2011 Workshops (OTM 2011)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 7046))

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.

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

Access this chapter

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 5719
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 7149
Price includes VAT (Japan)
  • 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.

Similar content being viewed by others

References

  1. Almeida, P.S., Baquero, C., Preguiça, N.M., Hutchison, D.: Scalable bloom filters. Information Processing Letters 101, 255–261 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bloom, B.: Space/time trade-offs in hash coding with allowable errors. Communications of the ACM 13(7), 422–426 (1970)

    Article  MATH  Google Scholar 

  3. 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)

    Chapter  Google Scholar 

  4. 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)

    Article  Google Scholar 

  5. 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)

    Google Scholar 

  6. Flajolet, P., Nigel Martin, G.: Probabilistic counting algorithms for data base applications. Journal of Computer and System Sciences 31(2), 182–209 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  7. É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)

    Google Scholar 

  8. 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)

    Chapter  Google Scholar 

  9. 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)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics