Connectivity threshold for Bluetooth graphs

Details Connectivity threshold for Bluetooth graphs Connectivity threshold for Bluetooth graphs

2011-03-02

arxiv.org/abs/1103.0351v1

Mathematics

Probability

21 pages, 5 figures

Scientific paper

We study the connectivity properties of random Bluetooth graphs that model certain "ad hoc" wireless networks. The graphs are obtained as "irrigation subgraphs" of the well-known random geometric graph model. There are two parameters that control the model: the radius $r$ that determines the "visible neighbors" of each node and the number of edges $c$ that each node is allowed to send to these. The randomness comes from the underlying distribution of data points in space and from the choices of each vertex. We prove that no connectivity can take place with high probability for a range of parameters $r, c$ and completely characterize the connectivity threshold (in $c$) for values of $r$ close the critical value for connectivity in the underlying random geometric graph.

Affiliated with

Also associated with

No associations

Rating

Connectivity threshold for Bluetooth graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Connectivity threshold for Bluetooth graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Connectivity threshold for Bluetooth graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-473482