Esquemas de cooperação entre estações base para o LTE no sentido descendente

The explosive growth in wireless traffic and in the number of connected devices as smart phones or computers, are causing a dramatic increase in the levels of interference, which significantly degrades the capacity gains promised by the point-to-point multi input, multi output (MIMO) based techniques. Therefore, it is becoming increasingly clear that major new improvements in spectral efficiency of wireless networks will have to entail addressing intercell interference. So, there is a need for a new cellular architecture that can take these factors under consideration. It is in this context that LTE-Advanced arises. One of the most promising LTE-Advanced technology is Coordinated Multipoint (CoMP), which allows base stations to cooperate among them, in order to mitigate or eliminate the intercell interference and, by doing so, increase the system’s capacity. This thesis intends to study this concept, implementing some schemes that fall under the CoMP concept. In this thesis we consider a distributed precoded multicell approach, where the precoders are computed locally at each BS to mitigate the intercell interference. Two precoder are considered: distributed zero forcing (DZF) and distributed virtual signal-to-interference noise ratio (DVSINR) recently proposed. Then the system is further optimized by computing a power allocation algorithm over the subcarriers that minimizes the average bit error rate (BER). The considered algorithms are also evaluated under imperfect channel state information. A quantized version of the CSI associated to the different links between the BS and the UT is feedback from the UT to the BS. This information is then employed by the different BSs to perform the precoding design. A new DVSINR precoder explicitly designed under imperfect CSI is proposed. The proposed schemes were implemented considering the LTE specifications, and the results show that the considered precoders are efficiently to remove the interference even under imperfect CSI.O crescimento exponencial no tráfego de comunicações sem-fios e no número de dispositivos utilizados (smart phones, computadores portáteis, etc.) está a causar um aumento significativo nos níveis de interferência, que prejudicam significativamente os ganhos de capacidade assegurados pelas tecnologias baseadas em ligações ponto-a-ponto MIMO. Deste modo, torna-se cada vez mais necessário que os grandes aperfeiçoamentos na eficiência espectral de sistemas de comunicações sem-fios tenham em consideração a interferência entre células. De forma a tomar em consideração estes aspectos, uma nova arquitectura celular terá de ser desenvolvida. É assim, neste contexto, que surge o LTE-Advanced. Uma das tecnologias mais promissoras do LTE-Advanced é a Coordenação Multi-Ponto (CoMP), que permite que as estações base cooperem de modo a mitigar a interferência entre células e, deste modo, aumentar a capacidade do sistema. Esta dissertação pretende estudar este conceito, implementando para isso algumas técnicas que se enquadram no conceito do CoMP. Nesta dissertação iremos considerar a implementação de um sistema de pré-codificação em múltiplas células, em que os pré-codificadores são calculados em cada BS, de modo a mitigar a interferência entre células. São considerados dois pré-codificadores: Distributed Zero Forcing (DZF) e Distributed Virtual Signal-to-Interferance Noise Ratio (DVSINR), recentemente proposto. De seguida o sistema é optimizado com a introdução de algoritmos de alocação de potência entre as sub-portadoras com o objectivo de minimizar a taxa média de erros (BER). Os algoritmos considerados são também avaliados em situações em que a informação do estado do canal é imperfeita. Uma versão quantizada da CSI associada a cada uma das diferentes ligações entre as BS e os UT é assim enviada do UT para a BS. Esta informação é então utilizada para calcular os diferentes pré-codificadores em cada BS. Uma nova versão do pré-codificador DVSINR é proposta de modo a lidar com CSI imperfeito. Os esquemas propostos foram implementados considerandos especificações do LTE, e os resultados obtidos demonstram que os pré-codificadores removem de uma forma eficiente a interferência, mesmo em situações em que a CSI é imperfeita

Review on Radio Resource Allocation Optimization in LTE/LTE-Advanced using Game Theory

Recently, there has been a growing trend toward ap-plying game theory (GT) to various engineering fields in order to solve optimization problems with different competing entities/con-tributors/players. Researches in the fourth generation (4G) wireless network field also exploited this advanced theory to overcome long term evolution (LTE) challenges such as resource allocation, which is one of the most important research topics. In fact, an efficient de-sign of resource allocation schemes is the key to higher performance. However, the standard does not specify the optimization approach to execute the radio resource management and therefore it was left open for studies. This paper presents a survey of the existing game theory based solution for 4G-LTE radio resource allocation problem and its optimization

Dynamic User Grouping and Joint Resource Allocation with Multi-Cell Cooperation for Uplink Virtual MIMO Systems

This paper proposes a novel joint resource allocation algorithm combining dynamic user grouping, multi-cell cooperation and resource block (RB) allocation for single carrier-frequency division multiple access (SC-FDMA) uplink in multicell virtual MIMO systems. We first develop the dynamic multicell user grouping criteria using minimum mean square error (MMSE) equalization and adaptive modulation (AM) with bit error rate (BER) constraint. Then, we formulate and solve a new throughput maximization problem whose resource allocation includes cell selection, dynamic user grouping and RB pattern assignment. Furthermore, to reduce the computational complexity significantly, especially in the case of large numbers of users and RBs, we present an efficient iterative Hungarian algorithm based on user and resource partitions (IHA_URP) to solve the problem by decomposing the large scale problem into a series of small scale sub-problems, which can obtain close-to-optimal solution with much lower complexity. The simulation results show that our proposed joint resource allocation algorithm with dynamic multicell user grouping scheme achieves better system throughput with BER guarantee than fixed user grouping algorithm and other proposed schemes in the literature

Timing and Carrier Synchronization in Wireless Communication Systems: A Survey and Classification of Research in the Last 5 Years

Timing and carrier synchronization is a fundamental requirement for any wireless communication system to work properly. Timing synchronization is the process by which a receiver node determines the correct instants of time at which to sample the incoming signal. Carrier synchronization is the process by which a receiver adapts the frequency and phase of its local carrier oscillator with those of the received signal. In this paper, we survey the literature over the last 5 years (2010–2014) and present a comprehensive literature review and classification of the recent research progress in achieving timing and carrier synchronization in single-input single-output (SISO), multiple-input multiple-output (MIMO), cooperative relaying, and multiuser/multicell interference networks. Considering both single-carrier and multi-carrier communication systems, we survey and categorize the timing and carrier synchronization techniques proposed for the different communication systems focusing on the system model assumptions for synchronization, the synchronization challenges, and the state-of-the-art synchronization solutions and their limitations. Finally, we envision some future research directions

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

Ultra-Dense Networks in 5G and Beyond: Challenges and Promising Solutions

Ultra-Dense Network (UDN) is one of the promising and leading directions in Fifth Generation and beyond (5GB) networks. In UDNs, Small Cells (SCs) or Small Base Stations (SBSs) such as microcells, picocells, or femtocells are deployed in high densities where inter-site distances are within the range of few or tens of meters. UDNs also require that SCs are typically deployed in relatively large densities compared to the Human-Type Communication Users (HTCUs) such as smartphones, tablets, and/or laptops. Such SCs are characterized by their low transmission powers, small coverage areas, and low cost. Hence, the deployment of the SCs can be done either by the cellular network operators or by the customers themselves within their premises to maintain certain levels of Quality of Service (QoS). However, the randomness of the deployment of the SCs along with the small inter-site distances may degrade the achievable performance due to the uncontrolled Inter-Cell Interference (ICI). Therefore, idle mode capability is an inevitable feature in the high-density regime of SCs. In idle mode, a SC is switched off to prevent ICI when no user is associated to it. In doing so, we can imagine the UDN as a mobile network that keeps following the users to remain as close as possible to them. In 5G, different use cases are required to be supported such as enhanced Mobile Broad-Band (eMBB), Ultra-Reliable and Low-Latency Communication (URLLC), and massive Machine-Type Communication (mMTC). On one hand, the inevitable upcoming era of smart living requires unprecedented advances in enabling technologies to support the main building blocks of this era which are Internet of Things (IoT) devices. Machine-Type Communication (MTC), the cellular version of Machine-to-Machine (M2M) communication, constitutes the main enabling technology to support communications among such devices with minimal or even without human intervention. The massive number of these devices, Machine-Type Communication Devices (MTCDs), and the immense amount of traffic generated by them require a paramount shift in cellular and non-cellular wireless technologies to achieve the required connectivity. On the other hand, the sky-rocketing number of data hungry applications installed on human-held devices, or HTCUs, such as video conferencing and virtual reality applications require their own advances in the wireless infrastructure in terms of high capacity, enhanced reliability, and reduced latency. Throughout this thesis, we exploit the UDN infrastructure integrated with other 5G resources and enabling technologies to explore the possible opportunities in supporting both HTC and MTC, either solely or simultaneously. Given the shorter distances between transmitters and receivers encountered in UDNs, more realistic models of the path loss must be adopted such as the Stretched Exponential Path Loss (SEPL) model. We use tools from stochastic geometry to formulate novel mathematical frameworks that can be used to investigate the achievable performance without having to rely on extensive time-consuming Monte-Carlo simulations. Besides, the derived analytical expressions can be used to tune some system parameters or to propose some approaches/techniques that can be followed to optimize the performance of the system under certain circumstances. Tackling practical scenarios, the complexity, or sometimes in-feasibility, of providing unlimited backhaul capacity for the massive number of SCs must be considered. In this regard, we adopt multiple-association where each HTCU is allowed to associate with multiple SCs. By doing so, we carefully split the targeted traffic among several backhaul links to mitigate the bottleneck forced by limited backhaul capacities. It is noteworthy that for coexisting MTCDs with the HTCUs, activating more SCs would allow more MTCDs to be supported without introducing additional ICI towards the HTCUs. Targeting different application, multiple-association can be also adopted to tackle computation-intensive applications of HTCUs. In particular, for applications such as augmented reality and environment recognition that require heavy computations, a task is split and partially offloaded to multiple SCs with integrated Edge Computing Servers (ECSs). Then, the task partitions are processed in parallel to reduce the end-to-end processing delay. Based on relative densities between HTCUs and SCs, we use tools from stochastic geometry to develop an offline adaptive task division technique that further reduces the average end-to-end processing delay per user. With the frequent serious data breaches experienced in recent years, securing data has become more of a business risk rather than an information technology (IT) issue. Hence, we exploit the dense number of SCs found in UDN along with Physical Layer Security (PLS) protocols to secure data transfer. In particular, we again adopt multiple-association and split the data of HTCUs into multiple streams originating from different SCs to prevent illegitimate receivers from eavesdropping. To support massive number of MTCDs, we deploy the Non-Orthogonal Multiple-Access (NOMA) technique. Using power NOMA, more than one device can be supported over the same frequency/time resource and their signals are distinguished at the receiver using Successive Interference Cancellation (SIC). In the same scope, exploiting the available resources in 5G and beyond networks, we investigate a mMTC scenario in an UDN operating in the Millimeter Wave (mmWave) band and supported by wireless backhauling. In doing so, we shed lights on the possible gains of utilizing the mmWave band where the severe penetration losses of mmWave can be exploited to mitigate the significant ICI in UDNs. Also, the vast bandwidth available in the mmWave band helps to allocate more Resource Blocks (RBs) per SCs which corresponds to supporting more MTCDs