A guided tour of Chernoff bounds
Information Processing Letters
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Expansion properties of (secure) wireless networks
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Irrigating ad hoc networks in constant time
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
On random points in the unit disk
Random Structures & Algorithms
Bluetooth scatternet formation: A survey
Ad Hoc Networks
Brief announcement: (more) efficient pruning of ad-hoc wireless networks
Proceedings of the 28th ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
We study the connectivity properties of a family of random graphs which closely model the Bluetooth's device discovery process, where each device tries to connect to other devices within its visibility range in order to establish reliable communication channels yielding a connected topology. Specifically, we provide both analytical and experimental evidence that when the visibility range of each node (i.e., device) is limited to a vanishing function of n, the total number of nodes in the system, full connectivity can still be achieved with high probability by letting each node connect only to a "small" number of visible neighbors. Our results extend previous studies, where connectivity properties were analyzed only for the case of a constant visibility range, and provide evidence that Bluetooth can indeed be used for establishing large ad hoc networks.