Admission Control in Bluetooth Piconets

Abstract

We analyze the performance of E-limited scheduling in Bluetooth piconets under bursty traffic for infinite and finite buffer cases. We show that E-limited service outperforms exhaustive service in terms of end-to-end delay and that the delays may be minimized through the proper choice of a single variable parameter: the number of packets to be exchanged during a single visit to a slave. Using analytical results for access delay and end-to-end delay, as well as suitable approximations thereof, we propose three novel admission algorithms. The simplest algorithm is based on queue stability, which makes it suitable for battery power-limited masters. The second algorithm estimates the access delay of the slave upon admission using the estimated first and second moments of the vacation times and makes the admission decision on the basis of predefined access delay bounds. The third algorithm is based on the predefined cycle time bounds, which makes it suitable for applications that generate constant-bit-rate data flows. We also present results for the performance of TCP traffic under E-limited scheduling.