DocumentCode :
433483
Title :
Round-robin with FCFS preemption: a simple MAC scheduling scheme for Bluetooth piconet
Author :
Yen, Li-Hsing ; Liao, Chi-Hung
Author_Institution :
Dept. of Comput. Sci. & Inf. Eng., Chung Hua Univ., Hsinchu, Taiwan
Volume :
1
fYear :
2005
fDate :
28-30 March 2005
Firstpage :
761
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.
Keywords :
Bluetooth; access protocols; queueing theory; scheduling; Bluetooth piconet; FCFS preemption; RR-FCFS MAC scheduling scheme; circuit-oriented applications; exhaustive round-robin scheduling; first-come-first-serve order; packet delay; packet-oriented applications; queue length; round-robin scheduling; short-range TDD wireless network; time division duplex wireless network; Bluetooth; Circuits; Computer science; Delay; Master-slave; Media Access Protocol; Personal area networks; Processor scheduling; Round robin; Wireless networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Advanced Information Networking and Applications, 2005. AINA 2005. 19th International Conference on
ISSN :
1550-445X
Print_ISBN :
0-7695-2249-1
Type :
conf
DOI :
10.1109/AINA.2005.300
Filename :
1423581
Link To Document :
بازگشت