Joint Resource Allocation for eICIC in Heterogeneous Networks

Interference coordination between high-power macros and low-power picos deeply impacts the performance of heterogeneous networks (HetNets). It should deal with three challenges: user association with macros and picos, the amount of almost blank subframe (ABS) that macros should reserve for picos, and resource block (RB) allocation strategy in each eNB. We formulate the three issues jointly for sum weighted logarithmic utility maximization while maintaining proportional fairness of users. A class of distributed algorithms are developed to solve the joint optimization problem. Our framework can be deployed for enhanced inter-cell interference coordination (eICIC) in existing LTE-A protocols. Extensive evaluation are performed to verify the effectiveness of our algorithms.Comment: Accepted by Globecom 201

CLEVER: a cooperative and cross-layer approach to video streaming in HetNets

We investigate the problem of providing a video streaming service to mobile users in an heterogeneous cellular network composed of micro e-NodeBs (eNBs) and macro e-NodeBs (MeNBs). More in detail, we target a cross-layer dynamic allocation of the bandwidth resources available over a set of eNBs and one MeNB, with the goal of reducing the delay per chunk experienced by users. After optimally formulating the problem of minimizing the chunk delay, we detail the Cross LayEr Video stReaming (CLEVER) algorithm, to practically tackle it. CLEVER makes allocation decisions on the basis of information retrieved from the application layer aswell as from lower layers. Results, obtained over two representative case studies, show that CLEVER is able to limit the chunk delay, while also reducing the amount of bandwidth reserved for offloaded users on the MeNB, as well as the number of offloaded users. In addition, we show that CLEVER performs clearly better than two selected reference algorithms, while being very close to a best bound. Finally, we show that our solution is able to achieve high fairness indexes and good levels of Quality of Experience (QoE)

Joint Dynamic Radio Resource Allocation and Mobility Load Balancing in 3GPP LTE Multi-Cell Network

Load imbalance, together with inefficient utilization of system resource, constitute major factors responsible for poor overall performance in Long Term Evolution (LTE) network. In this paper, a novel scheme of joint dynamic resource allocation and load balancing is proposed to achieve a balanced performance improvement in 3rd Generation Partnership Project (3GPP) LTE Self-Organizing Networks (SON). The new method which aims at maximizing network resource efficiency subject to inter-cell interference and intra-cell resource constraints is implemented in two steps. In the first step, an efficient resource allocation, including user scheduling and power assignment, is conducted in a distributed manner to serve as many users in the whole network as possible. In the second step, based on the resource allocation scheme, the optimization objective namely network resource efficiency can be calculated and load balancing is implemented by switching the user that can maximize the objective function. Lagrange Multipliers method and heuristic algorithm are used to resolve the formulated optimization problem. Simulation results show that our algorithm achieves better performance in terms of user throughput, fairness, load balancing index and unsatisfied user number compared with the traditional approach which takes resource allocation and load balancing into account, respectively

Dynamic Time-domain Duplexing for Self-backhauled Millimeter Wave Cellular Networks

Millimeter wave (mmW) bands between 30 and 300 GHz have attracted considerable attention for next-generation cellular networks due to vast quantities of available spectrum and the possibility of very high-dimensional antenna ar-rays. However, a key issue in these systems is range: mmW signals are extremely vulnerable to shadowing and poor high-frequency propagation. Multi-hop relaying is therefore a natural technology for such systems to improve cell range and cell edge rates without the addition of wired access points. This paper studies the problem of scheduling for a simple infrastructure cellular relay system where communication between wired base stations and User Equipment follow a hierarchical tree structure through fixed relay nodes. Such a systems builds naturally on existing cellular mmW backhaul by adding mmW in the access links. A key feature of the proposed system is that TDD duplexing selections can be made on a link-by-link basis due to directional isolation from other links. We devise an efficient, greedy algorithm for centralized scheduling that maximizes network utility by jointly optimizing the duplexing schedule and resources allocation for dense, relay-enhanced OFDMA/TDD mmW networks. The proposed algorithm can dynamically adapt to loading, channel conditions and traffic demands. Significant throughput gains and improved resource utilization offered by our algorithm over the static, globally-synchronized TDD patterns are demonstrated through simulations based on empirically-derived channel models at 28 GHz.Comment: IEEE Workshop on Next Generation Backhaul/Fronthaul Networks - BackNets 201