A fair and traffic dependent scheduling algorithm for Bluetooth scatternets

被引:13
作者
Kapoor, R [1 ]
Zanella, A
Gerla, M
机构
[1] Univ Calif Los Angeles, Los Angeles, CA 90024 USA
[2] Univ Padua, I-35100 Padua, Italy
关键词
Bluetooth; scatternet; scheduling; fairness;
D O I
10.1023/A:1027309521047
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The Bluetooth specification defines the notion of interconnected piconets, called scatternets, but does not define the actual mechanisms and algorithms necessary to set up and maintain them. The operation of a scatternet requires some Bluetooth units to be inter-piconet units (gateways), which need to time-division multiplex their presence among their piconets. This requires a scatternet-scheduling algorithm that can schedule the presence of these units in an efficient manner. In this paper, we propose a distributed scatternet-scheduling scheme that is implemented using the HOLD mode of Bluetooth and adapts to non-uniform and changing traffic. Another attribute of the scheme is that it results in fair allocation of bandwidth to each Bluetooth unit. This scheme provides an integrated solution for both intra- and inter-piconet scheduling, i.e., for polling of slaves and scheduling of gateways.
引用
收藏
页码:9 / 20
页数:12
相关论文
共 10 条
[1]  
BAATZ S, 2001, P IEEE LCN
[2]  
DAS A, 2001, P IEEE INFOCOM 2001
[3]  
Haartsen J, 1998, ERICSSON REV, V75, P110
[4]  
JOHANSSON P, 2001, IEEE NETWORK MAG SEP
[5]  
KALIA M, 1999, P 6 IEEE INT WORKSH
[6]  
KAPOOR R, 2002, P MWCN
[7]  
MAYER A, 1996, P IEEE INFOCOM
[8]  
RACZ A, 2001, P MOBIHOC
[9]  
ZHANG W, 2002, P IEEE IPCCC
[10]  
SPECIFICATIONS BLUET, V1