CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

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

Binru Huang (Institutionen för signaler och system, Kommunikationssystem) ; Jingya Li (Institutionen för signaler och system, Kommunikationssystem) ; Tommy Svensson (Institutionen för signaler och system, Kommunikationssystem)
2012 IEEE 75th Vehicular Technology Conference: VTC2012-Spring 6-9 May 2012, Yokohama, Japan (1550-2252). p. Art. no. 6240135. (2012)
[Konferensbidrag, refereegranskat]

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 greedy user selection (GUC) based scheme. Via simulation results, we show 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 GUC based algorithm.

Nyckelord: Ant colony optimization (ACO), coordinated multi-point (CoMP), OFDMA, multiple services, scheduling



Den här publikationen ingår i följande styrkeområden:

Läs mer om Chalmers styrkeområden  

Denna post skapades 2012-01-11. Senast ändrad 2016-08-18.
CPL Pubid: 152256

 

Läs direkt!

Lokal fulltext (fritt tillgänglig)

Länk till annan sajt (kan kräva inloggning)