Anzeige
Erschienen in:
2006 | OriginalPaper | Buchkapitel
Efficient Scheduling by Incorporating Bin Packing with Limited and Weighted Round Robin for Bluetooth
verfasst von : Eung Ju Lee, Hee Yong Youn
Erschienen in: Computational Science and Its Applications - ICCSA 2006
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
In Bluetooth employing the conventional scheduling policies such as round robin, NULL packet is sent when the Master or Slave node does not have any data to send in its turn, and this causes a significant waste of resources. The Limited and Weighted Round Robin (LWRR) algorithm dynamically adjusts the resource allocation to each master-slave pair according to the queue status. In this paper we propose an improved LWRR (ILWRR) scheduling algorithm which effectively combines the LWRR and bin packing algorithm. Computer simulation reveals that slot utilization is increased up to about 50% compared to the round robin algorithm. The proposed ILWRR scheduling is effective for not only basic data transmission but also real-time multimedia data transmission.