A BPP-Based scheduling algorithm in bluetooth systems

Authors:
Junfeng Xiao;Biao Ren;Shiduan Cheng
Affiliations:
State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, China;State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, China;State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, China
Venue:
MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks
Year:
2005

Citing 4
Cited 0

Approximation algorithms for bin packing: a survey

Approximation algorithms for NP-hard problems
A new version of on-line variable-sized bin packing

Discrete Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Round Robin with Look Ahead: A New Scheduling Algorithm for Bluetooth

ICPPW '02 Proceedings of the 2002 International Conference on Parallel Processing Workshops

Quantified Score

Hi-index	0.00

Visualization

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.