Multicast Scheduling and Resource Allocation Algorithms for OFDMA-Based Systems: A Survey

Multicasting is emerging as an enabling technology for multimedia transmissions over wireless networks to support several groups of users with flexible quality of service (QoS)requirements. Although multicast has huge potential to push the limits of next generation communication systems; it is however one of the most challenging issues currently being addressed. In this survey, we explain multicast group formation and various forms of group rate determination approaches. We also provide a systematic review of recent channel-aware multicast scheduling and resource allocation (MSRA) techniques proposed for downlink multicast services in OFDMA based systems. We study these enabling algorithms, evaluate their core characteristics, limitations and classify them using multidimensional matrix. We cohesively review the algorithms in terms of their throughput maximization, fairness considerations, performance complexities, multi-antenna support, optimality and simplifying assumptions. We discuss existing standards employing multicasting and further highlight some potential research opportunities in multicast systems

Resource Allocation in Uplink Long Term Evolution

One of the most crucial goals of future cellular systems is to minimize transmission power while increasing system performance. This master thesis work presents two channel-queue-aware scheduling schemes to allocate channels among active users in uplink LTE. Transmission power, packet delays and data rates are three of the most important criteria critically affecting the resource allocation designs. Therefore, each of these two scheduling algorithms proposes a practical method that assigns resources in such a way so as to optimally maximize data rate and minimize transmission power and packet delays while ensuring the QoS requirements. After converting the resource allocation problem into an optimization problem, the objective function and associated constraints are derived. Due to the contiguity constraint, which is imposed by SC-FDMA in uplink LTE, binary integer programming is employed to solve the optimization problem. Also the heuristic algorithms that approximate optimal schemes are presented to decrease the algorithm complexity

Performance Analysis of Heterogeneous Feedback Design in an OFDMA Downlink with Partial and Imperfect Feedback

Current OFDMA systems group resource blocks into subband to form the basic feedback unit. Homogeneous feedback design with a common subband size is not aware of the heterogeneous channel statistics among users. Under a general correlated channel model, we demonstrate the gain of matching the subband size to the underlying channel statistics motivating heterogeneous feedback design with different subband sizes and feedback resources across clusters of users. Employing the best-M partial feedback strategy, users with smaller subband size would convey more partial feedback to match the frequency selectivity. In order to develop an analytical framework to investigate the impact of partial feedback and potential imperfections, we leverage the multi-cluster subband fading model. The perfect feedback scenario is thoroughly analyzed, and the closed form expression for the average sum rate is derived for the heterogeneous partial feedback system. We proceed to examine the effect of imperfections due to channel estimation error and feedback delay, which leads to additional consideration of system outage. Two transmission strategies: the fix rate and the variable rate, are considered for the outage analysis. We also investigate how to adapt to the imperfections in order to maximize the average goodput under heterogeneous partial feedback.Comment: To appear in IEEE Trans. on Signal Processin

Efficient Scheduling Algorithms for Wireless Resource Allocation and Virtualization in Wireless Networks

The continuing growth in demand for better mobile broadband experiences has motivated rapid development of radio-access technologies to support high data rates and improve quality of service (QoS) and quality of experience (QoE) for mobile users. However, the modern radio-access technologies pose new challenges to mobile network operators (MNO) and wireless device designers such as reducing the total cost of ownership while supporting high data throughput per user, and extending battery life-per-charge of the mobile devices. In this thesis, a variety of optimization techniques aimed at providing innovative solutions for such challenges are explored. The thesis is divided into two parts. In the first part, the challenge of extending battery life-per-charge is addressed. Optimal and suboptimal power-efficient schedulers that minimize the total transmit power and meet the QoS requirements of the users are presented. The second outlines the benefits and challenges of deploying wireless resource virtualization (WRV) concept as a promising solution for satisfying the growing demand for mobile data and reducing capital and operational costs. First, a WRV framework is proposed for single cell zone that is able to centralize and share the spectrum resources between multiple MNOs. Consequently, several WRV frameworks are proposed, which virtualize the spectrum resource of the entire network for cloud radio access network (C-RAN)- one of the front runners for the next generation network architecture. The main contributions of this thesis are in designing optimal and suboptimal solutions for the aforementioned challenges. In most cases, the optimal solutions suffer from high complexity, and therefore low-complexity suboptimal solutions are provided for practical systems. The optimal solutions are used as benchmarks for evaluating the suboptimal solutions. The results prove that the proposed solutions effectively contribute in addressing the challenges caused by the demand for high data rates and power transmission in mobile networks

Wireless Power Transfer and Data Collection in Wireless Sensor Networks

In a rechargeable wireless sensor network, the data packets are generated by sensor nodes at a specific data rate, and transmitted to a base station. Moreover, the base station transfers power to the nodes by using Wireless Power Transfer (WPT) to extend their battery life. However, inadequately scheduling WPT and data collection causes some of the nodes to drain their battery and have their data buffer overflow, while the other nodes waste their harvested energy, which is more than they need to transmit their packets. In this paper, we investigate a novel optimal scheduling strategy, called EHMDP, aiming to minimize data packet loss from a network of sensor nodes in terms of the nodes' energy consumption and data queue state information. The scheduling problem is first formulated by a centralized MDP model, assuming that the complete states of each node are well known by the base station. This presents the upper bound of the data that can be collected in a rechargeable wireless sensor network. Next, we relax the assumption of the availability of full state information so that the data transmission and WPT can be semi-decentralized. The simulation results show that, in terms of network throughput and packet loss rate, the proposed algorithm significantly improves the network performance.Comment: 30 pages, 8 figures, accepted to IEEE Transactions on Vehicular Technolog