A Tree Scatternet Formation Algorithm for Reducing Average Hop Count Between Bluetooth Devices


The KIPS Transactions:PartC, Vol. 11, No. 3, pp. 401-408, Jun. 2004
10.3745/KIPSTC.2004.11.3.401,   PDF Download:

Abstract

The Bluetooth Scatternet based on tree structure has several merits such as small number of links and simple routing method. This paper proposes an algorithm which satisfies the constraints of Bluetooth Specification and forms the topology of scatternet as close as the tree structure that has the shortest average inter-node distance among trees. Also we show that the proposed method reduces the average hop count between any two devices compared to early works without higher formation delay by a simulation.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
S. H. Kang, D. W. Kang, H. S. Lim, "A Tree Scatternet Formation Algorithm for Reducing Average Hop Count Between Bluetooth Devices," The KIPS Transactions:PartC, vol. 11, no. 3, pp. 401-408, 2004. DOI: 10.3745/KIPSTC.2004.11.3.401.

[ACM Style]
Seung Ho Kang, Dae Wook Kang, and Hyeong Seok Lim. 2004. A Tree Scatternet Formation Algorithm for Reducing Average Hop Count Between Bluetooth Devices. The KIPS Transactions:PartC, 11, 3, (2004), 401-408. DOI: 10.3745/KIPSTC.2004.11.3.401.