Connectivity of Soft Random Geometric Graphs Over Annuli

Abstract

Nodes are randomly distributed within an annulus (and then a shell) to form a point pattern of communication terminals which are linked stochastically according to the Rayleigh fading of radio-frequency data signals. We then present analytic formulas for the connection probability of these spatially embedded graphs, describing the connectivity behaviour as a dense-network limit is approached. This extends recent work modelling ad hoc networks in non-convex domains.

12 pages, 6 figures

References in corpus (1)

• Network connectivity in non-convex domains with reflections

Cited by in corpus (8)

• Statistical properties of the quantum internet
• The shape of shortest paths in random spatial networks
• Random spherical graphs
• Spatial networks with wireless applications
• Isotropic random geometric networks in two dimensions with a penetrable cavity
• On the distances within cliques in a soft random geometric graph
• Graph connectivity with fixed endpoints in the random-connection model
• Large algebraic connectivity fluctuations in spatial network ensembles imply a predictive advantage from node location information