An efficient downlink beamforming scheme for FDD/SDMA systems

Without channel information of the downlink, the base station can generate downlink beam pattern using the weight vector used for the uplink. In the frequency division duplex system, however, it may result in significant performance degradation due to the carrier frequency offset between the uplink and downlink. To resolve this problem, we propose an efficient downlink beamforming algorithm based on a least square method with constraints. We also consider the control of null depth to obtain a desired signal to interference power ratio. Simulation results show that the proposed scheme can sufficiently reduce the interference from other users, improving the BER performance in the downlink

A novel downlink beamforming scheme for FDD/SDMA systems

When beamforming is employed in the uplink without feedback channel, the beam pattern for the downlink can be generated using the weight used for uplink beamforming. However, this scheme may result in significantly performance degradation in the frequency division duplex (FDD) because of carrier frequency offset between the uplink and downlink. In this paper we propose a novel downlink beamforming algorithm based on least square method with some constraint points which have same gain in the up/downlink beam pattern. From the constraint points, we generate downlink weight and also propose how to choose the constraint points in order to satisfy the desired signal-to-interference power ratio. Simulation results show that the proposed method can sufficiently reduce the interference from other space division multiple access (SDMA) signals, providing interference-free spatial channel

Transceiver design and interference alignment in wireless networks: complexity and solvability

University of Minnesota M.S. thesis. November 2013. Major: Mathematics. Advisor: Gennady Lyubeznik. 1 computer file (PDF); vi, 58 pages.This thesis aims to theoretically study a modern linear transceiver design strategy, namely interference alignment, in wireless networks. We consider an interference channel whereby each transmitter and receiver are equipped with multiple antennas. The basic problem is to design optimal linear transceivers (or beamformers) that can maximize the system throughput. The recent work [1] suggests that optimal beamformers should maximize the total degrees of freedom through the interference alignment equations. In this thesis, we first state the interference alignment equations and study the computational complexity of solving these equations. In particular, we prove that the problem of maximizing the total degrees of freedom for a given interference channel is NP-hard. Moreover, it is shown that even checking the achievability of a given tuple of degrees of freedom is NP-hard when each receiver is equipped with at least three antennas. Interestingly, the same problem becomes polynomial time solvable when each transmit/receive node is equipped with no more than two antennas.The second part of this thesis answers an open theoretical question about interference alignment on generic channels: What degrees of freedom tuples (d1, d2, ..., dK) are achievable through linear interference alignment for generic channels? We partially answer this question by establishing a general condition that must be satisfied by any degrees of freedom tuple (d1, d2, ..., dK) achievable through linear interference alignment. For a symmetric system with dk = d for all k, this condition implies that the total achievable DoF cannot grow linearly with K, and is in fact no more than K(M + N)/(K + 1), where M and N are the number of transmit and receive antennas, respectively. We also show that this bound is tight when the number of antennas at each transceiver is divisible by the number of data streams

Resource Allocation for Multiple-Input and Multiple-Output Interference Networks

To meet the exponentially increasing traffic data driven by the rapidly growing mobile subscriptions, both industry and academia are exploring the potential of a new genera- tion (5G) of wireless technologies. An important 5G goal is to achieve high data rate. Small cells with spectrum sharing and multiple-input multiple-output (MIMO) techniques are one of the most promising 5G technologies, since it enables to increase the aggregate data rate by improving the spectral efficiency, nodes density and transmission bandwidth, respectively. However, the increased interference in the densified networks will in return limit the achievable rate performance if not properly managed. The considered setup can be modeled as MIMO interference networks, which can be classified into the K-user MIMO interference channel (IC) and the K-cell MIMO interfering broadcast channel/multiple access channel (MIMO-IBC/IMAC) according to the number of mobile stations (MSs) simultaneously served by each base station (BS). The thesis considers two physical layer (PHY) resource allocation problems that deal with the interference for both models: 1) Pareto boundary computation for the achiev- able rate region in a K-user single-stream MIMO IC and 2) grouping-based interference alignment (GIA) with optimized IA-Cell assignment in a MIMO-IMAC under limited feedback. In each problem, the thesis seeks to provide a deeper understanding of the system and novel mathematical results, along with supporting numerical examples. Some of the main contributions can be summarized as follows. It is an open problem to compute the Pareto boundary of the achievable rate region for a K-user single-stream MIMO IC. The K-user single-stream MIMO IC models multiple transmitter-receiver pairs which operate over the same spectrum simultaneously. Each transmitter and each receiver is equipped with multiple antennas, and a single desired data stream is communicated in each transmitter-receiver link. The individual achievable rates of the K users form a K-dimensional achievable rate region. To find efficient operating points in the achievable rate region, the Pareto boundary computation problem, which can be formulated as a multi-objective optimization problem, needs to be solved. The thesis transforms the multi-objective optimization problem to two single-objective optimization problems–single constraint rate maximization problem and alternating rate profile optimization problem, based on the formulations of the ε-constraint optimization and the weighted Chebyshev optimization, respectively. The thesis proposes two alternating optimization algorithms to solve both single-objective optimization problems. The convergence of both algorithms is guaranteed. Also, a heuristic initialization scheme is provided for each algorithm to achieve a high-quality solution. By varying the weights in each single-objective optimization problem, numerical results show that both algorithms provide an inner bound very close to the Pareto boundary. Furthermore, the thesis also computes some key points exactly on the Pareto boundary in closed-form. A framework for interference alignment (IA) under limited feedback is proposed for a MIMO-IMAC. The MIMO-IMAC well matches the uplink scenario in cellular system, where multiple cells share their spectrum and operate simultaneously. In each cell, a BS receives the desired signals from multiple MSs within its own cell and each BS and each MS is equipped with multi-antenna. By allowing the inter-cell coordination, the thesis develops a distributed IA framework under limited feedback from three aspects: the GIA, the IA-Cell assignment and dynamic feedback bit allocation (DBA), respec- tively. Firstly, the thesis provides a complete study along with some new improvements of the GIA, which enables to compute the exact IA precoders in closed-form, based on local channel state information at the receiver (CSIR). Secondly, the concept of IA-Cell assignment is introduced and its effect on the achievable rate and degrees of freedom (DoF) performance is analyzed. Two distributed matching approaches and one centralized assignment approach are proposed to find a good IA-Cell assignment in three scenrios with different backhaul overhead. Thirdly, under limited feedback, the thesis derives an upper bound of the residual interference to noise ratio (RINR), formulates and solves a corresponding DBA problem. Finally, numerical results show that the proposed GIA with optimized IA-Cell assignment and the DBA greatly outperforms the traditional GIA algorithm

Resource Allocation in Multi-user MIMO Networks: Interference Management and Cooperative Communications

Nowadays, wireless communications are becoming so tightly integrated in our daily lives, especially with the global spread of laptops, tablets and smartphones. This has paved the way to dramatically increasing wireless network dimensions in terms of subscribers and amount of flowing data. Therefore, the two important fundamental requirements for the future 5G wireless networks are abilities to support high data traffic and exceedingly low latency. A likely candidate to fulfill these requirements is multicell multi-user multi-input multiple-output (MU-MIMO); also termed as coordinated multi-point (CoMP) transmission and reception. To achieve the highest possible performance in MU-MIMO networks, a properly designed resource allocation algorithm is needed. Moreover, with the rapidly growing data traffic, interference has become a major limitation in wireless networks. Interference alignment (IA) has been shown to significantly manage the interference and improve the network performance. However, how practically use IA to mitigate interference in a downlink MU-MIMO network still remains an open problem. In this dissertation, we improve the performance of MU-MIMO networks in terms of spectral efficiency, by designing and developing new beamforming algorithms that can efficiently mitigate the interference and allocate the resources. Then we mathematically analyze the performance improvement of MUMIMO networks employing proposed techniques. Fundamental relationships between network parameters and the network performance is revealed, which provide guidance on the wireless networks design. Finally, system level simulations are conducted to investigate the performance of the proposed strategies

Enhanced mobility management mechanisms for 5G networks

Many mechanisms that served the legacy networks till now, are being identified as being grossly sub-optimal for 5G networks. The reason being, the increased complexity of the 5G networks compared previous legacy systems. One such class of mechanisms, important for any wireless standard, is the Mobility Management (MM) mechanisms. MM mechanismsensure the seamless connectivity and continuity of service for a user when it moves away from the geographic location where it initially got attached to the network. In this thesis, we firstly present a detailed state of the art on MM mechanisms. Based on the 5G requirements as well as the initial discussions on Beyond 5G networks, we provision a gap analysis for the current technologies/solutions to satisfy the presented requirements. We also define the persistent challenges that exist concerning MM mechanisms for 5G and beyond networks. Based on these challenges, we define the potential solutions and a novel framework for the 5G and beyond MM mechanisms. This framework specifies a set of MM mechanisms at the access, core and the extreme edge network (users/devices) level, that will help to satisfy the requirements for the 5G and beyond MM mechanisms. Following this, we present an on demand MM service concept. Such an on-demand feature provisions the necessary reliability, scalability and flexibility to the MM mechanisms. It's objective is to ensure that appropriate resources and mobility contexts are defined for users who will have heterogeneous mobility profiles, versatile QoS requirements in a multi-RAT network. Next, in this thesis we tackle the problem of core network signaling that occurs during MM in 5G/4G networks. A novel handover signaling mechanism has been developed, which eliminates unnecessary handshakes during the handover preparation phase, while allowing the transition to future softwarized network architectures. We also provide a handover failure aware handover preparation phase signaling process. We then utilize operator data and a realistic network deployment to perform a comparative analysis of the proposed strategy and the 3GPP handover signaling strategy on a network wide deployment scenario. We show the benefits of our strategy in terms of latency of handover process, and the transmission and processing cost incurred. Lastly, a novel user association and resource allocation methodology, namely AURA-5G, has been proposed. AURA-5G addresses scenarios wherein applications with heterogeneous requirements, i.e., enhanced Mobile Broadband (eMBB) and massive Machine Type Communications (mMTC), are present simultaneously. Consequently, a joint optimization process for performing the user association and resource allocation while being cognizant of heterogeneous application requirements, has been performed. We capture the peculiarities of this important mobility management process through the various constraints, such as backhaul requirements, dual connectivity options, available access resources, minimum rate requirements, etc., that we have imposed on a Mixed Integer Linear Program (MILP). The objective function of this established MILP problem is to maximize the total network throughput of the eMBB users, while satisfying the minimum requirements of the mMTC and eMBB users defined in a given scenario. Through numerical evaluations we show that our approach outperforms the baseline user association scenario significantly. Moreover, we have presented a system fairness analysis, as well as a novel fidelity and computational complexity analysis for the same, which express the utility of our methodology given the myriad network scenarios.Muchos mecanismos que sirvieron en las redes actuales, se están identificando como extremadamente subóptimos para las redes 5G. Esto es debido a la mayor complejidad de las redes 5G. Un tipo de mecanismo importante para cualquier estándar inalámbrico, consiste en el mecanismo de gestión de la movilidad (MM). Los mecanismos MM aseguran la conectividad sin interrupciones y la continuidad del servicio para un usuario cuando éste se aleja de la ubicación geográfica donde inicialmente se conectó a la red. En esta tesis, presentamos, en primer lugar, un estado del arte detallado de los mecanismos MM. Bas ándonos en los requisitos de 5G, así como en las discusiones iniciales sobre las redes Beyond 5G, proporcionamos un análisis de las tecnologías/soluciones actuales para satisfacer los requisitos presentados. También definimos los desafíos persistentes que existen con respecto a los mecanismos MM para redes 5G y Beyond 5G. En base a estos desafíos, definimos las posibles soluciones y un marco novedoso para los mecanismos 5G y Beyond 5G de MM. Este marco especifica un conjunto de mecanismos MM a nivel de red acceso, red del núcleo y extremo de la red (usuarios/dispositivos), que ayudarán a satisfacer los requisitos para los mecanismos MM 5G y posteriores. A continuación, presentamos el concepto de servicio bajo demanda MM. Tal característica proporciona la confiabilidad, escalabilidad y flexibilidad necesarias para los mecanismos MM. Su objetivo es garantizar que se definan los recursos y contextos de movilidad adecuados para los usuarios que tendrán perfiles de movilidad heterogéneos, y requisitos de QoS versátiles en una red multi-RAT. Más adelante, abordamos el problema de la señalización de la red troncal que ocurre durante la gestión de la movilidad en redes 5G/4G. Se ha desarrollado un nuevo mecanismo de señalización de handover, que elimina los intercambios de mensajes innecesarios durante la fase de preparación del handover, al tiempo que permite la transición a futuras arquitecturas de red softwarizada. Utilizamos los datos de operadores y consideramos un despliegue de red realista para realizar un análisis comparativo de la estrategia propuesta y la estrategia de señalización de 3GPP. Mostramos los beneficios de nuestra estrategia en términos de latencia del proceso de handover y los costes de transmisión y procesado. Por último, se ha propuesto una nueva asociación de usuarios y una metodología de asignación de recursos, i.e, AURA-5G. AURA-5G aborda escenarios en los que las aplicaciones con requisitos heterogéneos, i.e., enhanced Mobile Broadband (eMBB) y massive Machine Type Communications (mMTC), están presentes simultáneamente. En consecuencia, se ha llevado a cabo un proceso de optimización conjunta para realizar la asociación de usuarios y la asignación de recursos mientras se tienen en cuenta los requisitos de aplicaciónes heterogéneas. Capturamos las peculiaridades de este importante proceso de gestión de la movilidad a través de las diversas restricciones impuestas, como son los requisitos de backhaul, las opciones de conectividad dual, los recursos de la red de acceso disponibles, los requisitos de velocidad mínima, etc., que hemos introducido en un Mixed Integer Linear Program (MILP). La función objetivo de este problema MILP es maximizar el rendimiento total de la red de los usuarios de eMBB, y a la vez satisfacer los requisitos mínimos de los usuarios de mMTC y eMBB definidos en un escenario dado. A través de evaluaciones numéricas, mostramos que nuestro enfoque supera significativamente el escenario de asociación de usuarios de referencia. Además, hemos presentado un análisis de la justicia del sistema, así como un novedoso análisis de fidelidad y complejidad computacional para el mismo, que expresa la utilidad de nuestra metodología

Enhanced mobility management mechanisms for 5G networks

Many mechanisms that served the legacy networks till now, are being identified as being grossly sub-optimal for 5G networks. The reason being, the increased complexity of the 5G networks compared previous legacy systems. One such class of mechanisms, important for any wireless standard, is the Mobility Management (MM) mechanisms. MM mechanismsensure the seamless connectivity and continuity of service for a user when it moves away from the geographic location where it initially got attached to the network. In this thesis, we firstly present a detailed state of the art on MM mechanisms. Based on the 5G requirements as well as the initial discussions on Beyond 5G networks, we provision a gap analysis for the current technologies/solutions to satisfy the presented requirements. We also define the persistent challenges that exist concerning MM mechanisms for 5G and beyond networks. Based on these challenges, we define the potential solutions and a novel framework for the 5G and beyond MM mechanisms. This framework specifies a set of MM mechanisms at the access, core and the extreme edge network (users/devices) level, that will help to satisfy the requirements for the 5G and beyond MM mechanisms. Following this, we present an on demand MM service concept. Such an on-demand feature provisions the necessary reliability, scalability and flexibility to the MM mechanisms. It's objective is to ensure that appropriate resources and mobility contexts are defined for users who will have heterogeneous mobility profiles, versatile QoS requirements in a multi-RAT network. Next, in this thesis we tackle the problem of core network signaling that occurs during MM in 5G/4G networks. A novel handover signaling mechanism has been developed, which eliminates unnecessary handshakes during the handover preparation phase, while allowing the transition to future softwarized network architectures. We also provide a handover failure aware handover preparation phase signaling process. We then utilize operator data and a realistic network deployment to perform a comparative analysis of the proposed strategy and the 3GPP handover signaling strategy on a network wide deployment scenario. We show the benefits of our strategy in terms of latency of handover process, and the transmission and processing cost incurred. Lastly, a novel user association and resource allocation methodology, namely AURA-5G, has been proposed. AURA-5G addresses scenarios wherein applications with heterogeneous requirements, i.e., enhanced Mobile Broadband (eMBB) and massive Machine Type Communications (mMTC), are present simultaneously. Consequently, a joint optimization process for performing the user association and resource allocation while being cognizant of heterogeneous application requirements, has been performed. We capture the peculiarities of this important mobility management process through the various constraints, such as backhaul requirements, dual connectivity options, available access resources, minimum rate requirements, etc., that we have imposed on a Mixed Integer Linear Program (MILP). The objective function of this established MILP problem is to maximize the total network throughput of the eMBB users, while satisfying the minimum requirements of the mMTC and eMBB users defined in a given scenario. Through numerical evaluations we show that our approach outperforms the baseline user association scenario significantly. Moreover, we have presented a system fairness analysis, as well as a novel fidelity and computational complexity analysis for the same, which express the utility of our methodology given the myriad network scenarios.Muchos mecanismos que sirvieron en las redes actuales, se están identificando como extremadamente subóptimos para las redes 5G. Esto es debido a la mayor complejidad de las redes 5G. Un tipo de mecanismo importante para cualquier estándar inalámbrico, consiste en el mecanismo de gestión de la movilidad (MM). Los mecanismos MM aseguran la conectividad sin interrupciones y la continuidad del servicio para un usuario cuando éste se aleja de la ubicación geográfica donde inicialmente se conectó a la red. En esta tesis, presentamos, en primer lugar, un estado del arte detallado de los mecanismos MM. Bas ándonos en los requisitos de 5G, así como en las discusiones iniciales sobre las redes Beyond 5G, proporcionamos un análisis de las tecnologías/soluciones actuales para satisfacer los requisitos presentados. También definimos los desafíos persistentes que existen con respecto a los mecanismos MM para redes 5G y Beyond 5G. En base a estos desafíos, definimos las posibles soluciones y un marco novedoso para los mecanismos 5G y Beyond 5G de MM. Este marco especifica un conjunto de mecanismos MM a nivel de red acceso, red del núcleo y extremo de la red (usuarios/dispositivos), que ayudarán a satisfacer los requisitos para los mecanismos MM 5G y posteriores. A continuación, presentamos el concepto de servicio bajo demanda MM. Tal característica proporciona la confiabilidad, escalabilidad y flexibilidad necesarias para los mecanismos MM. Su objetivo es garantizar que se definan los recursos y contextos de movilidad adecuados para los usuarios que tendrán perfiles de movilidad heterogéneos, y requisitos de QoS versátiles en una red multi-RAT. Más adelante, abordamos el problema de la señalización de la red troncal que ocurre durante la gestión de la movilidad en redes 5G/4G. Se ha desarrollado un nuevo mecanismo de señalización de handover, que elimina los intercambios de mensajes innecesarios durante la fase de preparación del handover, al tiempo que permite la transición a futuras arquitecturas de red softwarizada. Utilizamos los datos de operadores y consideramos un despliegue de red realista para realizar un análisis comparativo de la estrategia propuesta y la estrategia de señalización de 3GPP. Mostramos los beneficios de nuestra estrategia en términos de latencia del proceso de handover y los costes de transmisión y procesado. Por último, se ha propuesto una nueva asociación de usuarios y una metodología de asignación de recursos, i.e, AURA-5G. AURA-5G aborda escenarios en los que las aplicaciones con requisitos heterogéneos, i.e., enhanced Mobile Broadband (eMBB) y massive Machine Type Communications (mMTC), están presentes simultáneamente. En consecuencia, se ha llevado a cabo un proceso de optimización conjunta para realizar la asociación de usuarios y la asignación de recursos mientras se tienen en cuenta los requisitos de aplicaciónes heterogéneas. Capturamos las peculiaridades de este importante proceso de gestión de la movilidad a través de las diversas restricciones impuestas, como son los requisitos de backhaul, las opciones de conectividad dual, los recursos de la red de acceso disponibles, los requisitos de velocidad mínima, etc., que hemos introducido en un Mixed Integer Linear Program (MILP). La función objetivo de este problema MILP es maximizar el rendimiento total de la red de los usuarios de eMBB, y a la vez satisfacer los requisitos mínimos de los usuarios de mMTC y eMBB definidos en un escenario dado. A través de evaluaciones numéricas, mostramos que nuestro enfoque supera significativamente el escenario de asociación de usuarios de referencia. Además, hemos presentado un análisis de la justicia del sistema, así como un novedoso análisis de fidelidad y complejidad computacional para el mismo, que expresa la utilidad de nuestra metodología.Postprint (published version

ENERGY AWARE RESOURCE ALLOCATION IN GREEN WIRELESS NETWORKS

Ph.DDOCTOR OF PHILOSOPH