Optimal decentralized spectral resource allocation for OFDMA downlink of femto networks via adaptive gradient vector step size approach

For the orthogonal frequency division multiple access (OFDMA) downlink of a femto network, the resource allocation scheme would aim to maximize the area spectral efficiency (ASE) subject to constraints on the radio resources per transmission interval accessible by each femtocell. An optimal resource allocation scheme for completely decentralized femtocell deployments leads to a nonlinear optimization problem because the cost function of the optimization problem is nonlinear. In this paper, an adaptive gradient vector step size approach is proposed for finding the optimal solution of the optimization problem. Computer numerical simulation results show that our proposed method is more efficient than existing exhaustive search methods

Decentralized spectral resource allocation for OFDMA downlink of coexisting macro/femto networks using filled function method

For an orthogonal frequency division multiple access (OFDMA) downlink of a spectrally coexisting macro and femto network, a resource allocation scheme would aim to maximize the area spectral efficiency (ASE) subject to constraints on the radio resources per transmission interval accessible by each femtocell. An optimal resource allocation scheme for completely decentralized deployments leads however to a nonconvex optimization problem. In this paper, a filled function method is employed to find the global maximum of the optimization problem. Simulation results show that our proposed method is efficient and effective

Efficient Resource Allocation and Sectorization for Fractional Frequency Reuse (FFR) in LTE Femtocell Systems

The Fractional Frequency Reuse (FFR) is a resource allocation technique that can effectively mitigate inter-cell interference (ICI) in LTE based HetNets and it is a promising solution. Various FFR schemes have been suggested to address the challenge of interference in femtocell systems. In this paper, we study the scopes of interference mitigation and capacity improvement. We propose a resource allocation scheme that gradually varies frequency resource share with distance from the eNodeB for both macrocells and femtocells in order to attain better utilization of the resources. This is performed effectively using three layers in the cell. The proposal also employs high number sectors in a cell, low interference and good frequency reuse. Monte-Carlo simulations are performed, which show that the proposed scheme achieves significantly better throughput compared to the existing FFR schemes

Dynamic Resource Allocation in Wireless Heterogeneous Networks

Deployment of low power basestations within cellular networks can potentially increase both capacity and coverage. However, such deployments require efficient resource allocation schemes for managing interference from the low power and macro basestations that are located within each other’s transmission range. In this dissertation, we propose novel and efficient dynamic resource allocation algorithms in the frequency, time and space domains. We show that the proposed algorithms perform better than the current state-of-art resource management algorithms. In the first part of the dissertation, we propose an interference management solution in the frequency domain. We introduce a distributed frequency allocation scheme that shares frequencies between macro and low power pico basestations, and guarantees a minimum average throughput to users. The scheme seeks to minimize the total number of frequencies needed to honor the minimum throughput requirements. We evaluate our scheme using detailed simulations and show that it performs on par with the centralized optimum allocation. Moreover, our proposed scheme outperforms a static frequency reuse scheme and the centralized optimal partitioning between the macro and picos. In the second part of the dissertation, we propose a time domain solution to the interference problem. We consider the problem of maximizing the alpha-fairness utility over heterogeneous wireless networks (HetNets) by jointly optimizing user association, wherein each user is associated to any one transmission point (TP) in the network, and activation fractions of all TPs. Activation fraction of a TP is the fraction of the frame duration for which it is active, and together these fractions influence the interference seen in the network. To address this joint optimization problem which we show is NP-hard, we propose an alternating optimization based approach wherein the activation fractions and the user association are optimized in an alternating manner. The subproblem of determining the optimal activation fractions is solved using a provably convergent auxiliary function method. On the other hand, the subproblem of determining the user association is solved via a simple combinatorial algorithm. Meaningful performance guarantees are derived in either case. Simulation results over a practical HetNet topology reveal the superior performance of the proposed algorithms and underscore the significant benefits of the joint optimization. In the final part of the dissertation, we propose a space domain solution to the interference problem. We consider the problem of maximizing system utility by optimizing over the set of user and TP pairs in each subframe, where each user can be served by multiple TPs. To address this optimization problem which is NP-hard, we propose a solution scheme based on difference of submodular function optimization approach. We evaluate our scheme using detailed simulations and show that it performs on par with a much more computationally demanding difference of convex function optimization scheme. Moreover, the proposed scheme performs within a reasonable percentage of the optimal solution. We further demonstrate the advantage of the proposed scheme by studying its performance with variation in different network topology parameters

Delay QoS Provisioning and Optimal Resource Allocation for Wireless Networks

Recent years have witnessed a significant growth in wireless communication and networking due to the exponential growth in mobile applications and smart devices, fueling unprecedented increase in both mobile data traffic and energy demand. Among such data traffic, real-time data transmissions in wireless systems require certain quality of service (QoS) constraints e.g., in terms of delay, buffer overflow or packet drop/loss probabilities, so that acceptable performance levels can be guaranteed for the end-users, especially in delay sensitive scenarios, such as live video transmission, interactive video (e.g., teleconferencing), and mobile online gaming. With this motivation, statistical queuing constraints are considered in this thesis, imposed as limitations on the decay rate of buffer overflow probabilities. In particular, the throughput and energy efficiency of different types of wireless network models are analyzed under QoS constraints, and optimal resource allocation algorithms are proposed to maximize the throughput or minimize the delay. In the first part of the thesis, the throughput and energy efficiency analysis for hybrid automatic repeat request (HARQ) protocols are conducted under QoS constraints. Approximations are employed for small QoS exponent values in order to obtain closed-form expressions for the throughput and energy efficiency metrics. Also, the impact of random arrivals, deadline constraints, outage probability and QoS constraints are studied. For the same system setting, the throughput of HARQ system is also analyzed using a recurrence approach, which provides more accurate results for any value of the QoS exponent. Similarly, random arrival models and deadline constraints are considered, and these results are further extended to the finite-blocklength coding regime. Next, cooperative relay networks are considered under QoS constraints. Specifically, the throughput performance in the two-hop relay channel, two-way relay channel, and multi-source multi-destination relay networks is analyzed. Finite-blocklength codes are considered for the two-hop relay channel, and optimization over the error probabilities is investigated. For the multi-source multi-destination relay network model, the throughput for both cases of with and without CSI at the transmitter sides is studied. When there is perfect CSI at the transmitter, transmission rates can be varied according to instantaneous channel conditions. When CSI is not available at the transmitter side, transmissions are performed at fixed rates, and decoding failures lead to retransmission requests via an ARQ protocol. Following the analysis of cooperative networks, the performance of both half-duplex and full-duplex operations is studied for the two-way multiple input multiple output (MIMO) system under QoS constraints. In full-duplex mode, the self-interference inflicted on the reception of a user due to simultaneous transmissions from the same user is taken into account. In this setting, the system throughput is formulated by considering the sum of the effective capacities of the users in both half-duplex and full-duplex modes. The low signal to noise ratio (SNR) regime is considered and the optimal transmission/power-allocation strategies are characterized by identifying the optimal input covariance matrices. Next, mode selection and resource allocation for device-to-device (D2D) cellular networks are studied. As the starting point, ransmission mode selection and resource allocation are analyzed for a time-division multiplexed (TDM) cellular network with one cellular user, one base station, and a pair of D2D users under rate and QoS constraints. For a more complicated setting with multiple cellular and D2D users, two joint mode selection and resource allocation algorithms are proposed. In the first algorithm, the channel allocation problem is formulated as a maximum-weight matching problem, which can be solved by employing the Hungarian algorithm. In the second algorithm, the problem is divided into three subproblems, namely user partition, power allocation and channel assignment, and a novel three-step method is proposed by combining the algorithms designed for the three subproblems. In the final part of the thesis, resource allocation algorithms are investigated for content delivery over wireless networks. Three different systems are considered. Initially, a caching algorithm is designed, which minimizes the average delay of a single-cell network. The proposed algorithm is applicable in settings with very general popularity models, with no assumptions on how file popularity varies among different users, and this algorithm is further extended to a more general setting, in which the system parameters and the distributions of channel fading change over time. Next, for D2D cellular networks operating under deadline constraints, a scheduling algorithm is designed, which manages mode selection, channel allocation and power maximization with acceptable complexity. This proposed scheduling algorithm is designed based on the convex delay cost method for a D2D cellular network with deadline constraints in an OFDMA setting. Power optimization algorithms are proposed for all possible modes, based on our utility definition. Finally, a two-step intercell interference (ICI)-aware scheduling algorithm is proposed for cloud radio access networks (C-RANs), which performs user grouping and resource allocation with the goal of minimizing delay violation probability. A novel user grouping algorithm is developed for the user grouping step, which controls the interference among the users in the same group, and the channel assignment problem is formulated as a maximum-weight matching problem in the second step, which can be solved using standard algorithms in graph theory

Busy burst technology applied to OFDMA–TDD systems

The most significant bottleneck in wireless communication systems is an ever-increasing disproportion between the bandwidth demand and the available spectrum. A major challenge in the field of wireless communications is to maximise the spatial reuse of resources whilst avoiding detrimental co-channel interference (CCI). To this end, frequency planning and centralised coordination approaches are widely used in wireless networks. However, the networks for the next generation of wireless communications are often envisioned to be decentralised, randomly distributed in space, hierarchical and support heterogeneous traffic and service types. Fixed frequency allocation would not cater for the heterogeneous demands and centralised resource allocation would be cumbersome and require a lot of signalling. Decentralised radio resource allocation based on locally available information is considered the key. In this context, the busy burst (BB) signalling concept is identified as a potential mechanism for decentralised interference management in future generation networks. Interference aware allocation of time-frequency slots (chunks) is accomplished by letting receivers transmit a BB in a time-multiplexed mini-slot, upon successful reception of data. Exploiting channel reciprocity of the time division duplex (TDD) mode, the transmitters avoid reusing the chunks where the received BB power is above a pre-determined threshold so as to limit the CCI caused towards the reserved chunks to a threshold value. In this thesis, the performance of BB signalling mechanism in orthogonal frequency division multiple access - time division duplexing (OFDMA-TDD) systems is evaluated by means of system level simulations in networks operating in ad hoc and cellular scenarios. Comparisons are made against the state-of-the-art centralised CCI avoidance and mitigation methods, viz. frequency planning, fractional frequency reuse, and antenna array with switched grid of beams, as well as decentralised methods such as the carrier sense multiple access method that attempt to avoid CCI by avoiding transmission on chunks deemed busy. The results demonstrate that with an appropriate choice of threshold parameter, BB-based techniques outperform all of the above state-of-the-art methods. Moreover, it is demonstrated that by adjusting the BB-specific threshold parameter, the system throughput can be traded off for improving throughput for links with worse channel condition, both in the ad hoc and cellular scenario. Moreover, by utilising a variable BB power that allows a receiver to signal the maximum CCI it can tolerate, it is shown that a more favourable trade-off between total system throughput and link throughput can be made. Furthermore, by performing link adaptation, it is demonstrated that the spatial reuse and the energy efficiency can be traded off by adjusting the threshold parameter. Although the BB signalling mechanism is shown to be effective in avoiding detrimental CCI, it cannot mitigate CCI by itself. On the other hand, multiple antenna techniques such as adaptive beamforming or switched beam approaches allow CCI to be mitigated but suffer from hidden node problems. The final contribution of this thesis is that by combining the BB signalling mechanism with multiple antenna techniques, it is demonstrated that the hybrid approach enhances spatial reusability of resources whilst avoiding detrimental CCI. In summary, this thesis has demonstrated that BB provides a flexible radio resource mechanism that is suitable for future generation networks

Gestión de Recursos Radio en Redes Móviles Celulares Basadas en Tecnología OFDMA para la Provisión de QoS y Control de la Interferencia

El trabajo realizado en esta tesis, enmarcado en el contexto de la provisión de QoS en redes móviles de banda ancha, se ha centrado en la propuesta y evaluación de algoritmos de asignación de recursos radio en el enlace descendente para la gestión de la interferencia en redes basadas en tecnología OFDMA. En un contexto de redes móviles de banda ancha en las que los usuarios demandan cada vez servicios más diversos y con requisitos de QoS más heterogéneos, resulta indispensable obtener un aprovechamiento máximo de los recursos radio disponibles en el sistema. Con este fin, la mayor parte de las redes contemplan un despliegue con reúso unidad de modo que los mismos recursos son utilizados en todas las celdas del sistema. En este contexto, interferencia intercelular (ICI) es uno de los factores que más impacto tienen en las prestaciones finales ofrecidas por los sistemas, especialmente para los usuarios situados en la zona exterior de la celda. El problema, lejos de estar resuelto, continúa siendo objeto de estudio pues no existe una solución óptima al mismo y existen un gran número de factores a implicados. El objetivo de esta tesis ha sido definir mecanismos de control de las interferencias intercelulares (en el caso de considerar sistema de reúso frecuencial total a nivel de celda) e intersector (en el caso de considerar reúso unidad en cada sector) que mitigan el efecto de las mismas y mejoran la calidad de la señal recibida por estos usuarios exteriores. Bajo las restricciones definidas por el mecanismo de control de interferencias, se han diseñado algoritmos eficientes para la asignación dinámica de recursos radio dependientes del canal, que aseguren a su vez el cumplimiento de los requisitos de QoS de los distintos flujos de datos