Advertisement

Efficient Scheduling by Incorporating Bin Packing with Limited and Weighted Round Robin for Bluetooth

  • Eung Ju Lee
  • Hee Yong Youn
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3983)

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.

Keywords

Bin Packing Bluetooth MAC LWRR slot scheduling 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bluetooth Special Interest Group, Specification of the Bluetooth System (2005), http://www.bluetooth.com
  2. 2.
    Shreedhar, M., Varghese, G.: Efficient Fair Queuing using Deficit Round Robin. IEEE/ACM Transactions on Networking 4(3), 375–385 (1996)CrossRefGoogle Scholar
  3. 3.
    Kalia, M., Bansal, D., Shorey, R.: Data Scheduling and SAR for Bluetooth MAC. IEEE VTC 2000, Tokyo, pp. 716–720 (Spring 2000)Google Scholar
  4. 4.
    Capone, A., Geria, M., Kapoor, R.: Efficient Polling Schemes for Bluetooth Picocells. In: ICC, IEEE International Conference on Communication, pp. 1990–1994 (2001)Google Scholar
  5. 5.
    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)Google Scholar
  6. 6.
    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)Google Scholar
  7. 7.
    Kang, J., Park, S.: Algorithms for The Variable Sized Bin Packing Problem. European Journal of Operational Research (2002)Google Scholar
  8. 8.
    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)Google Scholar
  9. 9.
    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)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Bluehoc OpenBluetooth Simulator site, http://www-124.ibm.com/developerworks/opensource/bluehoc
  11. 11.
    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)Google Scholar
  12. 12.
    Keshav, S.: An Engineering Approach to Computer Networking: ATM Networks, the Internet, and The Telephone Newtork. Addison-Wesley, Reading (1999)Google Scholar
  13. 13.
    Weiss, M.A.: Weiss Florida International University, Data Structures and Algorithm Analysis, 2nd edn. The Benjamin/Cummings Pub-lishing Company, Inc. (1994)Google Scholar
  14. 14.
    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)Google Scholar
  15. 15.
    Bin-Packing linux based simulation site, http://www.cs.arizona.edu/icon/oddsends/bpack/bpack.htm

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Eung Ju Lee
    • 1
  • Hee Yong Youn
    • 1
  1. 1.School of Information and Communication EngineeringSungkyunkwan UniversitySuwonKorea

Personalised recommendations