Connectivity properties of a packet radio network model

A model of a packet radio network in which transmitters with range R are distributed according to a two-dimensional Poisson point process with density D is examined. To ensure network connectivity, it is shown that pi R/sup 2/D, the expected number of nearest neighbors of a transmitter, must grow logarithmically with the area of the network. For an infinite area there exists an infinite connected component with nonzero probability if pi R/sup 2/D>N/sub 0/, for some critical value N/sub 0/. It is shown that 2.195 >