Connectivity of a Gaussian network


Following Etherington, Hoge and Parkes, we consider a network consisting of (approximately) N transceivers in the plane ℝ2 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. Copyright © 2008, Inderscience Publishers.

Publication Title

International Journal of Ad Hoc and Ubiquitous Computing