In this paper, we propose a polling scheme for intra-piconet scheduling in Bluetooth piconets. The scheme, dubbed adaptive cycle-limited scheduling, limits the maximum piconet service cycle time, while at the same time tries to adapt the time allocated to each slave according to its current traffic, thus providing guaranteed QoS, optimum performance (even in cases of asymmetric traffic), and inherent fairness. Simulations confirm that the performance of the new scheme compares favorably with that of other common polling schemes.
['Vojislav B. Misic', 'Eric W. S. Ko', 'Jelena V. Misic']
Adaptive cycle-limited scheduling scheme for Bluetooth piconets