Scheduling of Multicast and Unicast Services under Limited Feedback by using Rateless Codes

Many opportunistic scheduling techniques are impractical because they require accurate channel state information (CSI) at the transmitter. In this paper, we investigate the scheduling of unicast and multicast services in a downlink network with a very limited amount of feedback information. Specifically, unicast users send imperfect (or no) CSI and infrequent acknowledgements (ACKs) to a base station, and multicast users only report infrequent ACKs to avoid feedback implosion. We consider the use of physical-layer rateless codes, which not only combats channel uncertainty, but also reduces the overhead of ACK feedback. A joint scheduling and power allocation scheme is developed to realize multiuser diversity gain for unicast service and multicast gain for multicast service. We prove that our scheme achieves a near-optimal throughput region. Our simulation results show that our scheme significantly improves the network throughput over schemes employing fixed-rate codes or using only unicast communications

Dealing with VoIP Calls During “Busy Hour” in LTE

Postprint (published version

Comparative Analysis of Scheduling Algorithms Performance in a Long Term Evolution Network

The advancement in cellular communications has enhanced the special attention given to the study of resource allocation schemes. This study is to enhance communications to attain efficiency and thereby offers fairness to all users in the face of congestion experienced anytime a new product is rolled out. The comparative analysis was done on the performance of Enhanced Proportional Fair, Qos-Aware Proportional Fair and Logarithmic rule scheduling algorithms in Long Term Evolution in this work. These algorithms were simulated using LTE system toolbox in MATLAB and their performances were compared using Throughput, Packet delay and Packet Loss Ratio. The results showed Qos-Aware Proportional Fair has a better performance in all the metrics used for the evaluation

A New Downlink Scheduling Algorithm Proposed for Real Time Traffic in LTE System

The Third Generation Partnership Project (3GPP) has developed a new cellular standard based packet switching allowing high data rate, 100 Mbps in Downlink and 50 Mbps in Uplink, and having the flexibility to be used in different bandwidths ranging from 1.4 MHz up to 20 MHz, this standard is termed LTE (Long Term Evolution). Radio Resource Management (RRM) procedure is one of the key design roles for improving LTE system performance, Packet scheduling is one of the RRM mechanisms and it is responsible for radio resources allocation, However, Scheduling algorithms are not defined in 3GPP specifications. Therefore, it gets a track interests for researchers. In this paper we proposed a new LTE scheduling algorithm and we compared its performances with other well known algorithms such as Proportional Fairness (PF), Modified Largest Weighted Delay First (MLWDF), and Exponential Proportional Fairness (EXPPF) in downlink direction. The simulation results shows that the proposed scheduler satisfies the quality of service (QoS) requirements of the real-time traffic in terms of packet loss ratio (PLR), average throughput and packet delay. This paper also discusses the key issues of scheduling algorithms to be considered in future traffic requirements

3GPP QoS-based scheduling framework for LTE

This paper proposes the design of a scheduling framework for the downlink of the Long Term Evolution (LTE) system with the objective of meeting the Quality of Service (QoS) requirements as defined by the QoS architecture of the 3G Partnership Project (3GPP) specifications. We carry out a thorough review of 3GPP specifications analyzing the requirements of the 3GPP QoS architecture. LTE bearers may be associated with a Guaranteed Bit Rate (i.e., GBR bearers) or not (i.e., non-GBR bearers). Additionally, the specifications establish a Packet Delay Budget (PDB) to limit the maximum packet transfer delay. To achieve our goal, we design a channel-aware service discipline for GBR bearers which is able to fulfill not only the GBR but also the PDB. Additionally, we also design an algorithm for prioritizing GBR and non-GBR bearers from different QoS Class Identifiers (QCIs) following 3GPP QoS rules. We compare the proposed framework with two reference schedulers by means of network-level simulations. The results will show the ability of the proposed framework to address the QoS requirements from 3GPP specifications while providing an interesting performance from a spectral efficiency viewpoint.This work is partially supported by the Spanish Ministry of Economy and Competitiveness and the European Regional Development Fund (project TIN2013-46223-P)