A New KFP MAC Scheduling Policy to Support QoS in Bluetooth Systems 


Vol. 28,  No. 2, pp. 55-62, Feb.  2003


PDF
  Abstract

This paper proposes an efficient and differentiated MAC scheduling algorithm for Bluetooth systems. The proposed algorithm guarantees QoS (Quality of Service) requirement of each master-slave pair or application. Conventional MAC scheduling algorithms for Bluetooth take priority of each pair into consideration and demonstrate relatively reasonable performance. However, their performances may depend on traffic characteristic, or they are limited by overheads for signaling. In this paper, we propose a new MAC scheduling algorithm superior to the conventional algorithms from the viewpoints of throughput, delay, and supporting QoS. Our proposed algorithm is evaluated via computer simulations under various environments and compared with the conventional scheduling algorithms. Simulation results indicate that the proposed algorithm shows better performance than the existing algorithms, and can support the QoS demand of each pair.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

J. S. Oh, Y. Joo, O. Kwon, Y. Kim, T. Lee, K. H. Tchah, "A New KFP MAC Scheduling Policy to Support QoS in Bluetooth Systems," The Journal of Korean Institute of Communications and Information Sciences, vol. 28, no. 2, pp. 55-62, 2003. DOI: .

[ACM Style]

Jong Soo Oh, Yang-Ick Joo, Oh-Seok Kwon, Yong-Suk Kim, Tae-Jin Lee, and Kyun Hyon Tchah. 2003. A New KFP MAC Scheduling Policy to Support QoS in Bluetooth Systems. The Journal of Korean Institute of Communications and Information Sciences, 28, 2, (2003), 55-62. DOI: .

[KICS Style]

Jong Soo Oh, Yang-Ick Joo, Oh-Seok Kwon, Yong-Suk Kim, Tae-Jin Lee, Kyun Hyon Tchah, "A New KFP MAC Scheduling Policy to Support QoS in Bluetooth Systems," The Journal of Korean Institute of Communications and Information Sciences, vol. 28, no. 2, pp. 55-62, 2. 2003.