Worst case response times for 1-RR/FIFO and 1-RR/EDF in a Bluetooth piconet

In this paper, we focus on the Bluetooth wireless network, analyzing its ability to support the Quality of Service (QoS) requirements defined by QoS sensitive applications. The QoS perceived by the application depends on the scheduling mechanisms chosen at the medium access layer. Hence, we propose to evaluate the ability of two Bluetooth scheduling algorithms, 1-RR/FIFO and 1-RR/EDF, to guarantee bounded transmission delays. First, we establish a bound on the worst case response time of any sporadic message using a worst case analysis.We then compare the computed bounds with the worst case response times obtained by simulation for different traffic distributions and show in which configurations our bounds are tight. We finally show how to extend the previous results taking into account message segmentation.