Intra- and inter-piconet scheduling are two important design issues in Bluetooth personal area networks. The performance of asynchronous data traffic in Bluetooth piconets and scatternets is very much dependent on the choice of the polling scheme. In this thesis, we compare different polling schemes used in intra-piconet scheduling and argue that the E-limited polling scheme is the best one to use, since it is efficient yet simple enough. We then use the analytical results on evaluating E-limited scheduling, capturing the most representative performance variables, and present three admission control algorithms on Bluetooth Piconets with E-limited scheduling scheme....[ Read more ]

Intra- and inter-piconet scheduling are two important design issues in Bluetooth personal area networks. The performance of asynchronous data traffic in Bluetooth piconets and scatternets is very much dependent on the choice of the polling scheme. In this thesis, we compare different polling schemes used in intra-piconet scheduling and argue that the E-limited polling scheme is the best one to use, since it is efficient yet simple enough. We then use the analytical results on evaluating E-limited scheduling, capturing the most representative performance variables, and present three admission control algorithms on Bluetooth Piconets with E-limited scheduling scheme.

Bluetooth piconets may be joined to form complex networks called scatternets. In such cases, inter-piconet scheduling becomes a challenging problem. As Slave/Slave bridges have been shown to be more efficient than Master/Slave bridges, we analyze different SS bridge inter-piconet scheduling algorithms. We present an adaptive algorithm called "Load Adaptive Slave/slave Scheduling", and show that it outperforms other known algorithms in many cases.