Performance analysis of SNR-based scheduling policies in asymmetric broadcast ergodic fading channel

We analyze the performance of SNR-based scheduling algorithms in broadcast ergodic fading channels where multiuser selection diversity is exploited. At each channel state, the user with the highest weighted signal-to-noise ratio is selected to be transmitted. The use of weights associated to the users allows us to control the degree of fairness among users and to arrange them according to a prescribed quality of service. These weights parametrize the scheduling algorithms so each set of weights corresponds to a specific scheduling algorithm. Assuming Rayleigh fading broadcast channel, we derive a closed-form expression for the achievable user’s rates as a function of the scheduling algorithm, the channel fading statistics of each user, and the transmit power. With the help of this expression, we solve some interesting inverse problems. For example, for a given arbitrary channel statistics we obtain the optimum scheduling algorithm to achieve a prescribed set of users’ rates with minimum transmit power

Multiuser Switched Diversity Scheduling Schemes

Multiuser switched-diversity scheduling schemes were recently proposed in order to overcome the heavy feedback requirements of conventional opportunistic scheduling schemes by applying a threshold-based, distributed, and ordered scheduling mechanism. The main idea behind these schemes is that slight reduction in the prospected multiuser diversity gains is an acceptable trade-off for great savings in terms of required channel-state-information feedback messages. In this work, we characterize the achievable rate region of multiuser switched diversity systems and compare it with the rate region of full feedback multiuser diversity systems. We propose also a novel proportional fair multiuser switched-based scheduling scheme and we demonstrate that it can be optimized using a practical and distributed method to obtain the feedback thresholds. We finally demonstrate by numerical examples that switched-diversity scheduling schemes operate within 0.3 bits/sec/Hz from the ultimate network capacity of full feedback systems in Rayleigh fading conditions.Comment: Accepted at IEEE Transactions on Communications, to appear 2012, funded by NPRP grant 08-577-2-241 from QNR

Performance analysis of SNRbased scheduling policies in asymmetric broadcast ergodic fading channels

We analyze the performance of SNR-based scheduling algorithms in broadcast ergodic fading channels where multiuser selection diversity is exploited. At each channel state, the user with the highest weighted signal-to-noise ratio is selected to be transmitted. The use of weights associated to the users allows us to control the degree of fairness among users and to arrange them according to a prescribed quality of service. These weights parametrize the scheduling algorithms so each set of weights corresponds to a specific scheduling algorithm. Assuming Rayleigh fading broadcast channel, we derive a closed-form expression for the achievable user's rates as a function of the scheduling algorithm, the channel fading statistics of each user, and the transmit power. With the help of this expression, we solve some interesting inverse problems. For example, for a given arbitrary channel statistics we obtain the optimum scheduling algorithm to achieve a prescribed set of users' rates with minimum transmit power

Hierarchical Radio Resource Optimization for Heterogeneous Networks with Enhanced Inter-cell Interference Coordination (eICIC)

Interference is a major performance bottleneck in Heterogeneous Network (HetNet) due to its multi-tier topological structure. We propose almost blank resource block (ABRB) for interference control in HetNet. When an ABRB is scheduled in a macro BS, a resource block (RB) with blank payload is transmitted and this eliminates the interference from this macro BS to the pico BSs. We study a two timescale hierarchical radio resource management (RRM) scheme for HetNet with dynamic ABRB control. The long term controls, such as dynamic ABRB, are adaptive to the large scale fading at a RRM server for co-Tier and cross-Tier interference control. The short term control (user scheduling) is adaptive to the local channel state information within each BS to exploit the multi-user diversity. The two timescale optimization problem is challenging due to the exponentially large solution space. We exploit the sparsity in the interference graph of the HetNet topology and derive structural properties for the optimal ABRB control. Based on that, we propose a two timescale alternative optimization solution for the user scheduling and ABRB control. The solution has low complexity and is asymptotically optimal at high SNR. Simulations show that the proposed solution has significant gain over various baselines.Comment: 14 pages, 8 figure

D11.2 Consolidated results on the performance limits of wireless communications

Deliverable D11.2 del projecte europeu NEWCOM#The report presents the Intermediate Results of N# JRAs on Performance Limits of Wireless Communications and highlights the fundamental issues that have been investigated by the WP1.1. The report illustrates the Joint Research Activities (JRAs) already identified during the first year of the project which are currently ongoing. For each activity there is a description, an illustration of the adherence and relevance with the identified fundamental open issues, a short presentation of the preliminary results, and a roadmap for the joint research work in the next year. Appendices for each JRA give technical details on the scientific activity in each JRA.Peer ReviewedPreprin