Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
