Skip to main content
SpringerLink
Log in
Book cover

International Conference on Computational Science and Its Applications

ICCSA 2006: Computational Science and Its Applications - ICCSA 2006 pp 187–196Cite as

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

  • Conference paper

  • 805 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,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.

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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   139.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bluetooth Special Interest Group, Specification of the Bluetooth System (2005), http://www.bluetooth.com

  2. Shreedhar, M., Varghese, G.: Efficient Fair Queuing using Deficit Round Robin. IEEE/ACM Transactions on Networking 4(3), 375–385 (1996)

    Article  Google Scholar 

  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. 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. 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. 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. Kang, J., Park, S.: Algorithms for The Variable Sized Bin Packing Problem. European Journal of Operational Research (2002)

    Google Scholar 

  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. 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)

    Article  MATH  MathSciNet  Google Scholar 

  10. Bluehoc OpenBluetooth Simulator site, http://www-124.ibm.com/developerworks/opensource/bluehoc

  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. Keshav, S.: An Engineering Approach to Computer Networking: ATM Networks, the Internet, and The Telephone Newtork. Addison-Wesley, Reading (1999)

    Google Scholar 

  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. 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. Bin-Packing linux based simulation site, http://www.cs.arizona.edu/icon/oddsends/bpack/bpack.htm

Download references

Author information

Authors and Affiliations

  1. School of Information and Communication Engineering, Sungkyunkwan University, Suwon, Korea

    Eung Ju Lee & Hee Yong Youn

Authors
  1. Eung Ju Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hee Yong Youn
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Calgary, 2500 University Drive N.W., T2N 1N4, Calgary, AB, Canada

    Marina L. Gavrilova

  2. Department of Mathematics and Computer Science, University of Perugia, via Vanvitelli, 1, I-06123, Perugia, Italy

    Osvaldo Gervasi

  3. William Norris Professor, Head of the Computer Science and Engineering Department, University of Minnesota, USA

    Vipin Kumar

  4. OptimaNumerics Ltd.,, Cathedral House 23-31 Waring Street, BT1 2DX, Belfast, UK

    C. J. Kenneth Tan

  5. Clayton School of IT, Monash University, 3800, Clayton, Australia

    David Taniar

  6. Department of Chemistry, University of Perugia, Via Elce di Sotto, 8, I-06123, Perugia, Italy

    Antonio Laganá

  7. School of Computing, Soongsil University, Seoul, Korea

    Youngsong Mun

  8. School of Information and Communication Engineering, Sungkyunkwan University, Korea

    Hyunseung Choo

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation