loading...
A Bluetooth Group-Scatternet Formation Algorithm for Efficient Routing
Kaohsiung, Taiwan October 06-October 09
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICPPW.2003.12403522003 International Conference on Para ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Kuei-Ping Shih, Tamkang University
Sean S. Wang, Tamkang University
Jen-Hung Su, Tamkang University
In this paper, we propose a novel algorithm, Group-Scatternet Formation Algorithm (GSFA), is proposed for scatternet construction. GSFA consists of two phases, piconet formation and group-scatternet formation. An efficient routing protocol based on the resulting scatternet of GSFA is also presented in this article. The experimental results show that two-group and three-group scatternets are suitable for the networks with more than 50 devices and for that with less than 50 devices, respectively. The proposed GSFA also outperforms BTCP, TREE, and LINEAR in terms of delay and network throughput.
Citation:
Kuei-Ping Shih, Sean S. Wang, Jen-Hung Su, "A Bluetooth Group-Scatternet Formation Algorithm for Efficient Routing," icppw, pp.50, 2003 International Conference on Parallel Processing Workshops (ICPPW'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.