ADHOC-NOW 2011: Ad-hoc, Mobile, and Wireless Networks pp 322-331 | Cite as
On Cardinality Estimation Protocols for Wireless Sensor Networks
Abstract
In this article we address the problem of estimating a size of wireless sensor networks (WSNs). We restrict our attention to sensors with very limited storage capabilities. The problem arises when sensors have to quickly obtain approximate size of the network to use algorithms which require such information. Another application area is the problem of counting the number of different objects (e.g. people in public bus transportation) and use of such information to optimize the routes and frequency of buses. In this paper we present two-phase probabilistic algorithm based on order statistics and balls-bins model which effectively solves the presented problem.
Keywords
cardinalities estimation sensor networksPreview
Unable to display preview. Download preview PDF.
References
- 1.Cichon, J., Kapelko, R., Lemiesz, J., Zawada, M.: On alarm protocol in wireless sensor networks. In: ADHOC-NOW, pp. 43–52 (2010)Google Scholar
- 2.Flajolet, P., Martin, G.N.: Probabilistic counting algorithms for data base applications. J. Comput. Syst. Sci. 31(2), 182–209 (1985)CrossRefMATHGoogle Scholar
- 3.Whang, K.-Y., Zanden, B.T.V., Taylor, H.M.: A linear-time probabilistic counting algorithm for database applications. ACM Trans. Database Syst. 15(2), 208–229 (1990)CrossRefGoogle Scholar
- 4.Bar-Yossef, Z., Jayram, T.S., Kumar, R., Sivakumar, D., Trevisan, L.: Counting distinct elements in a data stream. In: Rolim, J.D.P., Vadhan, S.P. (eds.) RANDOM 2002. LNCS, vol. 2483, pp. 1–10. Springer, Heidelberg (2002)CrossRefGoogle Scholar
- 5.Flajolet, P., Fusy, E., Gandouet, O.: HyperLogLog: the analysis of a near-optimal cardinality estimation algorithm. In: Conference on Analysis of Algorithms, AofA 2007 (2007)Google Scholar
- 6.Giroire, F.: Order statistics and estimating cardinalities of massive data sets. Discrete Applied Mathematics 157(2), 406–427 (2009)CrossRefMATHGoogle Scholar
- 7.Lumbroso, J.: An optimal cardinality estimation algorithm based on order statistics and its full analysis. In: AofA 2010. Discrete Mathematics and Theoretical Computer Science, vol. 5333, pp. 491–506 (2010)Google Scholar
- 8.Arnold, B.C., Balakrishnan, N., Nagaraja, H.N.: A First Course in Order Statistics. John Wiley & Sons, New York (1992)MATHGoogle Scholar
- 9.Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, New York (2005)CrossRefMATHGoogle Scholar