An efficient and optimized bluetooth scheduling algorithm for piconets

Authors:
Vijay Prakash Chaturvedi;V. Rakesh;Shalabh Bhatnagar
Affiliations:
Department of Computer Science and Automation, Indian Institute of Science, Bangalore, India;Department of Computer Science and Automation, Indian Institute of Science, Bangalore, India;Department of Computer Science and Automation, Indian Institute of Science, Bangalore, India
Venue:
ICDCIT'07 Proceedings of the 4th international conference on Distributed computing and internet technology
Year:
2007

Citing 4
Cited 1

Efficient fair queueing using deficit round robin

SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Performance evaluation of scheduling algorithms for Bluetooth

Broadband communications
Two-timescale simultaneous perturbation stochastic approximation using deterministic perturbation sequences

ACM Transactions on Modeling and Computer Simulation (TOMACS)
Performance evaluation of Bluetooth polling schemes: an analytical approach

Mobile Networks and Applications

An efficient algorithm for scheduling in bluetooth piconets and scatternets

Wireless Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Bluetooth is an emerging standard in short range, low cost and low power wireless networks. MAC is a generic polling based protocol, where a central Bluetooth unit (master) determines channel access to all other nodes (slaves) in the network (piconet). An important problem in Bluetooth is the design of efficient scheduling protocols. This paper proposes a polling policy that aims to achieve increased system throughput and reduced packet delays while providing reasonably good fairness among all traffic flows in a Bluetooth Piconet.We present an extensive set of simulation results and performance comparisons with two important existing algorithms. Our results indicate that our proposed scheduling algorithm outperforms the Round Robin scheduling algorithm by more than 40% in all cases tried. Our study also confirms that our proposed policy achieves higher throughput and lower packet delays with reasonable fairness among all the connections.