链形结构的蓝牙分散网拓扑构成算法与性能仿真

Chain structure Bluetooth scatternet topology formation algorithm and performance simulations

提出了一种新的链形结构的蓝牙分散网拓扑构成算法:所有蓝牙节点均以0.5的概率进入查询或查询扫描状态,同时地进行点对点的连接,形成尽可能多的临时皮网,再反复通过各种形式的合并与重组形成更大的皮网与多个皮网形成的组,直至最终形成仅有一个组的链形结构的分散网。仿真与性能分析表明:该算法实现简单,形成的分散网具有较少的皮网数目、较小的各节点角色的平均数与较小的节点最大度数、网络创建时间较短、拓扑动态维护方便、各节点无需均在通信范围内等优点。该算法适用于蓝牙分散网的拓扑构成。

A novel chain structure Bluetooth scatternet algorithm for topology formation was presented： all Bluetooth nodes turn into INQUIRY or INQUIRY SCAN states with identical probability, 0.5, then set point-to-point connections up simultaneously. As a result, as large as possible numbers of temporary piconets were made up, and furthermore, some larger piconets and groups composed of several piconets were made up through varieties of merging and recomposing repeatedly, Finally, a chain structure scatternet bearing only one group were formed by operating the algorithm after several times. Simulations and performance analysis indicate that the scatternet formed by this algorithm has excellent characteristics： comparably less number of piconets, less average number of roles every node and less number of maximum degree of nodes, shorter networking establishment time, easier to maintain topology dynamically and dispensable for all nodes to be in communication range, etc. The algorithm can be used for Bluetooth scatternet topology formation.