|
Abstract : |
Abstract|In this paper, we propose and study data scheduling and Segmentation and Reassembly (SAR) policies in Bluetooth. In such systems, the conventional scheduling policies such as Round Robin perform poorly as they are not suited to the tight coupling of uplinkdownlink scheduling and result in slot wastage and unfairness. Scheduling in Bluetooth is complex due to (i) reserved slots for voice tra c, and, (ii) variable sized data packets. The reservation of voice slots at regular intervals results in non-contiguous TDD slots available for data. In this paper, we propose two new scheduling policies that utilize information about the size of the Head-of-the-Line (HOL) packet at the Master and Slave queues to schedule the TDD slots e ectively. These policies achieve high throughput and greater fairness compared to the Round-Robin based scheduling policies. We then study the Segmentation and Reassembly policies at the Bluetooth MAC. SAR policies have a signi cant e ect on data scheduling as they govern the distribution of packet size. We propose two new SAR policies for Bluetooth that give good performance in terms of throughput, delay and fairness. Finally, we include channel errors in Bluetooth and propose a modi ed scheduling algorithm that gives good performance. I., |
