Journal of Northeastern University ›› 2003, Vol. 24 ›› Issue (8): 739-742.DOI: -

• OriginalPaper • Previous Articles     Next Articles

Fair and efficient dynamic polling scheme

Ren, Xiu-Li (1); Fan, Li-Jun (1); Quan, Cheng-Bin (1); Luan, Gui-Xing (2)   

  1. (1) Sch. of Info. Sci. and Eng., Northeastern Univ., Shenyang 110004, China; (2) Shenyang Inst. of Comp. Technol., Chinese Acad. of Sci., Shenyang 110004, China
  • Received:2013-06-24 Revised:2013-06-24 Published:2013-06-24
  • Contact: Ren, X.-L.
  • About author:-
  • Supported by:
    -

Abstract: Scheduling scheme is an important part in Bluetooth piconets. The pure round-robin polling scheme of Bluetooth has a significant impact on the system performance. An fair and efficient dynamic polling scheme was proposed-double-tokens dynamic polling scheme. The scheme has two important points. One is that all slaves are visited by the pseudo-random order in order to solve the unfairness among all slaves. The other is that the master-slave which holds tokens is scheduled first to reduce the length of the polling cycles. Previously-proposed polling schemes for Bluetooth were discussed. The scheme excels in throughput and delay behavior, and has a good fairness.

CLC Number: