Bluetrees-scatternet formation to enable Bluetooth-based ad hoc networks

SF-DeviL: an algorithm for energy-efficient Bluetooth scatternet formation and maintenance

“…Algorithms also differ in the resulting scatternet topology: some with tree [6,[8][9][10][11] and some with mesh topologies [7,12]. It is shown that the optimum Bluetooth scatternet topologies are application dependent [13].…”

“…Two distributed, multi-hop scatternet formation protocols resulting in tree topologies, called Bluetrees, are proposed in Ref. [11]. A multi-hop solution, called BlueMesh, which generates mesh topologies, is proposed in Ref.…”

“…Bluetooth scatternet formation has recently attracted significant attention, where existing studies can be classified as formation algorithms [6][7][8][9][10][11][12] and performance related studies [13][14][15][16]. The algorithms for Bluetooth scatternet formation show differences in their approaches.…”

“…LMS [6], which tries to minimize the number of piconets, and TSF [9], are distributed single-hop scatternet formation algorithms that result in tree topologies, and they can maintain topology changes such as node additions and deletions (failures). Algorithms with multi-hop scatternets [7,[10][11][12] do not require the assumption that all nodes are within communication range of other nodes, and thus they have a wider application range.…”

Energy-aware On-demand Scatternet Formation and Routing

“…One of the earlier proactive formation algorithms is described in Reference [14], where a single root node initiates the construction of a Bluetree. The root node assumes the role of master and selects all its neighbors as slaves, and the slaves in turn assign themselves as masters in new piconets and searches for unassigned neighbors to be their slaves.…”