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.
This research was supported in part by the Ubiquitous Autonomic Computing and Network Project, 21st Century Frontier R&D Program in Korea and the Brain Korea 21 Project in 2005.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bluetooth Special Interest Group, Specification of the Bluetooth System (2005), http://www.bluetooth.com
Shreedhar, M., Varghese, G.: Efficient Fair Queuing using Deficit Round Robin. IEEE/ACM Transactions on Networking 4(3), 375–385 (1996)
Kalia, M., Bansal, D., Shorey, R.: Data Scheduling and SAR for Bluetooth MAC. IEEE VTC 2000, Tokyo, pp. 716–720 (Spring 2000)
Capone, A., Geria, M., Kapoor, R.: Efficient Polling Schemes for Bluetooth Picocells. In: ICC, IEEE International Conference on Communication, pp. 1990–1994 (2001)
Yang, D., Nair, G., Sivaramakrishnan, B., Jayakumar, H., Sen, A.: Round Robin with Look Ahead: A New Scheduling Algorithm for Bluetooth. In: International Conference on Parallel Processing Workshops (ICPPW 2002), pp. 45–50 (2002)
Kleinschmidt., J.H., Pellenz, M.E., Lima Jr, L.A.P.: A Bluetooth Scheduling Algorithm using Channel State Information. In: 11th International Conference on Telecommunications ICT 2004, Fortaleza, Brazil, August 1-6 (2004)
Kang, J., Park, S.: Algorithms for The Variable Sized Bin Packing Problem. European Journal of Operational Research (2002)
Das, A., Ghose, A., Razdan, A., Saran, H., Shorey, R.: Enhancing Performance of Asynchronous Data Traffic over the Bluetooth Wireless Ad-hoc Network. In: IEEE INFOCOM 2001, pp. 3211–3216 (2001)
Baker, B.S., Coffman, E.G.: A tight asymptotic bound for Next- Fit-Decreasing Bin Packing. SIAM Journal on Alg. Disc. Meth. 2, 147–152 (1981)
Bluehoc OpenBluetooth Simulator site, http://www-124.ibm.com/developerworks/opensource/bluehoc
Sinha, V., Badu, D.R.: Class-based Packet Scheduling Policies for Bluetooth. In: National Conference on Communications: I.I.T, Bombay, pp. 25–27 (2002)
Keshav, S.: An Engineering Approach to Computer Networking: ATM Networks, the Internet, and The Telephone Newtork. Addison-Wesley, Reading (1999)
Weiss, M.A.: Weiss Florida International University, Data Structures and Algorithm Analysis, 2nd edn. The Benjamin/Cummings Pub-lishing Company, Inc. (1994)
Coffman Jr., E.G., Lueker, G.S.: Approximation Algorithms for Extensible Bin Packing. In: ACM/SIAM Symposium on Discrete Al-gorithms, pp. 586–588 (2001)
Bin-Packing linux based simulation site, http://www.cs.arizona.edu/icon/oddsends/bpack/bpack.htm
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, E.J., Youn, H.Y. (2006). Efficient Scheduling by Incorporating Bin Packing with Limited and Weighted Round Robin for Bluetooth. In: Gavrilova, M.L., et al. Computational Science and Its Applications - ICCSA 2006. ICCSA 2006. Lecture Notes in Computer Science, vol 3983. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11751632_20
Download citation
DOI: https://doi.org/10.1007/11751632_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34077-5
Online ISBN: 978-3-540-34078-2
eBook Packages: Computer ScienceComputer Science (R0)