Round robin with look ahead: A new scheduling algorithm for Bluetooth

Daqing Yang, G. Nair, B. Sivaramakrishnan, H. Jayakumar, Arunabha Sen

Research output: Chapter in Book/Report/Conference proceedingConference contribution

10 Citations (Scopus)

Abstract

We propose two new media access control (MAC) scheduling algorithms for Bluetooth whose objective is to achieve high channel utilization (throughput). Conventional scheduling policies such as round robin (RR) in the Bluetooth environment results in wastage of slots and hence poor utilization of the network resources. As Bluetooth devices are designed to carry both voice and data, scheduling becomes a complex task as slots are reserved for voice traffic at periodic intervals and the data packets are allowed to have variable size. We view the MAC scheduling problem in Bluetooth as an online bin packing problem. The two scheduling policies being proposed in the paper, look ahead (LA) and look ahead round robin (LARR), can be viewed as online bin packing with lookahead. We first analytically demonstrate that an optimal scheduling policy can have about 66% improvement in throughput over the round robin policy. Our extensive simulation shows that both LA and LARR achieves nearly 10% improvement in throughput over RR. As the computational complexity of LARR is lower than that of LA and also LARR avoids the possibility of starvation, we suggest the use of this algorithm over RR.

Original languageEnglish (US)
Title of host publicationProceedings of the International Conference on Parallel Processing Workshops
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages45-50
Number of pages6
Volume2002-January
ISBN (Print)0769516807
DOIs
StatePublished - 2002
EventInternational Conference on Parallel Processing Workshops, ICPPW 2002 - Vancouver, Canada
Duration: Aug 18 2002Aug 21 2002

Other

OtherInternational Conference on Parallel Processing Workshops, ICPPW 2002
CountryCanada
CityVancouver
Period8/18/028/21/02

Fingerprint

Bluetooth
Look-ahead
Scheduling algorithms
Scheduling Algorithm
Scheduling
Medium access control
Throughput
Scheduling Policy
Bins
Medium Access Control
Computational complexity
Bin Packing Problem
Bin Packing
Optimal Scheduling
Optimal Policy
Control Algorithm
Scheduling Problem
Control Problem
Computational Complexity
Traffic

ASJC Scopus subject areas

  • Software
  • Mathematics(all)
  • Hardware and Architecture

Cite this

Yang, D., Nair, G., Sivaramakrishnan, B., Jayakumar, H., & Sen, A. (2002). Round robin with look ahead: A new scheduling algorithm for Bluetooth. In Proceedings of the International Conference on Parallel Processing Workshops (Vol. 2002-January, pp. 45-50). [1039710] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICPPW.2002.1039710

Round robin with look ahead : A new scheduling algorithm for Bluetooth. / Yang, Daqing; Nair, G.; Sivaramakrishnan, B.; Jayakumar, H.; Sen, Arunabha.

Proceedings of the International Conference on Parallel Processing Workshops. Vol. 2002-January Institute of Electrical and Electronics Engineers Inc., 2002. p. 45-50 1039710.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Yang, D, Nair, G, Sivaramakrishnan, B, Jayakumar, H & Sen, A 2002, Round robin with look ahead: A new scheduling algorithm for Bluetooth. in Proceedings of the International Conference on Parallel Processing Workshops. vol. 2002-January, 1039710, Institute of Electrical and Electronics Engineers Inc., pp. 45-50, International Conference on Parallel Processing Workshops, ICPPW 2002, Vancouver, Canada, 8/18/02. https://doi.org/10.1109/ICPPW.2002.1039710
Yang D, Nair G, Sivaramakrishnan B, Jayakumar H, Sen A. Round robin with look ahead: A new scheduling algorithm for Bluetooth. In Proceedings of the International Conference on Parallel Processing Workshops. Vol. 2002-January. Institute of Electrical and Electronics Engineers Inc. 2002. p. 45-50. 1039710 https://doi.org/10.1109/ICPPW.2002.1039710
Yang, Daqing ; Nair, G. ; Sivaramakrishnan, B. ; Jayakumar, H. ; Sen, Arunabha. / Round robin with look ahead : A new scheduling algorithm for Bluetooth. Proceedings of the International Conference on Parallel Processing Workshops. Vol. 2002-January Institute of Electrical and Electronics Engineers Inc., 2002. pp. 45-50
@inproceedings{c87cdb1fe1e444eba62ed2b4b5d06daf,
title = "Round robin with look ahead: A new scheduling algorithm for Bluetooth",
abstract = "We propose two new media access control (MAC) scheduling algorithms for Bluetooth whose objective is to achieve high channel utilization (throughput). Conventional scheduling policies such as round robin (RR) in the Bluetooth environment results in wastage of slots and hence poor utilization of the network resources. As Bluetooth devices are designed to carry both voice and data, scheduling becomes a complex task as slots are reserved for voice traffic at periodic intervals and the data packets are allowed to have variable size. We view the MAC scheduling problem in Bluetooth as an online bin packing problem. The two scheduling policies being proposed in the paper, look ahead (LA) and look ahead round robin (LARR), can be viewed as online bin packing with lookahead. We first analytically demonstrate that an optimal scheduling policy can have about 66{\%} improvement in throughput over the round robin policy. Our extensive simulation shows that both LA and LARR achieves nearly 10{\%} improvement in throughput over RR. As the computational complexity of LARR is lower than that of LA and also LARR avoids the possibility of starvation, we suggest the use of this algorithm over RR.",
author = "Daqing Yang and G. Nair and B. Sivaramakrishnan and H. Jayakumar and Arunabha Sen",
year = "2002",
doi = "10.1109/ICPPW.2002.1039710",
language = "English (US)",
isbn = "0769516807",
volume = "2002-January",
pages = "45--50",
booktitle = "Proceedings of the International Conference on Parallel Processing Workshops",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Round robin with look ahead

T2 - A new scheduling algorithm for Bluetooth

AU - Yang, Daqing

AU - Nair, G.

AU - Sivaramakrishnan, B.

AU - Jayakumar, H.

AU - Sen, Arunabha

PY - 2002

Y1 - 2002

N2 - We propose two new media access control (MAC) scheduling algorithms for Bluetooth whose objective is to achieve high channel utilization (throughput). Conventional scheduling policies such as round robin (RR) in the Bluetooth environment results in wastage of slots and hence poor utilization of the network resources. As Bluetooth devices are designed to carry both voice and data, scheduling becomes a complex task as slots are reserved for voice traffic at periodic intervals and the data packets are allowed to have variable size. We view the MAC scheduling problem in Bluetooth as an online bin packing problem. The two scheduling policies being proposed in the paper, look ahead (LA) and look ahead round robin (LARR), can be viewed as online bin packing with lookahead. We first analytically demonstrate that an optimal scheduling policy can have about 66% improvement in throughput over the round robin policy. Our extensive simulation shows that both LA and LARR achieves nearly 10% improvement in throughput over RR. As the computational complexity of LARR is lower than that of LA and also LARR avoids the possibility of starvation, we suggest the use of this algorithm over RR.

AB - We propose two new media access control (MAC) scheduling algorithms for Bluetooth whose objective is to achieve high channel utilization (throughput). Conventional scheduling policies such as round robin (RR) in the Bluetooth environment results in wastage of slots and hence poor utilization of the network resources. As Bluetooth devices are designed to carry both voice and data, scheduling becomes a complex task as slots are reserved for voice traffic at periodic intervals and the data packets are allowed to have variable size. We view the MAC scheduling problem in Bluetooth as an online bin packing problem. The two scheduling policies being proposed in the paper, look ahead (LA) and look ahead round robin (LARR), can be viewed as online bin packing with lookahead. We first analytically demonstrate that an optimal scheduling policy can have about 66% improvement in throughput over the round robin policy. Our extensive simulation shows that both LA and LARR achieves nearly 10% improvement in throughput over RR. As the computational complexity of LARR is lower than that of LA and also LARR avoids the possibility of starvation, we suggest the use of this algorithm over RR.

UR - http://www.scopus.com/inward/record.url?scp=11144268429&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=11144268429&partnerID=8YFLogxK

U2 - 10.1109/ICPPW.2002.1039710

DO - 10.1109/ICPPW.2002.1039710

M3 - Conference contribution

AN - SCOPUS:11144268429

SN - 0769516807

VL - 2002-January

SP - 45

EP - 50

BT - Proceedings of the International Conference on Parallel Processing Workshops

PB - Institute of Electrical and Electronics Engineers Inc.

ER -