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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
