Abstract |
We consider a random geometric graph model relevant to wireless mesh
networks. Nodes are placed uniformly in a domain, and pairwise connections
are made independently with probability a specified function of the
distance between the pair of nodes, and in a more general anisotropic
model, their orientations. The probability that the network is
(k-)connected is estimated as a function of density using a cluster
expansion approach. This leads to an understanding of the crucial roles of
local boundary effects and of the tail of the pairwise connection function,
in contrast to lower density percolation phenomena.
|
For future talks or to be added to the mailing list: www.math.uh.edu/dynamics.