Chidanand Apté, Fred Damerau, et al.
ACM Transactions on Information Systems (TOIS)
A model of a packet radio network in which transmitters with range R are distributed according to a twodimensional Poisson point process with density D is examined. To ensure network connectivity, it is shown that πR 2D, 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 πR2D > N0, for some critical value N0. We show that 2.195 < N0 < 10.526. © 1989 IEEE
Chidanand Apté, Fred Damerau, et al.
ACM Transactions on Information Systems (TOIS)
Khaled A.S. Abdel-Ghaffar
IEEE Trans. Inf. Theory
Frank R. Libsch, S.C. Lien
IBM J. Res. Dev
S.F. Fan, W.B. Yun, et al.
Proceedings of SPIE 1989