X. Bai, S. Kumar, D. Xuan, Z. Yun, and T. H. Lai, Deploying wireless sensors to achieve both coverage and connectivity, Proceedings of the seventh ACM international symposium on Mobile ad hoc networking and computing , MobiHoc '06, pp.131-142, 2006.
DOI : 10.1145/1132905.1132921

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

E. Campos-nañez, 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

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

V. De-silva and R. Ghrist, Coordinate-free Coverage in Sensor Networks with Controlled Boundaries via Homology, The International Journal of Robotics Research, vol.25, issue.12, 2006.
DOI : 10.1177/0278364906072252

L. Decreusefond and E. Ferraz, On the One Dimensional Poisson Random Geometric Graph, Journal of Probability and Statistics, vol.51, 2011.
DOI : 10.1007/s00454-010-9319-3
URL : https://hal.archives-ouvertes.fr/hal-00512548

L. Decreusefond, E. Ferraz, H. Randriambololona, and A. Vergne, Simplicial homology of random configurations, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00578955

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, pp.1-30
DOI : 10.1007/s00200-012-0167-7

Q. Fang, J. Gao, and L. Guibas, Locating and bypassing routing holes in sensor networks, IEEE INFOCOM 2004, pp.2458-2468, 2004.
DOI : 10.1109/INFCOM.2004.1354667

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

A. Hatcher, Algebraic Topology, 2002.

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

T. Kaczy´nskikaczy´nski, M. Mrozek, and M. ´. Slusarek, Homology computation by reduction of chain complexes, Computers & Mathematics with Applications, vol.35, issue.4, pp.59-70, 1998.
DOI : 10.1016/S0898-1221(97)00289-7

M. Kahle, Random Geometric Complexes, Discrete & Computational Geometry, vol.33, issue.2, pp.553-573, 2011.
DOI : 10.1007/s00454-010-9319-3
URL : http://arxiv.org/abs/0910.1649

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

F. Yan, P. Martins, and L. Decreusefond, Connectivity-based distributed coverage hole detection in wireless sensor networks, Global Telecommunications Conference (GLOBECOM 2011), pp.1-6, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00616745

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

C. Zhang, Y. Zhang, and Y. Fang, Detecting coverage boundary nodes in wireless sensor networks, Networking, Sensing and Control Proceedings of the 2006 IEEE International Conference on, pp.868-873, 2006.

A. Zomorodian and G. Carlsson, Computing Persistent Homology, Discrete & Computational Geometry, vol.33, issue.2, pp.249-274, 1007.
DOI : 10.1007/s00454-004-1146-y