Title: Connectivity of a Gaussian network

Authors: P. Balister, B. Bollobas, A. Sarkar, M. Walters

Addresses: 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

Abstract: 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.

Keywords: wireless sensor networks; WSNs; wireless networks; Gaussian distribution; transceivers; Gilbert model; continuum percolation; connectivity.

DOI: 10.1504/IJAHUC.2008.018407

International Journal of Ad Hoc and Ubiquitous Computing, 2008 Vol.3 No.3, pp.204 - 213

Published online: 20 May 2008 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article