Talk and let talk: performance of Bluetooth piconets with synchronous traffic

Authors:
Jelena Mišić;Vojislav B. Mišić;Ka Lok Chan
Affiliations:
Department of Computer Science, University of Manitoba, Winnipeg, Manitoba, Canada R3P 0E2;Department of Computer Science, University of Manitoba, Winnipeg, Manitoba, Canada R3P 0E2;Department of Computer Science, Hong Kong University of Science and Technology, Hong Kong, PR China
Venue:
Ad Hoc Networks
Year:
2005

Citing 10
Cited 2

Queuing analysis of polling models

ACM Computing Surveys (CSUR)
On optimal polling policies

Queueing Systems: Theory and Applications - Polling models
Gigabit networking

Gigabit networking
Wide area traffic: the failure of Poisson modeling

IEEE/ACM Transactions on Networking (TON)
Performance evaluation of scheduling algorithms for Bluetooth

Broadband communications
Bluetooth revealed: the insider's guide to an open specification for global wireless communication

Bluetooth revealed: the insider's guide to an open specification for global wireless communication
Performance of network formation and scheduling algorithms in the Bluetooth wireless ad-hoc network: 59

Journal of High Speed Networks
Computer Networking: A Top-Down Approach Featuring the Internet Package

Computer Networking: A Top-Down Approach Featuring the Internet Package
Bluetooth Demystified

Bluetooth Demystified
Bridges of Bluetooth county: topologies, scheduling, and performance

IEEE Journal on Selected Areas in Communications

QoS management middleware solutions for Bluetooth audio distribution

Pervasive and Mobile Computing
An efficient algorithm for scheduling in bluetooth piconets and scatternets

Wireless Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper investigates the possibility of replacing the Bluetooth SCO connection with a QoS-constrained asynchronous link that uses multi-slot ACL packets. We have analyzed the performance of this scheme, dubbed pseudo-SCO, under three different scheduling policies: limited service, exhaustive service, and E-limited service, using the theory of M^[^x^]/G/1 queues with vacations. It was found that the pseudo-SCO scheme allows asynchronous traffic to experience much lower access and end-to-end delays than with the regular SCO connection, while supporting the bandwidth requirements of SCO traffic. The E-limited service scheduling policy was found to provide better performance than the other two policies, and its performance may be tuned to minimize the end-to-end packet delays under known traffic burstiness; moreover, it is able to guarantee minimum bandwidth for asynchronous traffic. Analytical results were confirmed through simulations.