Skip to main content

Coverage and Connectivity: Boolean Models

  • Chapter
  • First Online:
Probabilistic Methods in Telecommunications

Part of the book series: Compact Textbooks in Mathematics ((CTM))

  • 757 Accesses

Abstract

In this chapter, we discuss mathematical approaches to the two most fundamental questions about spatial telecommunication models:

  • Coverage: How much of the area can be reached by the signals emitted from the users, respectively the base stations?

  • Connectivity: How far can a message travel through the system in a multihop-functionality?

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 19.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 29.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Fekete’s lemma states that, for any subadditive sequence \((a_n)_{n\in \mathbb {N}}\) of real numbers (i.e., a n+m ≤ a n + a m for any \(n,m\in \mathbb {N}\)), \(\lim _{n\to \infty }\frac 1n a_n\) exists in [−, ) and is equal to \(\inf _{n\in \mathbb {N}}\mathbb {E}[W_n]^{1/n}\).

References

  1. B. Bollobás and O. Riordan, Percolation, Cambridge University Press, New York (2006).

    Book  Google Scholar 

  2. F. Baccelli and B. Błaszczyszyn, Stochastic Geometry and Wireless Networks, Volume I: Theory, Now Publishers Inc. (2009).

    Google Scholar 

  3. F. Baccelli and B. Błaszczyszyn, Stochastic Geometry and Wireless Networks, Volume II: Applications, Now Publishers Inc. (2009).

    Google Scholar 

  4. E. Cali, C. Hirsch and B. Jahnel, Continuum percolation for Cox processes, Stoch. Process. Their Appl.129:10, 3941–3966 (2019).

    Google Scholar 

  5. M. Franceschetti and R. Meester, Random Networks for Communication: From Statistical Physics to Information Systems, Cambridge University Press (2008).

    Google Scholar 

  6. E.N. Gilbert, Random plane networks, J. of the Society for Industrial & Appl. Math.9, 533–543 (1961).

    Article  MathSciNet  Google Scholar 

  7. G.R. Grimmett, Percolation, Springer, New York (1989).

    Book  Google Scholar 

  8. C. Hirsch, Bounded-hop percolation and wireless communication, J. Appl. Probab.53:3, 833–845 (2016).

    Google Scholar 

  9. S. Janson, Random coverings in several dimensions, Acta Math.156, 83–118 (1986).

    Article  MathSciNet  Google Scholar 

  10. G. Matheron, Random Sets and Integral Geometry. John Wiley & Sons, London (1975).

    MATH  Google Scholar 

  11. R. Meester and R. Roy, Continuum Percolation, Cambridge University Press, Cambridge (1996).

    Book  Google Scholar 

  12. M.D. Penrose, On a continuum percolation model, Adv. Appl. Probab.23:3, 536–556 (1991).

    Google Scholar 

  13. J.A. Quintanilla and R.M. Ziff, Asymmetry in the percolation thresholds of fully penetrable disks with two different radii, Phys. Rev.E76, 051–115 (2007).

    Google Scholar 

  14. C. Yao, G. Chen and T.D. Guo, Large deviations for the graph distance in supercritical continuum percolation, J. Appl. Probab.48, 154–172 (2011).

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Jahnel, B., König, W. (2020). Coverage and Connectivity: Boolean Models. In: Probabilistic Methods in Telecommunications. Compact Textbooks in Mathematics. Birkhäuser, Cham. https://doi.org/10.1007/978-3-030-36090-0_4

Download citation

Publish with us

Policies and ethics