Connectivity of a Gaussian network

15 years 2 months ago

Download www.maths.qmul.ac.uk

: Following Etherington, Hoge and Parkes, we consider a network consisting of (approximately) N transceivers in the plane R2 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.

Paul N. Balister, Béla Bollobás, Ami

Real-time Traffic

Gaussian Distribution | IJAHUC 2008 | Plane R2 | Transceiver |

claim paper

» Efficient architectures for sparselyconnected high capacity associative memory models

» Neural Networks A Replacement for Gaussian Processes

» Rectified Gaussian distributions and the formation of local filters from video data

» Sparselyconnected associative memory models with displaced connectivity

» Gaussian Process Models for Link Analysis and Transfer Learning

» Fault Tolerance of Connectivity Performance in CDMABased Wireless Sensor Networks

» Probabilistic Community Discovery Using Hierarchical Latent Gaussian Mixture Model

» Multicast Throughput of Hybrid Wireless Networks Under Gaussian Channel Model

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2008
Where	IJAHUC
Authors	Paul N. Balister, Béla Bollobás, Amites Sarkar, Mark Walters

Comments (0)

Sciweavers

Connectivity of a Gaussian network

Gaussian Distribution | IJAHUC 2008 | Plane R2 | Transceiver |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers