BLUETOOTH SCATTERNET FORMATION USING PROXIMITY INFORMATION OF AN ELECTION PROTOCOL

摘要

Bluetooth devices are typically arranged as piconets, which are further organized into scatternets. The formation methodology of such scatternets, to a large extent, dictates their efficiency. In this paper, we discuss and evaluate two "tree-based" algorithms for scatternet formation. Both these algorithms use an election mechanism to form master-slave relations, enabling piconet and scatternet formation. We do not assume that all Bluetooth devices are in pair-wise communication range with each other or that the nodes are turned on simultaneously. We also compare the two algorithms and discuss their impact on the performance of the resulting Bluetooth network. We observe that the two proposed algorithms are similar in performance. While algorithm 1 (multiple election phases) requires lesser time than the algorithm 2 (single election phase), the former outperforms the latter in terms of the network diameter of the resultant scatternet.