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

Li-Hsing Yen*, Chi Hung Liao

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

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.

Original languageEnglish
Title of host publicationProceedings - 19th International Conference on Advanced Information Networking and Applications, AINA 2005
Pages761-768
Number of pages8
DOIs
StatePublished - 2005
Event19th International Conference on Advanced Information Networking and Applications, AINA 2005 - Taipei, Taiwan
Duration: 28 Mar 200530 Mar 2005

Publication series

NameProceedings - International Conference on Advanced Information Networking and Applications, AINA
Volume1
ISSN (Print)1550-445X

Conference

Conference19th International Conference on Advanced Information Networking and Applications, AINA 2005
Country/TerritoryTaiwan
CityTaipei
Period28/03/0530/03/05

Fingerprint

Dive into the research topics of 'Round-robin with FCFS preemption: A simple MAC scheduling scheme for bluetooth piconet'. Together they form a unique fingerprint.

Cite this