Distributed size estimation of dynamic anonymous networks

Proceedings of the IEEE Conference on Decision and Control

Volumn , Issue , 2012, Pages 5221-5227

  Terelius, Hakan ^a   Varagnolo, Damiano ^a   Johansson, Karl Henrik ^a  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

anonymous networks; distributed estimation; dynamic networks; sensor networks; size estimation

Indexed keywords

SENSOR NETWORKS;

ANONYMOUS NETWORKS; CLOSED FORM SOLUTIONS; DISTRIBUTED ESTIMATION; DYNAMIC NETWORK; FINITE-PRECISION ARITHMETIC; INFORMATION EXCHANGE PROTOCOL; PEER-TO-PEER SERVICES; SIZE ESTIMATION;

PEER TO PEER NETWORKS;

EID: 84874268840     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: 10.1109/CDC.2012.6425912     Document Type: Conference Paper

References (40)

1. K. M. Lynch, I. B. Schwartz, P. Yang, and R. A. Freeman, "Decentralized environmental modeling by mobile sensor networks," IEEE Transactions on Robotics, vol. 24, no. 3, pp. 710 - 724, June 2008.
2. S. Bolognani and S. Zampieri, "A distributed control strategy for reactive power compensation in smart microgrids," arXiv, vol. arXiv:1106.5626v2 [math.OC], October 2011.
3. R. Herring, A. Hofleitner, S. Amin, T. Nasr, A. Khalek, P. Abbeel, and A. Bayen, "Using mobile phones to forecast arterial traffic through statistical learning," in Transportation Research Board Annual Meeting, Washington D.C., USA, January 2010.
4. B. Ribeiro and D. Towsley, "Estimating and sampling graphs with multidimensional random walks," in Proceedings of the 10th annual conference on Internet measurement, 2010.
5. C. Gkantsidis, M. Mihail, and A. Saberi, "Random walks in peer-topeer networks: algorithms and evaluation," Performance Evaluation, vol. 63, no. 3, pp. 241 - 263, March 2006.
6. L. Massoulié, E. L. Merrer, A.-M. Kermarrec, and A. Ganesh, "Peer counting and sampling in overlay networks: random walk methods," in 25th annual ACM symposium on Principles of distributed computing, 2006.
7. D. Kostoulas, D. Psaltoulis, I. Gupta, K. P. Birman, and A. J. Demers, "Active and passive techniques for group size estimation in large-scale and dynamic distributed systems," The Journal of Systems and Software, vol. 80, no. 10, pp. 1639 - 1658, October 2007.
8. C. Baquero, P. S. Almeida, R. Menezes, and P. Jesus, "Extrema propagation: Fast distributed estimation of sums and network sizes," IEEE Transactions on Parallel and Distributed Systems, vol. 23, no. 4, pp. 668 - 675, April 2012.
9. J. C. S. Cardoso, C. Baquero, and P. S. Almeida, "Probabilistic estimation of network size and diameter," in Latin-American Symposium on Dependable Computing, João Pessoa, Brasil, September 2009, pp. 33 - 40.
10. D. Varagnolo, G. Pillonetto, and L. Schenato, "Distributed size estimation in anonymous networks," IEEE Transactions on Automatic Control, vol. (submitted), 2011.
11. P. Chassaing and L. Gerin, "Efficient estimation of the cardinality of large data sets," in 4th Colloquium on Mathematics and Computer Science, 2006, pp. 419 - 422.
12. F. Giroire, "Order statistics and estimating cardinalities of massive data sets," Discrete Applied Mathematics, vol. 157, pp. 406 - 427, 2009.
13. J. Lumbroso, "An optimal cardinality estimation algorithm based on order statistics and its full analysis," in International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms, 2010.
14. J. Cichón, J. Lemiesz, and M. Zawada, "On message complexity of extrema propagation techniques," Wroclaw University of Technology, Tech. Rep., 2012.
15. P. Clifford and I. A. Cosma, "A statistical analysis of probabilistic counting algorithms," Scandinavian Journal of Statistics, vol. 1, pp. 1 - 14, March 2011.
16. E. Cohen, "Size-estimation framework with applications to transitive closure and reachability," Journal of Computer and System Sciences, vol. 53, no. 3, pp. 441 - 453, December 1997.
17. D. Mosk-Aoyama and D. Shah, "Fast distributed algorithms for computing separable functions," IEEE Transactions on Information Theory, vol. 7, no. 7, pp. 2997 - 3007, July 2008.
18. S.-L. Peng, S.-S. Li, X.-K. Liao, Y.-X. Peng, and N. Xiao, "Estimation of a population size in large-scale wireless sensor networks," Journal of Computer Science and Technology, vol. 24, no. 5, pp. 987 - 997, September 2009.
19. S. Petrovic and P. Brown, "A new statistical approach to estimate global file populations in the eDonkey P2P file sharing system," in 21st International Teletraffic Congress, September 2009.
20. J. Cichón, J. Lemiesz, W. Szpankowski, and M. Zawada, "Two-phase cardinality estimation protocols for sensor networks with provable precision," in IEEE Wireless Communications and Networking Conference, Paris, France, April 2012.
21. J. Cichón, J. Lemiesz, and M. Zawada, "On cardinality estimation protocols for wireless sensor networks," in Ad-hoc, mobile, and wireless networks, ser. Lecture Notes in Computer Science. Springer, 2011, vol. 6811/2011, pp. 322 - 331.
22. P. Flajolet and G. N. Martin, "Probabilistic counting algorithms for data base applications," Journal of Computer and System Sciences, vol. 31, no. 2, pp. 182 - 209, 1985.
23. P. Flajolet, E. Fusy, O. Gandouet, and F. Meunier, "Hyperloglog: the analysis of a near-optimal cardinality estimation algorithm," in Analysis of Algorithms, 2007.
24. D. Dolev, O. Mokryn, and Y. Shavitt, "On multicast trees: Structure and size estimation," IEEE/ACM Transactions on Networking, vol. 14, no. 3, pp. 557 - 567, June 2006.
25. M. Howlader, M. R. Frater, and M. J. Ryan, "Estimating the number and distribution of the neighbors in an underwater communication network," in SENSORCOMM, August 2008.
26. R. Ali, S. S. Lor, and M. Rio, "Two algorithms for network size estimation for master/slave ad hoc networks," in IEEE 3rd International Symposium on Advanced Networks and Telecommunication Systems, December 2009.
27. A. Leshem and L. Tong, "Estimating sensor population via probabilistic sequential polling," IEEE Signal Processing Letters, vol. 12, no. 5, pp. 395 - 398, May 2005.
28. E. Fusy and F. Giroire, "Estimating the number of active flows in a data stream over a sliding window," in Workshop on Analytic Algorithmics and Combinatorics, 2007.
29. D. Psaltoulis, D. Kostoulas, I. Gupta, K. Birman, and A. Demers, "Practical algorithms for size estimation in large and dynamic groups," University of Illinois, Urbana-Champaign, Tech. Rep., February 2004.
30. Y. Chabchoub and G. Hébrail, "Sliding hyperloglog: Estimating cardinality in a data stream over a sliding window," in IEEE International Conference on Data Mining Workshops, Sydney, Australia, December 2010.
31. S. Alouf, E. Altman, C. Barakat, and P. Nain, "On the dynamic estimation of multicast group sizes," in MTNS, Leuven, Belgium, July 2004.
32. S. Alouf, E. Altman, and P. Nain, "Optimal on-line estimation of the size of a dynamic multicast group," in Joint Conference of the IEEE Computer and Communications Societies, vol. 2, November 2002, pp. 1109 - 1118.
33. T. M. Shafaat, A. Ghodsi, and S. Haridi, "A practical approach to network size estimation for structured overlays," Self-organizing Systems, vol. 5343, pp. 71 - 83, 2008.
34. M. Yamashita and T. Kameda, "Computing on an anonymous network," in Proceedings of the seventh annual ACM Symposium on Principles of distributed computing, 1988, pp. 117 - 130.
35. G. Wahba, Spline models for observational data. SIAM, 1990.
36. V. N. Vapnik, Statistical Learning Theory. New York: Springer-Verlag, 1998.
37. F. Iutzeler, P. Ciblat, and J. Jakubowicz, "Analysis of max-consensus algorithms in wireless channels," IEEE Transactions on Signal Processing, 2012 (submitted).
38. B. Schölkopf and A. J. Smola, Learning with kernels: Support vector machines, regularization, optimization, and beyond. The MIT Press, 2002.
39. D. Varagnolo, G. Pillonetto, and L. Schenato, "Distributed statistical estimation of the number of nodes in sensor networks," in IEEE Conference on Decision and Control, Atlanta, USA, December 2010.
40. T. Hastie, R. Tibshirani, and J. Friedman, The Elements of Statistical Learning: Data Mining, Inference, and Prediction, 2nd ed. New York: Springer, 2001.