Following Etherington, Hoge and Parkes, we consider a network consisting of (approximately) N transceivers in the plane R² distributed randomly with density given by a Gaussian distribution about the origin, and assume each transceiver can communicate with all other transceivers within distance s. We give bounds for the distance from the origin to the furthest transceiver connected to the origin, and that of the closest transceiver that is not connected to the origin.
International Journal of Ad Hoc and Ubiquitous Computing
Required Publisher's Statement
Copyright 2008 Inderscience. The original published version of this article may be found at http://dx.doi.org/10.1504/IJAHUC.2008.018407.
Balister, Paul; Bollobás, B.; Sarkar, Amites; and Walters, M., "Connectivity of a Gaussian Network" (2008). Mathematics. Paper 5.