Fair channel-dependent scheduling in CDMA systems

I.C.C. de Bruin; Geert Heijenk; Magda El Zarki; Jasmine Lei Zan

Fair channel-dependent scheduling in CDMA systems

I.C.C. de Bruin, Geert Heijenk, Magda El Zarki, Jasmine Lei Zan

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

90 Downloads (Pure)

Abstract

In this study a scheduling algorithm for CDMA systems is presented which is a trade-off between two extreme ways of scheduling: C/I based and Round-Robin scheduling. The simulation results indeed display that the advantages of both these extremes have been combined in the new algorithm: a good fairness, comparable to that of the Round-Robin scheduling, together with almost the same power gain as reached in the C/I based scheduling.

Original language	English
Title of host publication	Proceedings IST Mobile & Wireless Communications Summit 2003
Place of Publication	Aveiro
Pages	737-741
Number of pages	5
Publication status	Published - 2003
Event	IST Mobile & Wireless Communications Summit 2003 - Aveiro, Portugal, Aveiro, Portugal Duration: 15 Jun 2003 → 18 Jun 2003

Conference

Conference	IST Mobile & Wireless Communications Summit 2003
Country/Territory	Portugal
City	Aveiro
Period	15/06/03 → 18/06/03
Other	15-18 Jun 2003

Access to Document

DeBruin2003fairFinal published version, 2.97 MB

Cite this

@inproceedings{d591439d38804d16aab6f15692ed69f8,

title = "Fair channel-dependent scheduling in CDMA systems",

abstract = "In this study a scheduling algorithm for CDMA systems is presented which is a trade-off between two extreme ways of scheduling: C/I based and Round-Robin scheduling. The simulation results indeed display that the advantages of both these extremes have been combined in the new algorithm: a good fairness, comparable to that of the Round-Robin scheduling, together with almost the same power gain as reached in the C/I based scheduling.",

author = "{de Bruin}, I.C.C. and Geert Heijenk and {El Zarki}, Magda and Zan, {Jasmine Lei}",

year = "2003",

language = "English",

isbn = "972-98368-1-7",

pages = "737--741",

booktitle = "Proceedings IST Mobile & Wireless Communications Summit 2003",

note = "IST Mobile & Wireless Communications Summit 2003 ; Conference date: 15-06-2003 Through 18-06-2003",

}

TY - GEN

T1 - Fair channel-dependent scheduling in CDMA systems

AU - de Bruin, I.C.C.

AU - Heijenk, Geert

AU - El Zarki, Magda

AU - Zan, Jasmine Lei

PY - 2003

Y1 - 2003

N2 - In this study a scheduling algorithm for CDMA systems is presented which is a trade-off between two extreme ways of scheduling: C/I based and Round-Robin scheduling. The simulation results indeed display that the advantages of both these extremes have been combined in the new algorithm: a good fairness, comparable to that of the Round-Robin scheduling, together with almost the same power gain as reached in the C/I based scheduling.

AB - In this study a scheduling algorithm for CDMA systems is presented which is a trade-off between two extreme ways of scheduling: C/I based and Round-Robin scheduling. The simulation results indeed display that the advantages of both these extremes have been combined in the new algorithm: a good fairness, comparable to that of the Round-Robin scheduling, together with almost the same power gain as reached in the C/I based scheduling.

M3 - Conference contribution

SN - 972-98368-1-7

SP - 737

EP - 741

BT - Proceedings IST Mobile & Wireless Communications Summit 2003

CY - Aveiro

T2 - IST Mobile & Wireless Communications Summit 2003

Y2 - 15 June 2003 through 18 June 2003

ER -

Fair channel-dependent scheduling in CDMA systems

Abstract

Conference

Access to Document

Fingerprint

Cite this