Abstract
In this paper we view the scheduling problem in Bluetooth as a bin packing problem (BPP) with k-preview items. We analytically demonstrate that even though the First Fit Decreasing with k-preview Items (FFD-kI) algorithm has the same asymptotic worst case performance ratio as the Look Ahead Round Robin (LARR) algorithm, it achieves a competitive asymptotic average case performance ratio which is superior to LARR and Round Robin (RR). We present both worst case and average case results. Extensive simulation results show that in a Bluetooth piconet, the FFD-kI algorithm achieves significantly better throughput and channel utilization performances over LARR and RR.
This work was supported by the National Nature Science Foundation of China (Grant No.9020-4003, 60402012), the National Basic Research Program of China (Grant No.2003CB314806, 2006CB701306) and Beijing Municipal Key Disciplines (XK100130438).
This is a preview of subscription content, log in via an institution to check access.
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 1.2 (2003)
Kalia, M., Bansal, D., Shorey, R.: Data Scheduling and SAR for Bluetooth MAC. In: Proc. of IEEE VTC, pp. 716–720 (2000)
Yang, C.-C., Liu, C.-F.: A bandwidth-based polling scheme for QoS support in Bluetooth. Computer Communications (2004)
Yang, D., Nair, G., Sivaramakrishnan, B.: Round Robin with Look Ahead: A New Scheduling Algorithm for Bluetooth. In: Proceedings of the International Conference on Parallel Processing Workshops, pp. 45–50 (2002)
Coffman Jr., E.G., Garey, M.R., Johnson, D.S.: Bin Packing Approximation Algorithms: A Survey. In: Hochbaum, D. (ed.) Approximation Algorithms for NP-Hard Problems, pp. 46–93. PWS Publishing, Boston (1996)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., San Francisco (1979)
Zhang, G.: A new version of on-line variable-sized bin packing. Disc. Appl. Math., 193–197 (1997)
Coffman Jr., E.G., Csirik, J., Woeginger, G.: Bin Packing Theory. In: Pardalos, P., Resende, M. (eds.) Handbook of Applied Optimization. Oxford University Press, New York (2002)
Xiao, J., Ren, B., Cheng, S.: Bin packing problem with k-preview items. Technical report (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xiao, J., Ren, B., Cheng, S. (2005). A BPP-Based Scheduling Algorithm in Bluetooth Systems. In: Jia, X., Wu, J., He, Y. (eds) Mobile Ad-hoc and Sensor Networks. MSN 2005. Lecture Notes in Computer Science, vol 3794. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11599463_61
Download citation
DOI: https://doi.org/10.1007/11599463_61
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30856-0
Online ISBN: 978-3-540-32276-4
eBook Packages: Computer ScienceComputer Science (R0)