Work

Fair channel-dependent scheduling in CDMA systems

Year: 2003

Type: article

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. I.

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

Institutions: Ericsson (Netherlands), University of California, Irvine

Language: German

Topic: Wireless Communication Networks Research

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W1548810155

FWCI: 2.389

Cites: 7

Cited by: 20

Related to: 10