Efficient scheduling by incorporating bin packing with limited and weighted round robin for bluetooth

Authors:
Eung Ju Lee;Hee Yong Youn
Affiliations:
School of Information and Communication Engineering, Sungkyunkwan University, Suwon, Korea;School of Information and Communication Engineering, Sungkyunkwan University, Suwon, Korea
Venue:
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part IV
Year:
2006

Citing 5
Cited 0

Data structures and algorithm analysis in C++

Data structures and algorithm analysis in C++
Efficient fair queueing using deficit round-robin

IEEE/ACM Transactions on Networking (TON)
An engineering approach to computer networking: ATM networks, the Internet, and the telephone network

An engineering approach to computer networking: ATM networks, the Internet, and the telephone network
Approximation algorithms for extensible bin packing

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Round Robin with Look Ahead: A New Scheduling Algorithm for Bluetooth

ICPPW '02 Proceedings of the 2002 International Conference on Parallel Processing Workshops

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.