Differentiated fairness guaranteeing scheduling policies for Bluetooth

This paper considers efficient and differentiated scheduling policies for Bluetooth MAC. The conventional queue state-based packet scheduling algorithms have some limitations such as unfair polling or traffic dependent performance. We propose two efficient MAC scheduling algorithms, which guarantee improved throughput and reasonable fairness, and can lead to Differentiated Services. The proposed policies are separate KFP (K-Fairness Policy) and Diff-KFP (Differentiated K-Fairness Policy). To reflect individual traffic characteristics of each master-slave pair, the proposed policy determines if current scheduling turns of master-slave pairs are sacrificed or not by the counter values of the pairs, and changes step size of the counter on each pair differently, and thereby, each pair´s QoS can be incorporated. The proposed algorithms are compared with the conventional queue state-based algorithm. Simulation results show that our algorithms demonstrate better performance, and can be extended to satisfy QoS requirements of various applications.