Reliable density estimates for coverage and connectivity in thin strips of finite length
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Spatial node distribution of manhattan path based random waypoint mobility models with applications
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Throughput and energy efficiency in wireless ad hoc networks with Gaussian channels
IEEE/ACM Transactions on Networking (TON)
On the connectivity of bluetooth-based ad hoc networks
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
Hi-index | 0.00 |
Let n be a positive integer and λ 0 a real number. Let Vn be a set of n points in the unit disk selected uniformly and independently at random. Define G(λ, n) to be the graph with vertex set Vn, in which two vertices are adjacent if and only if their Euclidean distance is at most λ. We call this graph a unit disk random graph. Let $\lambda = c \sqrt {\ln n/n}$ and let X be the number of isolated points in G(λ, n). We prove that almost always X ∼ n1-c2 when 0 ≤ c n) → ∞, then G(λ, n) is connected. By extending a method of Penrose, we show that under the same condition on λ, there exists a constant K such that the diameter of G(λ, n) is bounded above by K · 2/λ. Furthermore, with a new geometric construction, we show that when $\lambda = c \sqrt {\ln n/n}$ and c 2.26164 …, the diameter of G(λ, n) is bounded by (4 + o(1))/λ; and we modify this construction to yield a function c(δ) 0 such that the diameter is at most 2(1 + δ + o(1))/λ when c c(δ). © 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2006