Connectivity of Soft Random Geometric Graphs Over Annuli

Alexander Kartun-Giles, Orestis Georgiou, Carl Dettmann

Research output: Contribution to journal › Article (Academic Journal) › peer-review

11 Citations (Scopus)
282 Downloads (Pure)

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.
Original languageEnglish
Pages (from-to)1068-1083
Number of pages16
JournalJournal of Statistical Physics
Volume162
Issue number4
Early online date29 Dec 2015
DOIs
Publication statusPublished - 1 Feb 2016

Keywords

  • Random geometric graphs
  • Statistical mechanics
  • Graph theory
  • Network science
  • Ad hoc networks
  • Communication theory

Access to Document

  • annuli

    This is the final published version of the article (version of record). It first appeared online via Springer Verlag at 10.1007/s10955-015-1436-1.

    Final published version, 1.23 MBLicence: CC BY

    Fingerprint Dive into the research topics of 'Connectivity of Soft Random Geometric Graphs Over Annuli'. Together they form a unique fingerprint.

    Cite this