Performance of a new device discovery and link establishment protocol for Bluetooth

Kardos, Sándor; Vidács, Attila

doi:10.1109/glocom.2005.1578427

Cited by 3 publications

(1 citation statement)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Many attempts were made by the research community improve the performance of this problem. Most of these solutions require changes on the specifications of Bluetooth, such as [6] and [7]. These studies have shown the positive impact of their solutions, but none of them found its way to standardization.…”

Section: Introductionmentioning

confidence: 96%

Analyzing the Device Discovery Phase of Bluetooth Scatternet Formation Algorithms

Jeddah

Zaguia

Jourdan

2009

2009 29th IEEE International Conference on Distributed Computing Systems Workshops

View full text Add to dashboard Cite

we study in this paper the impact of the modifications introduced in version 1.2 of the Bluetooth specifications on Bluetooth Scatternet Formation (BSF) algorithms. Up to now, the effect of these modifications on BSF algorithms had not been analyzed. We show that: 1) Bluetooth ver1.2 and upward have a major positive effect on static BSF algorithms (i.e. those which require an external device discovery phase). We conducted some experiments on a common device discovery technique for static BSF algorithms and compared its performance using Ver1.2 and Ver1.1 (the latter is used in most BSF studies). We found that this technique, using ver1.2, generates a connected topology about 3.5 times faster than it does using ver1.1. It also discovers about 20% more edges. 2) Dynamic algorithms, on the other hand, are not affected by these modifications. This will be proven using some experiments and some analytical arguments. These results give more applicability to static BSF algorithms and call for more research on dynamic BSF algorithms.

show abstract

Section: Introductionmentioning

confidence: 96%