Joint scheduling for multi-service in coordinated multi-point OFDMA networks

3Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, the issues upon user scheduling in the downlink packet transmission for multiple services are addressed for coordinated multi-point (CoMP) OFDMA networks. We consider mixed traffic with voice over IP (VOIP) and best effort (BE) services. In order to improve cell-edge performance and guarantee diverse quality of service (QoS), a utility-based joint scheduling algorithm is proposed, which consists of two steps: ant colony optimization (ACO) based joint user selection and greedy subchannel assignment. We compare the proposed algorithm with the opimal algorithm and the greedy user selection (GUS) based scheme. Via simulation results, we show that the performance of our proposed algorithm well approaches to that of the optimal solution. It is also observed that 95% of BE users are satsified with average cell-edge data rate greater than 200kbps by using either of the two algorithms. Whereas, our proposed algorithm ensures that more than 95% of VoIP users are satisfied with packet drop ratio less than 2%, compared to 78% by the GUS based algorithm. © 2012 IEEE.

Cite

CITATION STYLE

APA

Huang, B., Li, J., & Svensson, T. (2012). Joint scheduling for multi-service in coordinated multi-point OFDMA networks. In IEEE Vehicular Technology Conference. https://doi.org/10.1109/VETECS.2012.6240135

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free