We study the connectivity properties of a family of random graphs that closely model the
Bluetooth's device discovery process, where each device tries to connect to other devices …

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 …

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 …

The routing capabilities of an interconnection network are strictly related to its bandwidth
and latency characteristics, which are in turn quantifiable through the graph-theoretic …

This paper represents a first step in exploring the formation of connected topologies in ad-
hoc networks built on the Bluetooth technology. Connectivity is the most basic requirement …

We investigate issues that Bluetooth may face in evolving from a simple wire replacement to
a large-scale ad hoc networking technology. We do so by examining the efficacy of …

We present a simple and fast distributed algorithm for Bluetooth network formation. Our
algorithm requires no knowledge on the underlying physical topology, and proceeds in only …

A Bluetooth ad hoc network can be formed by interconnecting piconets into scatternets. The
constraints and properties of Bluetooth scatternets present special challenges in forming an …

We propose a model for geometric random graphs motivated by wireless communication
networks adopting the Bluetooth standard. We obtain asymptotic and high probability results …

The paper concerns device discovery in multi-hop networks of Bluetooth devices. We start
from the observation that forming a Bluetooth scatternet (ie, a multi-hop wireless topology) …