M. Bawa, H. Garcia-molina, A. Gionis, and R. Motwani, Estimating aggregates on a peer-to-peer network, 2003.

S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, Randomized gossip algorithms, IEEE Transactions on Information Theory, vol.52, issue.6, pp.2508-2530, 2006.
DOI : 10.1109/TIT.2006.874516
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.133.8625

J. Chen and J. Hu, Analysis of Distributed Random Grouping for Aggregate Computation on Wireless Sensor Networks with Randomly Changing Graphs, IEEE Transactions on Parallel and Distributed Systems, vol.19, issue.8, pp.1136-1149, 2008.
DOI : 10.1109/TPDS.2008.40

J. Chen, G. Pandurangan, and D. Xu, Robust Computation of Aggregates in Wireless Sensor Networks: Distributed Randomized Algorithms and Analysis, IEEE Transactions on Parallel and Distributed Systems, vol.17, issue.9, pp.987-1000, 2006.
DOI : 10.1109/TPDS.2006.128

M. Farach-colton, R. J. Fernandes, and M. A. Mosteiro, Bootstrapping a hop-optimal network in the weak sensor model, ACM Transactions on Algorithms, 2008.

M. Farach-colton and M. A. Mosteiro, Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model, Proc. of 10th Intl. Workshop on Algorithms and Data Structures, pp.565-576, 2007.
DOI : 10.1007/978-3-540-73951-7_49

M. Farach-colton and M. A. Mosteiro, Sensor Network Gossiping or How to Break the Broadcast Lower Bound, Proc. of the 18th Intl. Symp. on Algorithms and Computation, pp.232-243, 2007.
DOI : 10.1007/978-3-540-77120-3_22

L. Fejes-tóth, ???ber einen geometrischen Satz, Mathematische Zeitschrift, vol.46, issue.1, pp.83-85, 1940.
DOI : 10.1007/BF01181430

W. Feller, An Introduction to Probability Theory and Its Applications, volume I, 1968.

A. Fernández-anta, M. A. Mosteiro, and C. Thraves, An early-stopping protocol for computing aggregate functions in Sensor Networks, Journal of Parallel and Distributed Computing, vol.73, issue.2, 2008.
DOI : 10.1016/j.jpdc.2012.09.013

B. Ghosh and S. Muthukrishnan, Dynamic Load Balancing by Random Matchings, Journal of Computer and System Sciences, vol.53, issue.3, pp.357-370, 1996.
DOI : 10.1006/jcss.1996.0075
URL : http://doi.org/10.1006/jcss.1996.0075

I. Gupta, R. Van-renesse, and K. P. Birman, Scalable fault-tolerant aggregation in large process groups, Proceedings International Conference on Dependable Systems and Networks, pp.433-442, 2001.
DOI : 10.1109/DSN.2001.941427

P. Gupta and P. R. Kumar, Critical Power for Asymptotic Connectivity in Wireless Networks, Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor of W. H. Fleming, pp.547-566, 1998.
DOI : 10.1007/978-1-4612-1784-8_33

M. Jerrum and A. Sinclair, Conductance and the rapid mixing property for Markov chains: the approximation of permanent resolved, Proceedings of the twentieth annual ACM symposium on Theory of computing , STOC '88, pp.235-244, 1988.
DOI : 10.1145/62212.62234

D. Kempe, A. Dobra, and J. Gehrke, Gossip-based computation of aggregate information, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings., pp.482-491, 2003.
DOI : 10.1109/SFCS.2003.1238221

G. Kollios, J. W. Byers, J. Considine, M. Hadjieleftheriou, and F. Li, Robust aggregation in sensor networks, IEEE Data Engineering Bulletin, vol.28, issue.1, pp.26-32, 2005.

S. Madden, M. J. Franklin, J. M. Hellerstein, and W. Hong, Tag: a tiny aggregation service for ad-hoc sensor networks, Proc. of the 5th Symp. on Operating Systems Design and Implementation, pp.131-146, 2002.

R. Motwani and P. Raghavan, Randomized Algorithms, 1995.

Y. Rabani, A. Sinclair, and R. Wanka, Local divergence of Markov chains and the analysis of iterative load-balancing schemes, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280), pp.694-703, 1998.
DOI : 10.1109/SFCS.1998.743520

A. Sinclair and M. Jerrum, Approximate counting, uniform generation and rapidly mixing Markov chains, Information and Computation, vol.82, issue.1, pp.93-133, 1989.
DOI : 10.1016/0890-5401(89)90067-9
URL : http://doi.org/10.1016/0890-5401(89)90067-9