Performance of Bluetooth bridge scheduling algorithms

Authors:
Jelena MišIć;Vojislav B. MišIć;Ka Lok Chan
Affiliations:
Department of Computer Science, University of Manitoba, Winnipeg, Manitoba, Canada R3T 2N2;Department of Computer Science, University of Manitoba, Winnipeg, Manitoba, Canada R3T 2N2;Department of Computer Science, Hong Kong University of Science and Technology, Hong Kong, China
Venue:
Computer Communications
Year:
2004

Citing 3
Cited 1

Dominance relations in polling systems

Queueing Systems: Theory and Applications
Adaptive inter-piconet scheduling in small scatternets

ACM SIGMOBILE Mobile Computing and Communications Review
Bridges of Bluetooth county: topologies, scheduling, and performance

IEEE Journal on Selected Areas in Communications

Efficient Scheduling Algorithms for Bluetooth Scatternets

Wireless Personal Communications: An International Journal

Quantified Score

Hi-index	0.24

Visualization

Abstract

Performance of Bluetooth scatternets is critically dependent on the algorithm for bridge scheduling. As the current specification does not prescribe any particular algorithm, a number of proposals have been made. These proposals are classified into rendezvous-based and walk-in based algorithms, and their relative advantages and disadvantages are highlighted. Using the theory of queues with vacations, we derive the probability distributions for end-to-end packet delays (and a number of intermediate variables such as the duration of master-bridge exchanges, bridge cycle time, and piconet cycle time) under three different bridge scheduling algorithms. Analytical results are confirmed through discrete event simulation.