By Topic

A Bluetooth group-scatternet formation algorithm for efficient routing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
3 Author(s)
Kuei-Ping Shih ; Dept. of Comput. Sci. & Inf. Eng., Tamkang Univ., Taipei, Taiwan ; Wang, S.S. ; Jen-Hung Su

A novel algorithm, called 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. 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.

Published in:

Parallel Processing Workshops, 2003. Proceedings. 2003 International Conference on

Date of Conference:

6-9 Oct. 2003