An Optimization Theoretical Framework for Resource Allocation over Wireless Networks

With the advancement of wireless technologies, wireless networking has become ubiquitous owing to the great demand of pervasive mobile applications. Some fundamental challenges exist for the next generation wireless network design such as time varying nature of wireless channels, co-channel interferences, provisioning of heterogeneous type of services, etc. So how to overcome these difficulties and improve the system performance have become an important research topic. Dynamic resource allocation is a general strategy to control the interferences and enhance the performance of wireless networks. The basic idea behind dynamic resource allocation is to utilize the channel more efficiently by sharing the spectrum and reducing interference through optimizing parameters such as the transmitting power, symbol transmission rate, modulation scheme, coding scheme, bandwidth, etc. Moreover, the network performance can be further improved by introducing diversity, such as multiuser, time, frequency, and space diversity. In addition, cross layer approach for resource allocation can provide advantages such as low overhead, more efficiency, and direct end-to-end QoS provision. The designers for next generation wireless networks face the common problem of how to optimize the system objective under the user Quality of Service (QoS) constraint. There is a need of unified but general optimization framework for resource allocation to allow taking into account a diverse set of objective functions with various QoS requirements, while considering all kinds of diversity and cross layer approach. We propose an optimization theoretical framework for resource allocation and apply these ideas to different network situations such as: 1.Centralized resource allocation with fairness constraint 2.Distributed resource allocation using game theory 3.OFDMA resource allocation 4.Cross layer approach On the whole, we develop a universal view of the whole wireless networks from multiple dimensions: time, frequency, space, user, and layers. We develop some schemes to fully utilize the resources. The success of the proposed research will significantly improve the way how to design and analyze resource allocation over wireless networks. In addition, the cross-layer optimization nature of the problem provides an innovative insight into vertical integration of wireless networks

Centralized and partial decentralized design for the Fog Radio Access Network

Fog Radio Access Network (F-RAN) has been shown to be a promising network architecture for the 5G network. With F-RAN, certain amount of signal processing functionalities are pushed from the Base Station (BS) on the network edge to the BaseBand Units (BBU) pool located remotely in the cloud. Hence, partially centralized network operation and management can be achieved, which can greatly improve the energy and spectral efficiency of the network, in order to meet the requirements of 5G. In this work, the optimal design for both uplink and downlink of F-RAN are intensively investigated

Distributed optimisation techniques for wireless networks

Alongside the ever increasing traffic demand, the fifth generation (5G) cellular network architecture is being proposed to provide better quality of service, increased data rate, decreased latency, and increased capacity. Without any doubt, the 5G cellular network will comprise of ultra-dense networks and multiple input multiple output technologies. This will make the current centralised solutions impractical due to increased complexity. Moreover, the amount of coordination information that needs to be transported over the backhaul links will be increased. Distributed or decentralised solutions are promising to provide better alternatives. This thesis proposes new distributed algorithms for wireless networks which aim to reduce the amount of system overheads in the backhaul links and the system complexity. The analysis of conflicts amongst transmitters, and resource allocation are conducted via the use of game theory, convex optimisation, and auction theory. Firstly, game-theoretic model is used to analyse a mixed quality of service (QoS) strategic non-cooperative game (SNG), for a two-user multiple-input single-output (MISO) interference channel. The players are considered to have different objectives. Following this, the mixed QoS SNG is extended to a multicell multiuser network in terms of signal-to-interference-and-noise ratio (SINR) requirement. In the multicell multiuser setting, each transmitter is assumed to be serving real time users (RTUs) and non-real time users (NRTUs), simultaneously. A novel mixed QoS SNG algorithm is proposed, with its operating point identified as the Nash equilibrium-mixed QoS (NE-mixed QoS). Nash, Kalai-Smorodinsky, and Egalitarian bargain solutions are then proposed to improve the performance of the NE-mixed QoS. The performance of the bargain solutions are observed to be comparable to the centralised solutions. Secondly, user offloading and user association problems are addressed for small cells using auction theory. The main base station wishes to offload some of its users to privately owned small cell access points. A novel bid-wait-auction (BWA) algorithm, which allows single-item bidding at each auction round, is designed to decompose the combinatorial mathematical nature of the problem. An analysis on the existence and uniqueness of the dominant strategy equilibrium is conducted. The BWA is then used to form the forward BWA (FBWA) and the backward BWA (BBWA). It is observed that the BBWA allows more users to be admitted as compared to the FBWA. Finally, simultaneous multiple-round ascending auction (SMRA), altered SMRA (ASMRA), sequential combinatorial auction with item bidding (SCAIB), and repetitive combinatorial auction with item bidding (RCAIB) algorithms are proposed to perform user offloading and user association for small cells. These algorithms are able to allow bundle bidding. It is then proven that, truthful bidding is individually rational and leads to Walrasian equilibrium. The performance of the proposed auction based algorithms is evaluated. It is observed that the proposed algorithms match the performance of the centralised solutions when the guest users have low target rates. The SCAIB algorithm is shown to be the most preferred as it provides high admission rate and competitive revenue to the bidders

Estimation efficace des paramètres de signaux d'usagers radio-mobile par traitement avec antenne-réseau

Cette thèse aborde le problème d’estimation des paramètres de signaux d’usagers radio-mobile par traitement avec antenne-réseau. On adopte une approche de traitement théorique rigoureuse au problème en tentant de pallier aux limitations et désavantages des méthodes d’estimation existantes en ce domaine. Les chapitres principaux ont été rédigés en couvrant uniquement les aspects théoriques en lien aux contributions principales, tout en présentant une revue de littérature adéquate sur les sujets concernés. La thèse présente essentiellement trois volets distincts en lien à chacune des contributions en question. Suite à une revue des notions de base, on montre d’abord comment une méthode d’estimation exploitant des statistiques d’ordre supérieur a pu être développée à partir de l’amélioration d’un algorithme existant en ce domaine. On présente ensuite le cheminement qui a conduit à l’élaboration d’une technique d’estimation non linéaire exploitant les propriétés statistiques spécifiques des enveloppes complexes reçues, et ne possédant pas les limitations des algorithmes du second et quatrième ordre. Finalement, on présente le développement relatif à un algorithme d’estimation exploitant le caractère cyclostationnaire intrinsèque des signaux de communication dans un environnement asynchrone naturel. On montre comment un tel algorithme parvient à estimer la matrice de canal des signaux incidents indépendamment du caractère de corrélation spatiotemporel du bruit, et permettant de ce fait même une pleine exploitation du degré de liberté du réseau. La procédure d’estimation consiste en la résolution d’un problème de diagonalisation conjointe impliquant des matrices cibles issues d’une opération différentielle entre des matrices d’autocorrélation obtenues uniquement à partir de statistiques d’ordre deux. Pour chacune des contributions, des résultats de simulations sont présentés afin de confirmer l’efficacité des méthodes proposées.This thesis addresses the problem of parameter estimation of radio signals from mobile users using an antenna array. A rigorous theoretical approach to the problem is adopted in an attempt to overcome the limitations and disadvantages of existing estimation methods in this field. The main chapters have been written covering only the theoretical aspects related to the main contributions of the thesis, while at the same time providing an appropriate literature review on the considered topics. The thesis is divided into three main parts related to the aforesaid contributions. Following a review of the basics concepts in antenna array processing techniques for signal parameter estimation, we first present an improved version of an existing estimation algorithm expoiting higher-order statistics of the received signals. Subsequently, we show how a nonlinear estimation technique exploiting the specific statistical distributions of the received complex envelopes at the array can be developed in order to overcome the limitations of second and fourth-order algorithms. Finally, we present the development of an estimation algorithm exploiting the cyclostationary nature of communication signals in a natural asynchronous environment. We show how such an algorithm is able to estimate the channel matrix of the received signals independently of the spatial or temporal correlation structure of the noise, thereby enabling a full exploitation of the array’s degree of freedom. The estimation process is carried out by solving a joint diagonalization problem involving target matrices computed by a differential operation between autocorrelation matrices obtained by the sole use of second-order statistics. Various simulation experiments are presented for each contribution as a means of supporting and evidencing the effectiveness of the proposed methods

Técnicas de pré-codificação para sistemas multicelulares coordenados

Doutoramento em TelecomunicaçõesCoordenação Multicélula é um tópico de investigação em rápido crescimento e uma solução promissora para controlar a interferência entre células em sistemas celulares, melhorando a equidade do sistema e aumentando a sua capacidade. Esta tecnologia já está em estudo no LTEAdvanced sob o conceito de coordenação multiponto (COMP). Existem várias abordagens sobre coordenação multicélula, dependendo da quantidade e do tipo de informação partilhada pelas estações base, através da rede de suporte (backhaul network), e do local onde essa informação é processada, i.e., numa unidade de processamento central ou de uma forma distribuída em cada estação base. Nesta tese, são propostas técnicas de pré-codificação e alocação de potência considerando várias estratégias: centralizada, todo o processamento é feito na unidade de processamento central; semidistribuída, neste caso apenas parte do processamento é executado na unidade de processamento central, nomeadamente a potência alocada a cada utilizador servido por cada estação base; e distribuída em que o processamento é feito localmente em cada estação base. Os esquemas propostos são projectados em duas fases: primeiro são propostas soluções de pré-codificação para mitigar ou eliminar a interferência entre células, de seguida o sistema é melhorado através do desenvolvimento de vários esquemas de alocação de potência. São propostas três esquemas de alocação de potência centralizada condicionada a cada estação base e com diferentes relações entre desempenho e complexidade. São também derivados esquemas de alocação distribuídos, assumindo que um sistema multicelular pode ser visto como a sobreposição de vários sistemas com uma única célula. Com base neste conceito foi definido uma taxa de erro média virtual para cada um desses sistemas de célula única que compõem o sistema multicelular, permitindo assim projectar esquemas de alocação de potência completamente distribuídos. Todos os esquemas propostos foram avaliados em cenários realistas, bastante próximos dos considerados no LTE. Os resultados mostram que os esquemas propostos são eficientes a remover a interferência entre células e que o desempenho das técnicas de alocação de potência propostas é claramente superior ao caso de não alocação de potência. O desempenho dos sistemas completamente distribuídos é inferior aos baseados num processamento centralizado, mas em contrapartida podem ser usados em sistemas em que a rede de suporte não permita a troca de grandes quantidades de informação.Multicell coordination is a promising solution for cellular wireless systems to mitigate inter-cell interference, improving system fairness and increasing capacity and thus is already under study in LTE-A under the coordinated multipoint (CoMP) concept. There are several coordinated transmission approaches depending on the amount of information shared by the transmitters through the backhaul network and where the processing takes place i.e. in a central processing unit or in a distributed way on each base station. In this thesis, we propose joint precoding and power allocation techniques considering different strategies: Full-centralized, where all the processing takes place at the central unit; Semi-distributed, in this case only some process related with power allocation is done at the central unit; and Fulldistributed, where all the processing is done locally at each base station. The methods are designed in two phases: first the inter-cell interference is removed by applying a set of centralized or distributed precoding vectors; then the system is further optimized by centralized or distributed power allocation schemes. Three centralized power allocation algorithms with per-BS power constraint and different complexity tradeoffs are proposed. Also distributed power allocation schemes are proposed by considering the multicell system as superposition of single cell systems, where we define the average virtual bit error rate (BER) of interference-free single cell system, allowing us to compute the power allocation coefficients in a distributed manner at each BS. All proposed schemes are evaluated in realistic scenarios considering LTE specifications. The numerical evaluations show that the proposed schemes are efficient in removing inter-cell interference and improve system performance comparing to equal power allocation. Furthermore, fulldistributed schemes can be used when the amounts of information to be exchanged over the backhaul is restricted, although system performance is slightly degraded from semi-distributed and full-centralized schemes, but the complexity is considerably lower. Besides that for high degrees of freedom distributed schemes show similar behaviour to centralized ones

Bearing estimation techniques for improved performance spread spectrum receivers

The main topic of this thesis is the use of bearing estimation techniques combined with multiple antenna elements for spread spectrum receivers. The motivation behind this work is twofold: firstly, this type of receiver structure may offer the ability to locate the position of a mobile radio in an urban environment. Secondly, these algorithms permit the application of space division multiple access (SDMA) to cellular mobile radio, which can offer large system capacity increases. The structure of these receivers may naturally be divided into two parts: signal detection and spatial filtering blocks. The signal detection problem involves locating the bearings of the multipath components which arise from the transmission of the desired user’s signal. There are a number of approaches to this problem, but here the MUSIC algorithm will be adopted. This algorithm requires an initial estimate of the number of signals impinging on the receiver, a task which can be performed by model order determination techniques. A major deficiency of MUSIC is its inability to resolve the highly–correlated and coherent multipath signals which frequently occur in a spread spectrum system. One of the simplest ways to overcome this problem is to employ spatial smoothing techniques, which trade the size of the antenna array for the ability to resolve coherent signals. The minimum description length (MDL) is one method for determining the signal model order and it can easily be extended to calculating the required degree of spatial smoothing. In this thesis, an approach to analysing the probability of correct model order determination for the MDL with spatial smoothing is presented. The performance of MUSIC, combined with spatial smoothing, is also of great significance. Two smoothing algorithms, spatial smoothing and forward–backward spatial smoothing, are analysed to compare their performance. If SDMA techniques are to be deployed in cellular systems, it is important to first estimate the performance improvements available from applying antenna array spatial filters. Initially, an additive white Gaussian noise channel is used for estimating the capacity of a perfect power–controlled code division multiple access system with SDMA techniques. Results suggest that the mean interference levels are almost halved as the antenna array size doubles, permitting large capacity increases. More realistic multipath models for urban cellular radio channels are also considered. If the transmitter gives rise to a number of point source multipath components, the bearing estimation receiver is able to capture the signal energy of each multipath. However, when a multipath component has significant angular spread, bearing estimation receivers need to combine separate directional components, at an increased cost in complexity, to obtain similar results to a matched filter. Finally, a source location algorithm for urban environments is presented, based on bearing estimation of multipath components. This algorithm requires accurate knowledge of the positions of the major multipath reflectors present in the environment. With this knowledge it is possible to determine the position of a transmitting mobile unit. Simulation results suggest that the algorithm is very sensitive to angular separation of the multipath components used for the source location technique