By Topic

Joint Scheduling for Multi-Service in Coordinated Multi-Point OFDMA Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Binru Huang ; Signals & Syst., Chalmers Univ. of Technol., Gothenburg, Sweden ; Jingya Li ; Tommy Svensson

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 optimal 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 satisfied 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.

Published in:

Vehicular Technology Conference (VTC Spring), 2012 IEEE 75th

Date of Conference:

6-9 May 2012