Supported by ANR-09-BLAN-0011.
Connectivity threshold of Bluetooth graphs
Article first published online: 4 SEP 2012
Copyright © 2012 Wiley Periodicals, Inc.
Random Structures & Algorithms
Volume 44, Issue 1, pages 45–66, January 2014
How to Cite
Broutin, N., Devroye, L., Fraiman, N. and Lugosi, G. (2014), Connectivity threshold of Bluetooth graphs. Random Struct. Alg., 44: 45–66. doi: 10.1002/rsa.20459
- Issue published online: 25 NOV 2013
- Article first published online: 4 SEP 2012
- Manuscript Accepted: 1 JUN 2012
- Manuscript Revised: 30 MAY 2012
- Manuscript Received: 2 MAR 2011
- random geometric graph;
- spanning ratio
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 vertex and the number of edges c that each vertex is allowed to send to these. The randomness comes from the underlying distribution of vertices 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.Copyright © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 44, 45–66, 2014