BSF-UED: A Novel Time-Efficient Bluetooth Scatternet Formation algorithm based on Unnecessary Edges Deletion

Ahmed Jedda (1) , Arnaud Casteigts (2) , Guy-Vincent Jourdan (1) , Hussein Mouftah (1)

1 SITE - School of Information Technology and Engineering [Ottawa]
2 LaBRI - Laboratoire Bordelais de Recherche en Informatique

We introduce a new time-efficient Bluetooth Scatternet Formation (BSF) algorithm, called BSF-UED (Unnecessary-Edges Deletion). BSF-UED forms connected scatternets determin-istically. Heuristics are added to make these scatternets outdegree limited (that is, with no more than 7 slaves per piconet). The performance of the algorithm is evaluated through a range of simulation experiments. BSF-UED is compared against some of the most common BSF algorithms which are BlueStars, BlueMIS I, BlueMIS II, and BlueMesh. We show that BSF-UED provides a good balance between the usual scatternets performance metrics, while being time efficient (nearly 1/3 of the execution time of BlueMesh). BlueStars remains a faster algorithm, but with the major flaw of generating scatternets whose piconets have a large number of slaves.

Domaines: Calcul parallèle, distribué et partagé [cs.DC]

Ahmed Jedda, Arnaud Casteigts, Guy-Vincent Jourdan, Hussein Mouftah. BSF-UED: A Novel Time-Efficient Bluetooth Scatternet Formation algorithm based on Unnecessary Edges Deletion. 18th IEEE Symposium on Computers and Communications (ISCC), Jul 2013, Croatia. pp.886-891. ⟨hal-00854249⟩