Connectivity of Soft Random Geometric Graphs Over Annuli
Combinatorics
2017-06-15 v4 Statistical Mechanics
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.
Cite
@article{arxiv.1502.05440,
title = {Connectivity of Soft Random Geometric Graphs Over Annuli},
author = {Alexander P. Kartun-Giles and Orestis Georgiou and Carl P. Dettmann},
journal= {arXiv preprint arXiv:1502.05440},
year = {2017}
}
Comments
12 pages, 6 figures