Cross-layer scheduling and resource allocation for heterogeneous traffic in 3G LTE

Richard Musabe, Hadi Larijani

    Research output: Contribution to journalArticlepeer-review

    5 Citations (Scopus)
    151 Downloads (Pure)


    3G long term evolution (LTE) introduces stringent needs in order to provide different kinds of traffic with Quality of Service (QoS) characteristics. The major problem with this nature of LTE is that it does not have any paradigm scheduling algorithm that will ideally control the assignment of resources which in turn will improve the user satisfaction. This has become an open subject and different scheduling algorithms have been proposed which are quite challenging and complex. To address this issue, in this paper, we investigate how our proposed algorithm improves the user satisfaction for heterogeneous traffic, that is, best-effort traffic such as file transfer protocol (FTP) and real-time traffic such as voice over internet protocol (VoIP). Our proposed algorithm is formulated using the cross-layer technique. The goal of our proposed algorithm is to maximize the expected total user satisfaction (total-utility) under different constraints. We compared our proposed algorithm with proportional fair (PF), exponential proportional fair (EXP-PF), and U-delay. Using simulations, our proposed algorithm improved the performance of real-time traffic based on throughput, VoIP delay, and VoIP packet loss ratio metrics while PF improved the performance of best-effort traffic based on FTP traffic received, FTP packet loss ratio, and FTP throughput metrics.
    Original languageEnglish
    Article number475232
    Number of pages13
    JournalJournal of Computer Networks and Communications
    Publication statusPublished - Aug 2014


    • scheduling algorithms
    • file transfer protocol
    • real-time traffic
    • 3G LTE


    Dive into the research topics of 'Cross-layer scheduling and resource allocation for heterogeneous traffic in 3G LTE'. Together they form a unique fingerprint.

    Cite this