S. Mean and .. Per-link-capacity, Kbps) as a function of the path loss exponent (?) for the Ideal case with a secondary user's intensity ? 2 equal to 3 users per m 2, p.57

S. Mean and .. Per-link-capacity, Kbps) as a function of the secondary users' intensity (? 2 ) for the ideal IT model with B = 528 MHz for the cases ?=3 and ?=4, p.58

S. Mean and .. Per-link-capacity, Kbps) as a function of the secondary users' intensity (? 2 ) for the generalized IT model with B = 585 MHz for the case ? = 3, p.59

S. Mean and .. Per-link-capacity, Kbps) as a function of the secondary users' intensity (? 2 ) for the generalized IT model with B = 585 MHz for the case ? = 4, p.59

S. Mean and .. Per-link-capacity, Kbps) as a function of the secondary users' intensity (? 2 ) for the ideal and generalized IT models with B = 585 MHz for the case ? = 3, p.60

S. Mean and .. Per-link-capacity, Kbps) as a function of the secondary users' intensity (? 2 ) for the ideal and generalized IT models with B = 585 MHz for the case ? = 4, p.61

S. Mean and . Capacity, Kbps) as a function of the secondary users' intensity (? 2 ) for different values of the PUs outage probability following the ideal IT model with B = 528 MHz for the case ? = 3, p.65

E. Queueing-i, A down arrow denotes that user i starts to be served. An up arrow indicates that user i leaves the system without have finished the service. A double up arrow ilustrates that the service of user i finishes. It is also shown the beginning and the end of the ith busy period, respectively, A, p.119

I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, Wireless sensor networs: a survey, Computer Networks, vol.4, issue.38, pp.393-422, 2002.

N. Alon, J. H. Spencer, and P. Erdös, The Probabilistic Method, 1992.

M. J. Appel and R. P. Russo, The connectivity of a graph on uniform points in [0, 1] d . Statistics and Probability Letters, pp.351-357, 1997.

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, pp.567-581, 1997.

M. J. Appel and R. P. Russo, The minimum vertex degree of a graph on uniform points in [0, 1] d, Advances in Applied Probability, vol.29, pp.582-594, 1997.

M. A. Armstrong, Basic Topology, 1997.
DOI : 10.1007/978-1-4757-1793-8

S. Asmussen, Applied probability and queues, volume 51 of Applications of Mathematics , Stochastic Modeling and Applied Probability, 2003.

S. Athreya, R. Roy, and A. Sarkar, On the coverage of space by random sets, Advances in Applied Probability, vol.1, issue.01, pp.1-18, 2004.
DOI : 10.1007/BF00532734

F. Baccelli, M. Klein, M. Lebourges, and S. Zuyev, Stochastic geometry and architecture of communication networks, Telecommunication Systems, vol.7, issue.1/3, pp.209-227, 1997.
DOI : 10.1023/A:1019172312328

F. Baccelli and S. Zuyev, Stochastic geometry models of mobile communication networks, Frontiers in queueing, pp.227-243, 1997.

P. Balister, B. Bollobás, A. Sarkar, and M. Walters, Connectivity of random knearest-neighbour graphs, Advances in Applied Probability, vol.37, issue.1, pp.1-24, 2005.

Y. Baryshnikov and R. Ghrist, Target Enumeration via Euler Characteristic Integrals, SIAM Journal on Applied Mathematics, vol.70, issue.3, 2007.
DOI : 10.1137/070687293

E. T. Bell, Exponential Polynomials, The Annals of Mathematics, vol.35, issue.2, pp.258-277, 1934.
DOI : 10.2307/1968431

A. Björner, Topological methods, Handbook of combinatorics, vol.2, pp.1819-1872, 1995.

B. Bollobás, Random Graphs, 1985.

S. R. Broadbent and J. M. Hammersley, Percolation processes. i. crystals and mazes, Proceedings of the Cambridge Philosophical Society, pp.629-641, 1957.

E. H. Callaway, Wireless sensor networks: architectures and protocols, 2003.
DOI : 10.1201/9780203500705

C. Chong and S. P. Kumar, Sensor networks: Evolution, opportunities, and challenges, Proceedings of IEEE, pp.1247-1256, 2003.

R. B. Cooper, Introduction to queueing theory, 1981.

D. J. Daley, D. Vere, and -. , An introduction to the theory of point processes, 2003.

D. Cabric, I. D. O-'donnell, M. Shuo-wei-chen, and R. W. Brodersen, Spectrum sharing radios, IEEE Circuits and Systems Magazine, 2006.
DOI : 10.1109/MCAS.2006.1648988

V. De, R. Silva, and . Ghrist, Coverage in sensor networks via persistent homology

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

C. Domb, The problem of random intervals on a line, Proceedings of the Cambridge Philosophical Society, pp.329-341, 1947.
DOI : 10.1214/aoms/1177730986

A. Dvoretzki, ON COVERING A CIRCLE BY RANDOMLY PLACED ARCS, Proceedings of the National Academy of Sciences, vol.42, issue.4, pp.199-203, 1956.
DOI : 10.1073/pnas.42.4.199

H. Edelsbrunner and J. Harer, Persistent homology ? a survey. Surveys on Discrete and Computational Geometry, Twenty Years Later, vol.453, pp.257-282, 2008.

H. Edelsbrunner, D. Letscher, and A. Zomorodian, Topological persistence and simplification, Proceedings of the 41st Annual Symposium on Foundations of Computer Science, p.454, 2000.

P. Erdös and A. Rényi, On random graphs, i, pp.290-297, 1959.

P. Erdös and A. Rényi, On the evolution of random graphs, Publication of the Mathematical Institute of the Hungarian Academy of sciences, pp.17-61, 1960.

D. Estrin, D. Culler, K. Pister, and G. Sukhatme, Connecting the physical world with persuasive networks, IEEE Persuasive Computing, pp.59-69, 2002.

D. Estrin, L. Girod, G. Pottie, and M. Srivastava, Instrumenting the world with wireless sensor networks, 2001 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.01CH37221), pp.2033-2036, 2001.
DOI : 10.1109/ICASSP.2001.940390

D. Estrin, R. Govindan, J. Heidemann, and S. Kumar, Next century challenges, Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking , MobiCom '99, pp.263-270, 1999.
DOI : 10.1145/313451.313556

R. A. Fisher, ON THE SIMILARITY OF THE DISTRIBUTIONS FOUND FOR THE TEST OF SIGNIFICANCE IN HARMONIC ANALYSIS, AND IN STEVENS'S PROBLEM IN GEOMETRICAL PROBABILITY, Annals of Eugenics, vol.125, issue.1, pp.14-17, 1940.
DOI : 10.1111/j.1469-1809.1940.tb02233.x

L. Flatto and A. G. Konheim, The Random Division of an Interval and the Random Covering of a Circle, SIAM Review, vol.4, issue.3, pp.211-222, 1962.
DOI : 10.1137/1004058

C. H. Foh and B. S. Lee, A closed form network connectivity formula for onedimensional manets, IEEE International Conference on Communications, 2004.

C. H. Foh, G. Liu, B. C. Seet, K. J. Wong, and C. P. Fu, Network connectivity of one-dimensional manets with random waypoint movement, IEEE Communications Letters, vol.9, pp.31-33, 2005.

A. Ghasemi and S. Nader-esfahani, Exact probability of connectivity in one-dimensional ad hoc wireless networks, IEEE Communications Letters, vol.10, issue.4, pp.251-253, 2006.
DOI : 10.1109/LCOMM.2006.1613737

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., pp.254-260, 2005.
DOI : 10.1109/IPSN.2005.1440933

E. N. Gilbert, Random Graphs, The Annals of Mathematical Statistics, vol.30, issue.4, pp.1141-1144, 1959.
DOI : 10.1214/aoms/1177706098

E. N. Gilbert, Random Plane Networks, Journal of the Society for Industrial and Applied Mathematics, vol.9, issue.4, pp.533-553, 1961.
DOI : 10.1137/0109045

E. N. Gilbert, The probability of covering a sphere with N circular caps, Biometrika, vol.52, issue.3-4, pp.323-330, 1965.
DOI : 10.1093/biomet/52.3-4.323

E. Godehardt, Graphs as Structural Models, 1990.
DOI : 10.1007/978-3-322-96310-9

E. Godehardt and J. Jaworski, On the connectivity of a random interval graph, Random Structures and Algorithms, vol.9, issue.1-2, pp.137-161, 1996.
DOI : 10.1002/(SICI)1098-2418(199608/09)9:1/2<137::AID-RSA9>3.0.CO;2-Y

E. Godehardt, J. Jaworski, and D. Godehardt, The Application of Random Coincidence Graphs for Testing the Homogeneity of Data, Classification, Data Analysis and Data Highways: Proceedings of the 21st Annual Conference of the Gesellschaft für Klassifikation e.C, pp.33-45, 1998.
DOI : 10.1007/978-3-642-72087-1_4

R. L. Graham, D. E. Knuth, and O. Patashnik, Concrete Mathematics: A Foudation for Computer Science, chapter 6, pp.257-267, 1994.

M. J. Greenberg and J. R. Harper, Algebraic Topology: a First Course, 1981.

R. Hafner, Die asymptotische Verteilung zuf??lliger Klumpen, Computing, vol.21, issue.4, pp.335-351, 1972.
DOI : 10.1007/BF02242245

P. Hall, On the coverage of k-dimensional space by k-dimensional spheres. The Annals of Probability, pp.991-1002, 1985.

P. Hall, Introduction to the Theory of Coverage Processes, 1988.

G. Han, Connectivity Analysis of Wireless Ad-Hoc Networks, 2007.

G. Han and A. M. Makowski, One-dimensional geometric random graphs with nonvanishing densities II: a very strong zero-one law for connectivity, Queueing Systems, vol.4, issue.1-2, 2011.
DOI : 10.1007/s11134-012-9298-6

B. Harris and E. Godehardt, Probability Models and Limit Theorems for Random Interval Graphs with Applications to Cluster Analysis, Classification, Data Analysis and Data Highways, pp.54-61, 1998.
DOI : 10.1007/978-3-642-72087-1_6

A. Hatcher, Algebraic Topology, 2002.

L. Holst, On multiple covering of a circle with random arcs, Journal of Applied Probability, vol.208, issue.01, pp.284-290, 1980.
DOI : 10.1214/aoms/1177729030

Y. Ito, Generalized poisson functionals. Probab. Theory Related Fields, pp.1-28, 1988.
DOI : 10.1007/bf01848128

J. G. Proakis, Digital communications, 1995.

S. Janson, Random coverings in several dimensions, Acta Mathematica, vol.156, issue.0, pp.83-118, 1986.
DOI : 10.1007/BF02399201

S. Janson, T. Luczak, and A. Rucinski, Random Graphs, 2000.
DOI : 10.1002/9781118032718

J. Jia and Q. Zhang, Hardware-Constrained Multi-Channel Cognitive MAC, IEEE GLOBECOM 2007-2007 IEEE Global Telecommunications Conference, 2007.
DOI : 10.1109/GLOCOM.2007.883

M. Kahle, Random geometric complexes. Discrete and Computational Geometry, 2011.

M. Kahle and E. Meckes, Limit theorems for Betti numbers of random simplicial complexes, Homology, Homotopy and Applications, vol.15, issue.1, 2010.
DOI : 10.4310/HHA.2013.v15.n1.a17

J. Kahn, R. Katz, and K. Pister, Mobile networking for smart dust, Intl. Conf. on Mobile Computing and Networking, 1999.

H. Karl and A. Willig, Protocols abd architectures for wireless sensors networks, 2003.
DOI : 10.1002/0470095121

H. Koskinen, On the coverage of a random sensor network in a bounded domain, Proceedings of 16th ITC Specialist Seminar, pp.11-18, 2004.

P. Kumar, New technological vistas for systems and control: the example of wireless networks, IEEE Control Systems Magazine, vol.21, issue.1, pp.24-37, 2001.
DOI : 10.1109/37.898790

N. V. Laurent-decreusefond and H. Korezlioglu, An error bound for infinite approximations of queueing networks with large finite stations. Queueing Networks with Finite Capacity, pp.239-252, 1993.

F. Lewis, Wireless Sensor Networks, chapter 2, 2004.

X. Li, D. K. Hunter, and S. Zuyev, Triangulation properties of the target area in wireless sensor networks, 2011.

X. Li, P. Wan, and O. Frieder, Sensor coverage in wireless ad hoc sensor networks, International Journal of Sensor Networks, vol.2, issue.3/4, pp.753-763, 2003.
DOI : 10.1504/IJSNET.2007.013202

M. Mandelbrot, On Dvoretzky coverings for the circle, Zeitschrift f???r Wahrscheinlichkeitstheorie und Verwandte Gebiete, vol.22, issue.2, pp.158-160, 1972.
DOI : 10.1007/BF00532734

P. Manohar, S. S. Ram, and D. Manjunath, Path coverage by a sensor field, ACM Transactions on Sensor Networks, vol.5, issue.2, 2009.
DOI : 10.1145/1498915.1498923

C. Mcdiarmid, Random channel assignment in the plane. Random Structures and Algorithms, pp.187-212, 2003.

C. Mcdiarmid and B. Reed, Colouring proximity graphs in the plane, Discrete Mathematics, vol.199, issue.1-3, pp.123-127, 1999.
DOI : 10.1016/S0012-365X(98)00292-1

R. Meester and R. Roy, Continuum Percolation, 1996.
DOI : 10.1017/CBO9780511895357

S. Meguerdichian, F. Koushanfar, M. Potkonjak, and M. B. Srivastava, Coverage problems in wireless ad-hoc sensor networks, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213), pp.1380-1387, 2001.
DOI : 10.1109/INFCOM.2001.916633

M. V. Men-'shikov and S. A. Zuev, Estimation algorithms of infinite graphs percolation threshold, Proceedings of the International Conference on Fundamentals of Computation Theory, pp.310-313, 1987.

P. A. Moran, S. F. De-st, and . Groth, Random circles on a sphere, Biometrika, vol.49, issue.3-4, pp.389-396, 1962.
DOI : 10.1093/biomet/49.3-4.389

A. Muhammad and M. Egerstedt, Control using higher order laplacians in network topologies, Proceedings of the 17th International Symposium on Mathematical Theory of Networks and Systems, 2006.

J. Munkres, Elements of Algebraic Topology, 1993.

P. Niyogi, S. Smale, and S. Weinberger, Finding the Homology of Submanifolds with High Confidence from??Random??Samples, Discrete & Computational Geometry, vol.33, issue.11, pp.419-441, 2008.
DOI : 10.1007/s00454-008-9053-2

G. Peccati, J. Solé, M. Taqqu, and F. Utzet, Stein???s method and Normal approximation of Poisson functionals, The Annals of Probability, vol.38, issue.2, pp.443-478, 2010.
DOI : 10.1214/09-AOP477

M. D. Penrose, The longest edge of the random minimal spanning tree, The Annals of Applied Probability, vol.7, issue.2, pp.340-361, 1997.
DOI : 10.1214/aoap/1034625335

M. D. Penrose, Extremes for the minimal spanning tree on normally distributed points, Advances in Applied Probability, vol.30, issue.03, pp.628-639, 1998.
DOI : 10.1080/01621459.1993.10476407

M. D. Penrose, On k-connectivity for a geometric random graph. Random Structures and Algorithms, pp.145-164, 1999.

M. D. Penrose, A Strong Law for the Largest Nearest-Neighbour Link between Random Points, Journal of the London Mathematical Society, vol.60, issue.3, pp.951-960, 1999.
DOI : 10.1112/S0024610799008157

M. D. Penrose, A strong law for the longest edge of the minimal spanning tree. The Annals of Probability, pp.246-260, 1999.

M. D. Penrose, Central limit theorem for k-nearest neighbour distances. Stochastic Processes and their Applications, pp.295-320, 2000.

M. D. Penrose, Vertex ordering and partitioning problems for random spatial graphs. The Annals of Applied Probability, pp.517-538, 2000.

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

M. D. Penrose, Geometric Random Graphs, 2003.
DOI : 10.1093/acprof:oso/9780198506263.001.0001

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

G. Pottie and W. Kaiser, Wireless integrated network sensors, Communications of the ACM, vol.43, issue.5, pp.51-58, 2000.
DOI : 10.1145/332833.332838

N. Privault, Stochastic Analysis in Discrete and Continuous Settings, 2009.
DOI : 10.1007/978-3-642-02380-4

P. Robert, Stochastic networks and queues, volume 52 of Applications of Mathematics, 2003.

S. Roman, The Umbral of Calculus, 1984.

J. J. Rotman, An Introduction to Algebraic Topology (Graduate Texts in Mathematics, 1998.

R. Roy, Coverage of space in Boolean models, Dynamics and Stochastics, vol.48, pp.119-127, 2006.
DOI : 10.1214/lnms/1196285814

L. A. Shepp, Covering the circle with random ARCS, Israel Journal of Mathematics, vol.21, issue.3, pp.158-160, 1972.
DOI : 10.1007/BF02789327

A. F. Siegel and L. Holst, Covering the circle with random arcs of random sizes, Journal of Applied Probability, vol.19, issue.02, pp.373-381, 1982.
DOI : 10.1073/pnas.42.4.199

V. D. Silva and R. Ghrist, Homological sensor networks. Notices of the, 2007.

H. Solomon, Geometric Probability. SIAM: Philadelphia, 1978.

J. M. Steele, Probability Theory and Combinatorial Optimization, Society fot Industrial and Applied Mathematics, 1997.
DOI : 10.1137/1.9781611970029

W. L. Stevens, SOLUTION TO A GEOMETRICAL PROBLEM IN PROBABILITY, Annals of Eugenics, vol.9, issue.4, pp.315-320, 1939.
DOI : 10.1111/j.1469-1809.1939.tb02216.x

D. Stoyan, W. S. Kendall, and J. Mecke, Stochastic Geometry and Its Applications., Biometrics, vol.45, issue.2, 1987.
DOI : 10.2307/2531521

S. Su, The UMTS air-interface in RF engineering: design and operation of UMTS networksS, 2007.

T. and C. Clancy, Achievable Capacity Under the Interference Temperature Model, IEEE INFOCOM 2007, 26th IEEE International Conference on Computer Communications, 2007.
DOI : 10.1109/INFCOM.2007.98

S. Teng and F. Yao, k-Nearest-Neighbor Clustering and Percolation Theory, Algorithmica, vol.14, issue.2, pp.192-211, 2007.
DOI : 10.1007/s00453-007-9040-7

D. Tian and N. D. Georganas, A coverage-preserving node scheduling scheme for large wireless sensor networks, Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications , WSNA '02, pp.32-41, 2002.
DOI : 10.1145/570738.570744

W. A. Whitworth, DCC Exercises on Choice and Chance

. Wimedia, The best choice for wireless pans WiMedia Radio optimizes speed, range and power, 2008.

W. Alliance, Multiband ofdm physical layer specification, 2009.

F. Xue and P. R. Kumar, The Number of Neighbors Needed for Connectivity of Wireless Networks, Wireless Networks, vol.10, issue.2, pp.169-181, 2004.
DOI : 10.1023/B:WINE.0000013081.09837.c0

J. E. Yukich, Probability Theory of Classical Euclidean Optimization Problems, Lecture Notes in Mathematics, vol.1675, 1998.
DOI : 10.1007/BFb0093472

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

S. A. Zuev and A. F. Sidorenko, Continuous models of percolation theory. i. Theoretical and Mathematical Physics, pp.51-58, 1985.

S. A. Zuev and A. F. Sidorenko, Continuous models of percolation theory. I, Theoretical and Mathematical Physics, pp.171-177, 1985.
DOI : 10.1007/BF01034824