Forming MS-free and outdegree-limited Bluetooth scatternets in pessimistic environments

Bluemob: a network formation algorithm for bus riders

“…Several BSF algorithms have been proposed in the literature, most of which use a two-phase approach: (1) nodes discover their neighbor devices, usually using the algorithm proposed in [22]; and (2) setup a scatternet using the collected information. These algorithms (e.g., [11,12,18,23,29]) do not allow nodes entering and leaving after phase 1 is concluded, thus the scatternet is fixed. At phase 2, the neighborhood information is processed in a distributed or centralized manner to determine the scatternet topology trying to optimize certain criteria (e.g., complete scatternet connectivity, maximized aggregate bandwidth, minimized bridge, switching overhead, etc.…”

“…BSF-UED [12] builds on BlueStars [18], but the number of slaves in the resulting piconets are limited. BSF-WAVEY [11] focus on building a scatternet without M/S bridges and outdegree limited, modeling the network as an arbitrary graph instead of using a unit disk graph model which would require all nodes to recognize each other in the neighborhood. Besides the above static algorithms, we find in the literature dynamic BSF algorithms that allow for nodes to enter and leave the network at any time.…”