BSF-UED: A new time-efficient Bluetooth Scatternet Formation algorithm based on Unnecessary-Edges Deletion

We introduce a new time-efficient Bluetooth Scatternet Formation (BSF) algorithm, called BSF-UED (Unnecessary-Edges Deletion). BSF-UED forms connected scatternets deterministically. 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.