Load and QoS-adaptive scheduling in Bluetooth piconets

A novel polling scheme for intra-piconet scheduling in Bluetooth piconets, dubbed adaptive cycle-limited scheduling, is described. The scheme allocates the time to each slave according to its current traffic, whilst trying to limit the maximum piconet cycle time. This approach makes scheduling of mixed asynchronous and CBR traffic much easier than with other known schemes. In this manner, the scheme is able to provide near-optimum performance for asynchronous data traffic, guaranteed QoS for CBR traffic, and inherent fairness among slaves with asymmetric traffic. Simulations confirm that the new scheme performs as good as, or in some cases even better than, other common polling schemes.