N. Ahmed, S. S. Kanhere, and S. Jha, The holes problem in wireless sensor networks, ACM SIGMOBILE Mobile Computing and Communications Review, vol.9, issue.2, pp.1-14, 2005.
DOI : 10.1145/1072989.1072992

D. Aingworth, C. Chekuri, R. Motwani, and P. Indyk, Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication), Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms, pp.547-553, 1996.
DOI : 10.1137/S0097539796303421

P. S. Almeida, C. Baquero, and A. Cunha, Fast distributed computation of distances in networks, 2012 IEEE 51st IEEE Conference on Decision and Control (CDC), 2012.
DOI : 10.1109/CDC.2012.6426872

C. Baquero, P. S. Almeida, R. Menezes, J. , and P. , Extrema Propagation: Fast Distributed Estimation of Sums and Network Sizes, IEEE Transactions on Parallel and Distributed Systems, vol.23, issue.4, pp.668-675, 2012.
DOI : 10.1109/TPDS.2011.209

K. Boitmanis, K. Freivalds, P. Ledin?, and R. Opmanis, Fast and Simple Approximation of the Diameter and Radius of a Graph, Experimental Algorithms, vol.4007, pp.98-108, 2006.
DOI : 10.1007/11764298_9

J. C. Cardoso, C. Baquero, and P. S. Almeida, Probabilistic Estimation of Network Size and Diameter, 2009 Fourth Latin-American Symposium on Dependable Computing, pp.33-40, 2009.
DOI : 10.1109/LADC.2009.19

B. Chen, K. Jamieson, H. Balakrishnan, M. , and R. , Span, Proceedings of the 7th annual international conference on Mobile computing and networking , MobiCom '01, pp.481-494, 2002.
DOI : 10.1145/381677.381686
URL : https://hal.archives-ouvertes.fr/hal-01021186

J. Cichon, J. Lemiesz, and M. Zawada, On Cardinality Estimation Protocols for Wireless Sensor Networks. Ad-hoc, mobile, and wireless networks, pp.322-331, 2011.

D. G. Corneil, F. F. Dragan, M. Habib, P. , and C. , Diameter determination on restricted graph families, Discrete Applied Mathematics, vol.113, issue.2-3, pp.143-166, 2001.
DOI : 10.1016/S0166-218X(00)00281-X
URL : https://hal.archives-ouvertes.fr/lirmm-00090363

P. Crescenzi, R. Grossi, C. Imbrenda, L. Lanzi, and A. Marino, Finding the Diameter in Real- World Graphs -Experimentally Turning a Lower Bound into an Upper Bound, European Conference on Algorithms, 2010.

B. Deb, S. Bhatnagar, and B. Nath, STREAM: Sensor Topology Retrieval at Multiple Resolutions, Telecommunication Systems, vol.26, issue.2-4, pp.285-320, 2004.
DOI : 10.1023/B:TELS.0000029043.27689.3f

M. Elkin, Computing almost shortest paths, Proceedings of the twentieth annual ACM symposium on Principles of distributed computing -PODC '01, pp.53-62, 2001.
DOI : 10.1145/1103963.1103968
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.131.5986

C. P. Hall, Peer-to-Peer Algorithms for Sampling Generic Topologies, 2010.

J. M. Hendrickx, A. Olshevsky, and J. N. Tsitsiklis, Distributed Anonymous Discrete Function Computation, IEEE Transactions on Automatic Control, vol.56, issue.10, pp.56-2276, 2011.
DOI : 10.1109/TAC.2011.2163874
URL : http://arxiv.org/abs/1004.2102

M. Li and B. Yang, A Survey on Topology issues in Wireless Sensor Network Distributed Algorithms, Proceedings of the International Conference on Wireless Networks. Lynch, 1996.

D. Varagnolo, G. Pillonetto, and L. Schenato, Distributed statistical estimation of the number of nodes in sensor networks, 49th IEEE Conference on Decision and Control (CDC), pp.1498-1503, 2010.
DOI : 10.1109/CDC.2010.5717355

U. Zwick, Exact and Approximate Distances in Graphs ??? A Survey, Algorithms - ESA 2001, pp.33-48, 2001.
DOI : 10.1007/3-540-44676-1_3