Connectivity of Soft Random Geometric Graphs over Annuli

E-resources

PDF

Full text

Peer reviewed Open access

Connectivity of Soft Random Geometric Graphs over Annuli

Giles, Alexander P.; Georgiou, Orestis; Dettmann, Carl P.

Journal of statistical physics, 02/2016, Volume: 162, Issue: 4

Journal Article

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.

Keep searching

Author

Giles, Alexander P. | Georgiou, Orestis | Dettmann, Carl P.

Access to the JCR database is permitted only to users from Slovenia. Your current IP address is not on the list of IP addresses with access permission, and authentication with the relevant AAI accout is required.

Year	Impact factor		Edition		Category		Classification
Year	JCR	SNIP	JCR	SNIP	JCR	SNIP	JCR	SNIP

Links to authors' personal bibliographies	Links to information on researchers in the SICRIS system

Source: Personal bibliographies and: SICRIS

Upload image

Shelf entry

Adding material to shelf was successful.

Adding material to shelf failed.

It was not necessary to add the material to the shelf.

Permalink

E-mail

Impact factor

Select the library membership card:

DRS, in which the journal is indexed

Citations

Theme