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 proceedingConference contributionAcademicpeer-review

    58 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 languageEnglish
    Title of host publicationProceedings IST Mobile & Wireless Communications Summit 2003
    Place of PublicationAveiro
    Pages737-741
    Number of pages5
    Publication statusPublished - 2003

    Fingerprint Dive into the research topics of 'Fair channel-dependent scheduling in CDMA systems'. Together they form a unique fingerprint.

  • Cite this

    de Bruin, I. C. C., Heijenk, G., El Zarki, M., & Zan, J. L. (2003). Fair channel-dependent scheduling in CDMA systems. In Proceedings IST Mobile & Wireless Communications Summit 2003 (pp. 737-741). Aveiro.