Connectivity of a Gaussian network

Authors:
P. Balister;B. Bollobas;A. Sarkar;M. Walters
Affiliations:
Department of Mathematical Sciences, University of Memphis, Memphis TN 38152, USA.;Department of Mathematical Sciences, University of Memphis, Memphis TN 38152, USA/ Trinity College, University of Cambridge, Cambridge CB2 1TQ, UK.;Department of Mathematics, Western Washington University, Bellingham WA 98225, USA.;Peterhouse, University of Cambridge, Cambridge CB2 1RD, UK
Venue:
International Journal of Ad Hoc and Ubiquitous Computing
Year:
2008

Citing 2
Cited 1

Continuum percolation with steps in the square or the disc

Random Structures & Algorithms
Connectivity of a Gaussian network

International Journal of Ad Hoc and Ubiquitous Computing

Connectivity of a Gaussian network

International Journal of Ad Hoc and Ubiquitous Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Following Etherington, Hoge and Parkes, we consider a networkconsisting of (approximately) N transceivers in the plane R²distributed randomly with density given by a Gaussian distributionabout the origin, and assume each transceiver can communicate withall other transceivers within distance s. We give bounds for thedistance from the origin to the furthest transceiver connected tothe origin, and that of the closest transceiver that is notconnected to the origin.