A Traffic Adaptive MAC Scheduling for Bluetooth with Maximized throughput and Guaranteed fairness

  • Kim Tae suk (Dept. of Industrial Engineering, Korea Advanced Institute of Science & Technology (KAIST)) ;
  • Choi Sung-Gi (Dept. of Industrial Engineering, Korea Advanced Institute of Science & Technology (KAIST)) ;
  • Kim Sehun (Dept. of Industrial Engineering, Korea Advanced Institute of Science & Technology (KAIST))
  • 발행 : 2002.05.01

초록

Bluetooth is an emerging technology expected to provide users with short range, low cost, pico-cellular wireless connectivity. The access to the medium for Bluetooth is based on a Master driven Time Division Duplexing (TDD) scheme. A slave transmits packets in the reverse slot only after the master polls the slave (or transmits a packet to the slave) in a forward slot. The master transmits packets to a slave in even slots while the slave transmits packets to the master in an odd slot. The way in which the master schedules packets transmission to slaves or polls them determines system performance. In this paper. we propose a traffic adaptive MAC scheduling scheme for Bluetooth. The proposed scheme adopts the ISAR (Intelligent Segmentation and Reassembly) policy, which adjusts the packet size to the traffic patterns, to adapt the polling frequency to the traffic conditions. Also for achieving fairness among master-slave connections our scheme includes a priority policy assinging prioritised service tlimes to each connection. By considering a scenario where a Bluetooth master is used as wireless access point to the Internet, we show that our scheme improve the system throughput and average queue delay with regard to a naive Round Robin (RR) scheme.

키워드