© 2004 by British Computer Society
An Efficient Link Polling Policy by Pattern Matching for Bluetooth Piconets

1 Computer & Communications Research Laboratory, Industrial Technology Research Institute, Chu-Tung 310, Taiwan 2 Department of Computer Science and Information Engineering National Chiao-Tung University, Hsin-Chu 300, Taiwan, ROC 3 Department of Computer Science and Information Engineering National Central University, Chung-Li 320, Taiwan, ROC
Bluetooth has a masterslave configuration called a piconet. Unspecified in the Bluetooth standard, the link polling policy adopted by a master may significantly influence the bandwidth utilization of a piconet. Several works have been dedicated to this issue. However, none of them addresses the asymmetry of traffics between masters and slaves, and the different data packet types provided by Bluetooth are not fully exploited. In this paper, we propose an efficient pattern matching polling (PMP) policy for data link scheduling that properly resolves these deficiencies. A polling pattern is a sequence of Bluetooth packets of different type combinations (e.g. DH1/DH3/DH5/DM1/DM3/DM5) to be exchanged by a masterslave pair that can properly reflect the traffic ratio (i.e. asymmetry) of the pair. By judiciously selecting a proper polling pattern together with polling times for the link, the precious wireless bandwidth can be better utilized. The ultimate goal is to reduce the unfilled, or even null, payloads in each busy slot. In addition, an overflow mechanism is included to handle unpredictable traffic dynamics. Extensive simulations are presented to justify the capability of PMP in handling regular as well as bursty traffics.
Received 29 July 2002. Revised 29 August 2003.
* Email: tylin{at}csie.nctu.edu.tw
Email: