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

This paper introduces two distributed Bluetooth Scatternet Formation (BSF) algorithms, called BSFWAVVY(MSF) and BSFWAVVY(ODL). The first algorithm forms scatternets that contain no MS-bridges (MS-free scatternets), while the second forms scatternets in which each piconet has at most k slaves (outdegree-limited scatternets). MS-freeness and outdegreelimitation are two properties that significantly improve the quality of the scatternets. Contrary to existing BSF algorithms, our algorithms consider these properties under pessimistic environments modeled as arbitrary networks (i.e. no assumptions are made on the underlying network topology). The optimality of our algorithms are proven. Future directions are proposed to further improve the empirical performance of the introduced algorithms.