Fixed cycles and adaptive bandwidth allocation can coexist in bluetooth

A novel polling scheme for intra-piconet scheduling in Bluetooth piconets is described. The scheme allocates time to each slave according to its current traffic, while trying to limit the maximum piconet cycle time. This approach makes scheduling of mixed asynchronous and constant-bit-rate (CBR) traffic much easier than do other known schemes. In this manner, the scheme is able to provide low delay and high throughput for asynchronous data traffic, guaranteed delay for CBR traffic, and inherent fairness among slaves with asymmetric traffic; in addition it has low complexity. A detailed queueing model of this policy is presented and simulations are conducted to confirm the analytical results. Simulations confirm that the new scheme performs as well as, or in some cases even better than, other common polling schemes.