Round-robin with FCFS preemption: a simple MAC scheduling scheme for bluetooth piconet

Authors:
Li-Hsing Yen;Chi-Hung Liao
Affiliations:
Department of Computer Science and Information Engineering, Chung Hua University, Hsinchu, Taiwan, R.O.C.;AboCom Systems, Inc., Hsinchu, Taiwan, R.O.C.
Venue:
Journal of Mobile Multimedia
Year:
2005

Citing 4
Cited 0

Bluetooth: Connect Without Cables

Bluetooth: Connect Without Cables
An Efficient Link Polling Policy by Pattern Matching for Bluetooth Piconets

HICSS '03 Proceedings of the 36th Annual Hawaii International Conference on System Sciences (HICSS'03) - Track 9 - Volume 9
ASP: An Adaptive Energy-Efficient Polling Algorithm for Bluetooth Piconets

HICSS '03 Proceedings of the 36th Annual Hawaii International Conference on System Sciences (HICSS'03) - Track 9 - Volume 9
An adaptive power-conserving service discipline for bluetooth (APCB) wireless networks

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Bluetooth is a short-range TDD (Time Division Duplex) wireless network that supports both circuit- and packet-oriented applications. A piconet is composed of a device configured as master and at most seven other devices acting as slaves. At Medium Access Control (MAC) layer, the master can select a slave to send a data packet and until then, the slave is not allowed to transmit. Round-Robin (RR) and Exhaustive Round-Robin (ERR) are two elementary MAC scheduling schemes that are both simple and efficient. This paper proposes RR-FCFS, a simple MAC scheduling scheme that has the same advantages as RR and ERR. RR-FCFS acts as RR if the master's queue is empty and starts transmitting packets in first-come-first-serve order otherwise. The simulation results show that RR-FCFS's performance in terms of packet delay and queue length is comparable with those of RR and ERR.