Dynamic scheduling for delay guarantees for heterogeneous cognitive radio users

Ahmed Ewaisha, Cihan Tepedelenlioglu

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

2 Citations (Scopus)

Abstract

We study an uplink multi secondary user (SU) system having statistical delay constraints, and an average interference constraint to the primary user (PU). SUs with heterogeneous interference channel statistics, to the PU, experience heterogeneous delay performances since SUs causing low interference are scheduled more frequently than those causing high interference. We propose a scheduling algorithm that can provide arbitrary average delay guarantees to SUs irrespective of their statistical channel qualities. We derive the algorithm using the Lyapunov technique and show that it yields bounded queues and satisfy the interference constraints. Using simulations, we show its superiority over the Max-Weight algorithm.

Original languageEnglish (US)
Title of host publicationConference Record - Asilomar Conference on Signals, Systems and Computers
PublisherIEEE Computer Society
Pages169-173
Number of pages5
Volume2016-February
ISBN (Print)9781467385763
DOIs
StatePublished - Feb 26 2016
Event49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015 - Pacific Grove, United States
Duration: Nov 8 2015Nov 11 2015

Other

Other49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015
CountryUnited States
CityPacific Grove
Period11/8/1511/11/15

Fingerprint

Cognitive radio
Scheduling
Scheduling algorithms
Statistics

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Signal Processing

Cite this

Ewaisha, A., & Tepedelenlioglu, C. (2016). Dynamic scheduling for delay guarantees for heterogeneous cognitive radio users. In Conference Record - Asilomar Conference on Signals, Systems and Computers (Vol. 2016-February, pp. 169-173). [7421106] IEEE Computer Society. https://doi.org/10.1109/ACSSC.2015.7421106

Dynamic scheduling for delay guarantees for heterogeneous cognitive radio users. / Ewaisha, Ahmed; Tepedelenlioglu, Cihan.

Conference Record - Asilomar Conference on Signals, Systems and Computers. Vol. 2016-February IEEE Computer Society, 2016. p. 169-173 7421106.

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

Ewaisha, A & Tepedelenlioglu, C 2016, Dynamic scheduling for delay guarantees for heterogeneous cognitive radio users. in Conference Record - Asilomar Conference on Signals, Systems and Computers. vol. 2016-February, 7421106, IEEE Computer Society, pp. 169-173, 49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015, Pacific Grove, United States, 11/8/15. https://doi.org/10.1109/ACSSC.2015.7421106
Ewaisha A, Tepedelenlioglu C. Dynamic scheduling for delay guarantees for heterogeneous cognitive radio users. In Conference Record - Asilomar Conference on Signals, Systems and Computers. Vol. 2016-February. IEEE Computer Society. 2016. p. 169-173. 7421106 https://doi.org/10.1109/ACSSC.2015.7421106
Ewaisha, Ahmed ; Tepedelenlioglu, Cihan. / Dynamic scheduling for delay guarantees for heterogeneous cognitive radio users. Conference Record - Asilomar Conference on Signals, Systems and Computers. Vol. 2016-February IEEE Computer Society, 2016. pp. 169-173
@inproceedings{d7d85a7bf43249e1a7722273ca6b8145,
title = "Dynamic scheduling for delay guarantees for heterogeneous cognitive radio users",
abstract = "We study an uplink multi secondary user (SU) system having statistical delay constraints, and an average interference constraint to the primary user (PU). SUs with heterogeneous interference channel statistics, to the PU, experience heterogeneous delay performances since SUs causing low interference are scheduled more frequently than those causing high interference. We propose a scheduling algorithm that can provide arbitrary average delay guarantees to SUs irrespective of their statistical channel qualities. We derive the algorithm using the Lyapunov technique and show that it yields bounded queues and satisfy the interference constraints. Using simulations, we show its superiority over the Max-Weight algorithm.",
author = "Ahmed Ewaisha and Cihan Tepedelenlioglu",
year = "2016",
month = "2",
day = "26",
doi = "10.1109/ACSSC.2015.7421106",
language = "English (US)",
isbn = "9781467385763",
volume = "2016-February",
pages = "169--173",
booktitle = "Conference Record - Asilomar Conference on Signals, Systems and Computers",
publisher = "IEEE Computer Society",

}

TY - GEN

T1 - Dynamic scheduling for delay guarantees for heterogeneous cognitive radio users

AU - Ewaisha, Ahmed

AU - Tepedelenlioglu, Cihan

PY - 2016/2/26

Y1 - 2016/2/26

N2 - We study an uplink multi secondary user (SU) system having statistical delay constraints, and an average interference constraint to the primary user (PU). SUs with heterogeneous interference channel statistics, to the PU, experience heterogeneous delay performances since SUs causing low interference are scheduled more frequently than those causing high interference. We propose a scheduling algorithm that can provide arbitrary average delay guarantees to SUs irrespective of their statistical channel qualities. We derive the algorithm using the Lyapunov technique and show that it yields bounded queues and satisfy the interference constraints. Using simulations, we show its superiority over the Max-Weight algorithm.

AB - We study an uplink multi secondary user (SU) system having statistical delay constraints, and an average interference constraint to the primary user (PU). SUs with heterogeneous interference channel statistics, to the PU, experience heterogeneous delay performances since SUs causing low interference are scheduled more frequently than those causing high interference. We propose a scheduling algorithm that can provide arbitrary average delay guarantees to SUs irrespective of their statistical channel qualities. We derive the algorithm using the Lyapunov technique and show that it yields bounded queues and satisfy the interference constraints. Using simulations, we show its superiority over the Max-Weight algorithm.

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

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

U2 - 10.1109/ACSSC.2015.7421106

DO - 10.1109/ACSSC.2015.7421106

M3 - Conference contribution

AN - SCOPUS:84969871792

SN - 9781467385763

VL - 2016-February

SP - 169

EP - 173

BT - Conference Record - Asilomar Conference on Signals, Systems and Computers

PB - IEEE Computer Society

ER -