Two-phase cardinality estimation protocols for sensor networks with provable precision

IEEE Wireless Communications and Networking Conference, WCNC

Volumn , Issue , 2012, Pages 2009-2013

  Cichoń, Jacek ^a   Lemiesz, Jakub ^a   Szpankowski, Wojciech ^b   Zawada, Marcin ^a  

^a WROCLAW UNIVERSITY OF TECHNOLOGY   (Poland)

^b PURDUE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BERNOULLI; CARDINALITIES; CARDINALITY ESTIMATIONS; LOW OVERHEAD; ORDER STATISTICS; PROBABILISTIC ALGORITHM; SENSOR RESOURCES;

ALGORITHMS; WIRELESS SENSOR NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

ESTIMATION;

EID: 84864376982     PISSN: 15253511     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WCNC.2012.6214120     Document Type: Conference Paper

References (11)

1. P. Flajolet and G. N. Martin, "Probabilistic counting algorithms for data base applications," J. Comput. Syst. Sci., vol. 31, no. 2, pp. 182-209, 1985.
2. K.-Y. Whang, B. T. V. Zanden, and H. M. Taylor, "A linear-time probabilistic counting algorithm for database applications," ACM Trans. Database Syst., vol. 15, no. 2, pp. 208-229, 1990.
3. P. Flajolet, E. Fusy, O. Gandouet, and F. Meunier, "Hyperloglog: the analysis of a near-optimal cardinality estimation algorithm," in Conference on Analysis of Algorithms, AofA 2007, 2007.
4. J. Lumbroso, "An optimal cardinality estimation algorithm based on order statistics and its full analysis," in AofA'10, ser. Discrete Mathematics and Theoretical Computer Science, no. 5333, 2010, pp. 491-506.
5. J. Cichon, J. Lemiesz, and M. Zawada, "On cardinality estimation protocols for wireless sensor networks," in ADHOC-NOW, ser. Lecture Notes in Computer Science, vol. 6288. Springer, 2011.
6. C. Baquero, P. S. Almeida, and R. Menezes, "Fast estimation of aggregates in unstructured networks," in Proceedings of the 2009 Fifth International Conference on Autonomic and Autonomous Systems, 2009, pp. 88-93.
7. P. Flajolet, "Singularity analysis and asymptotics of Bernoulli sums," Theoretical Computer Science, vol. 215, no. 1-2, pp. 371-381, 1999.
8. P. Jacquet, W. Szpankowski, and L. N, "Entropy computations via analytic depoissonization," IEEE Trans. Information Theory, vol. 45, pp. 1072-1081, 1998.
9. D. Mosk-Aoyama and D. Shah, "Computing separable functions via gossip," in Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing, ser. PODC '06, 2006, pp. 113-122.
10. M. Mitzenmacher and E. Upfal, Probability and Computing: Randomized Algorithms and Probabilistic Analysis. New York, NY, USA: Cambridge University Press, 2005.
11. B. Arnold, N. Balakrishnan, and H. Nagaraja, A First Course in Order Statistics. New York: John Wiley & Sons, 1992.