N. Deng, W. Zhou, and M. Haenggi, The Ginibre Point Process as a Model for Wireless Networks With Repulsion, IEEE Transactions on Wireless Communications, vol.14, issue.1, pp.107-121, 2015.
DOI : 10.1109/TWC.2014.2332335

J. Gomez, A. Vasseur, A. Vergne, P. Martins, L. Decreusefond et al., A Case Study on Regularity in Cellular Network Deployment, IEEE Wireless Communications Letters, vol.4, issue.4, pp.421-424, 2015.
DOI : 10.1109/LWC.2015.2431263
URL : https://hal.archives-ouvertes.fr/hal-01145527

R. Ghrist and A. Muhammad, Coverage and hole-detection in sensor networks via homology, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005., 2005.
DOI : 10.1109/IPSN.2005.1440933
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.116.4061

V. De-silva and R. Ghrist, Coordinate-free Coverage in Sensor Networks with Controlled Boundaries via Homology, The International Journal of Robotics Research, vol.10, issue.2, 2006.
DOI : 10.1023/B:WINE.0000013081.09837.c0

A. Muhammad and A. Jadbabaie, Decentralized Computation of Homology Groups in Networks by Gossip, 2007 American Control Conference, pp.3438-3443, 2007.
DOI : 10.1109/ACC.2007.4283133

A. Zomorodian and G. Carlsson, Computing Persistent Homology, Discrete & Computational Geometry, vol.33, issue.2, pp.249-274, 2005.
DOI : 10.1007/s00454-004-1146-y
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.5064

V. D. Silva and R. Ghrist, Coverage in sensor networks via persistent homology, Algebraic & Geometric Topology, vol.10, issue.1, pp.339-358, 2007.
DOI : 10.1007/s00454-004-1146-y

A. Vergne, L. Decreusefond, and P. Martins, Reduction algorithm for simplicial complexes, 2013 Proceedings IEEE INFOCOM, pp.475-479, 2013.
DOI : 10.1109/INFCOM.2013.6566818
URL : https://hal.archives-ouvertes.fr/hal-00688919

F. Yan, A. Vergne, P. Martins, and L. Decreusefond, Homology-Based Distributed Coverage Hole Detection in Wireless Sensor Networks, IEEE/ACM Transactions on Networking, vol.23, issue.6, pp.1705-1718, 2015.
DOI : 10.1109/TNET.2014.2338355
URL : https://hal.archives-ouvertes.fr/hal-00783403

N. Le, P. Martins, L. Decreusefond, and A. Vergne, Simplicial homology based energy saving algorithms for wireless networks, 2015 IEEE International Conference on Communication Workshop (ICCW), pp.166-172, 2015.
DOI : 10.1109/ICCW.2015.7247173
URL : https://hal.archives-ouvertes.fr/hal-01120497

P. D?otko, R. Ghrist, M. Juda, and M. Mrozek, Distributed computation of coverage in sensor networks by homological methods Applicable Algebra in Engineering, Communication and Computing, vol.23, issue.12, pp.29-58, 2012.

T. Kaczy´nskikaczy´nski, M. Mrozek, and M. ´. Slusarek, Homology computation by reduction of chain complexes, Computers & Mathematics with Applications. An International Journal, vol.3597, issue.4, pp.59-70, 1998.

V. De-silva and G. Carlsson, Topological estimation using witness complexes, IEEE Symposium on Point-based Graphic, pp.157-166, 2004.

T. W. Haynes, S. T. Hedetniemi, and P. J. Slater, Fundamentals of domination in graphs, ser. Monographs and Textbooks in Pure and Applied Mathematics, 1998.

E. Campos-naã´seznaã´sez, A. Garcia, and C. Li, A Game-Theoretic Approach to Efficient Power Management in Sensor Networks, Operations Research, vol.56, issue.3, pp.552-561, 2008.
DOI : 10.1287/opre.1070.0435

O. Bobrowski and M. Kahle, Topology of random geometric complexes: a survey ArXiv e-prints, 2014.

L. Decreusefond, E. Ferraz, H. Randriambololona, and A. Vergne, Simplicial Homology of Random Configurations, Advances in Applied Probability, vol.2011, issue.02, pp.325-347, 2014.
DOI : 10.1214/09-AOP477
URL : https://hal.archives-ouvertes.fr/hal-00578955

M. Penrose, Random Geometric Graphs (Oxford Studies in Probability), 2003.

A. Goel, S. Rai, and B. Krishnamachari, Monotone properties of random geometric graphs have sharp thresholds, The Annals of Applied Probability, vol.15, issue.4, pp.2535-2552, 2005.
DOI : 10.1214/105051605000000575
URL : http://arxiv.org/abs/math/0310232

M. D. Penrose, Focusing of the scan statistic and geometric clique number, Advances in Applied Probability, vol.34, issue.04, pp.739-753, 2002.
DOI : 10.1214/aop/1176991491

T. Mãijller, Two-point concentration in random geometric graphs, Combinatorica, vol.28, issue.5, pp.529-545, 2008.

M. D. Penrose and J. E. Yukich, Weak laws of large numbers in geometric probability, The Annals of Applied Probability, vol.13, issue.1, pp.277-303, 2003.
DOI : 10.1214/aoap/1042765669

M. J. Appel and R. P. Russo, The Maximum Vertex Degree of a Graph on Uniform Points in [0,1] d, Advances in Applied Probability, vol.29, issue.3, pp.567-581, 1997.
DOI : 10.2307/1428076

F. Yan, P. Martins, and L. Decreusefond, Accuracy of homology based approaches for coverage hole detection in wireless sensor networks, 2012 IEEE International Conference on Communications (ICC), 2012.
DOI : 10.1109/ICC.2012.6364341
URL : https://hal.archives-ouvertes.fr/hal-00646894

D. J. Daley, D. Vere, and -. , An introduction to the theory of point processes, ser. Probability and its Applications

D. Matula, On the Complete Subgraphs of a Random Graph, Proc. Of the Second Chapel Hill Conference on Combinatorial Mathematics and Its Applications, pp.356-369, 1970.

B. Bollobas and P. Erdös, Cliques in random graphs, Mathematical Proceedings of the Cambridge Philosophical Society, pp.419-427, 1976.
DOI : 10.1017/S0305004100053056