Document Type

Article

Publication Date

2008

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.

Publication Title

International Journal of Ad Hoc and Ubiquitous Computing

Volume

30

Issue

3

First Page

204

Last Page

213

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.

Included in

Mathematics Commons

Share

COinS