Resource management in QoS-aware wireless cellular networks

2011 Summer.Includes bibliographical references.Emerging broadband wireless networks that support high speed packet data with heterogeneous quality of service (QoS) requirements demand more flexible and efficient use of the scarce spectral resource. Opportunistic scheduling exploits the time-varying, location-dependent channel conditions to achieve multiuser diversity. In this work, we study two types of resource allocation problems in QoS-aware wireless cellular networks. First, we develop a rigorous framework to study opportunistic scheduling in multiuser OFDM systems. We derive optimal opportunistic scheduling policies under three common QoS/fairness constraints for multiuser OFDM systems--temporal fairness, utilitarian fairness, and minimum-performance guarantees. To implement these optimal policies efficiently, we provide a modified Hungarian algorithm and a simple suboptimal algorithm. We then propose a generalized opportunistic scheduling framework that incorporates multiple mixed QoS/fairness constraints, including providing both lower and upper bound constraints. Next, taking input queues and channel memory into consideration, we reformulate the transmission scheduling problem as a new class of Markov decision processes (MDPs) with fairness constraints. We investigate the throughput maximization and the delay minimization problems in this context. We study two categories of fairness constraints, namely temporal fairness and utilitarian fairness. We consider two criteria: infinite horizon expected total discounted reward and expected average reward. We derive and prove explicit dynamic programming equations for the above constrained MDPs, and characterize optimal scheduling policies based on those equations. An attractive feature of our proposed schemes is that they can easily be extended to fit different objective functions and other fairness measures. Although we only focus on uplink scheduling, the scheme is equally applicable to the downlink case. Furthermore, we develop an efficient approximation method--temporal fair rollout--to reduce the computational cost

Linear Transmit-Receive Strategies for Multi-user MIMO Wireless Communications

Die Notwendigkeit zur Unterdrueckung von Interferenzen auf der einen Seite und zur Ausnutzung der durch Mehrfachzugriffsverfahren erzielbaren Gewinne auf der anderen Seite rueckte die raeumlichen Mehrfachzugriffsverfahren (Space Division Multiple Access, SDMA) in den Fokus der Forschung. Ein Vertreter der raeumlichen Mehrfachzugriffsverfahren, die lineare Vorkodierung, fand aufgrund steigender Anzahl an Nutzern und Antennen in heutigen und zukuenftigen Mobilkommunikationssystemen besondere Beachtung, da diese Verfahren das Design von Algorithmen zur Vorcodierung vereinfachen. Aus diesem Grund leistet diese Dissertation einen Beitrag zur Entwicklung linearer Sende- und Empfangstechniken fuer MIMO-Technologie mit mehreren Nutzern. Zunaechst stellen wir ein Framework zur Approximation des Datendurchsatzes in Broadcast-MIMO-Kanaelen mit mehreren Nutzern vor. In diesem Framework nehmen wir das lineare Vorkodierverfahren regularisierte Blockdiagonalisierung (RBD) an. Durch den Vergleich von Dirty Paper Coding (DPC) und linearen Vorkodieralgorithmen (z.B. Zero Forcing (ZF) und Blockdiagonalisierung (BD)) ist es uns moeglich, untere und obere Schranken fuer den Unterschied bezueglich Datenraten und bezueglich Leistung zwischen beiden anzugeben. Im Weiteren entwickeln wir einen Algorithmus fuer koordiniertes Beamforming (Coordinated Beamforming, CBF), dessen Loesung sich in geschlossener Form angeben laesst. Dieser CBF-Algorithmus basiert auf der SeDJoCo-Transformation und loest bisher vorhandene Probleme im Bereich CBF. Im Anschluss schlagen wir einen iterativen CBF-Algorithmus namens FlexCoBF (flexible coordinated beamforming) fuer MIMO-Broadcast-Kanaele mit mehreren Nutzern vor. Im Vergleich mit bis dato existierenden iterativen CBF-Algorithmen kann als vielversprechendster Vorteil die freie Wahl der linearen Sende- und Empfangsstrategie herausgestellt werden. Das heisst, jede existierende Methode der linearen Vorkodierung kann als Sendestrategie genutzt werden, waehrend die Strategie zum Empfangsbeamforming frei aus MRC oder MMSE gewaehlt werden darf. Im Hinblick auf Szenarien, in denen Mobilfunkzellen in Clustern zusammengefasst sind, erweitern wir FlexCoBF noch weiter. Hier wurde das Konzept der koordinierten Mehrpunktverbindung (Coordinated Multipoint (CoMP) transmission) integriert. Zuletzt stellen wir drei Moeglichkeiten vor, Kanalzustandsinformationen (Channel State Information, CSI) unter verschiedenen Kanalumstaenden zu erlangen. Die Qualitaet der Kanalzustandsinformationen hat einen starken Einfluss auf die Guete des Uebertragungssystems. Die durch unsere neuen Algorithmen erzielten Verbesserungen haben wir mittels numerischer Simulationen von Summenraten und Bitfehlerraten belegt.In order to combat interference and exploit large multiplexing gains of the multi-antenna systems, a particular interest in spatial division multiple access (SDMA) techniques has emerged. Linear precoding techniques, as one of the SDMA strategies, have obtained more attention due to the fact that an increasing number of users and antennas involved into the existing and future mobile communication systems requires a simplification of the precoding design. Therefore, this thesis contributes to the design of linear transmit and receive strategies for multi-user MIMO broadcast channels in a single cell and clustered multiple cells. First, we present a throughput approximation framework for multi-user MIMO broadcast channels employing regularized block diagonalization (RBD) linear precoding. Comparing dirty paper coding (DPC) and linear precoding algorithms (e.g., zero forcing (ZF) and block diagonalization (BD)), we further quantify lower and upper bounds of the rate and power offset between them as a function of the system parameters such as the number of users and antennas. Next, we develop a novel closed-form coordinated beamforming (CBF) algorithm (i.e., SeDJoCo based closed-form CBF) to solve the existing open problem of CBF. Our new algorithm can support a MIMO system with an arbitrary number of users and transmit antennas. Moreover, the application of our new algorithm is not only for CBF, but also for blind source separation (BSS), since the same mathematical model has been used in BSS application.Then, we further propose a new iterative CBF algorithm (i.e., flexible coordinated beamforming (FlexCoBF)) for multi-user MIMO broadcast channels. Compared to the existing iterative CBF algorithms, the most promising advantage of our new algorithm is that it provides freedom in the choice of the linear transmit and receive beamforming strategies, i.e., any existing linear precoding method can be chosen as the transmit strategy and the receive beamforming strategy can be flexibly chosen from MRC or MMSE receivers. Considering clustered multiple cell scenarios, we extend the FlexCoBF algorithm further and introduce the concept of the coordinated multipoint (CoMP) transmission. Finally, we present three strategies for channel state information (CSI) acquisition regarding various channel conditions and channel estimation strategies. The CSI knowledge is required at the base station in order to implement SDMA techniques. The quality of the obtained CSI heavily affects the system performance. The performance enhancement achieved by our new strategies has been demonstrated by numerical simulation results in terms of the system sum rate and the bit error rate

Bringing Mobile Relays for Wireless Access Networks into Practice - Learning When to Relay

Adding fixed relay nodes (RNs) to wireless access networks requires additional costly infrastructure. Utilising mobile RNs, that is, user terminals that relay signals intended for other users being the destination nodes (DNs), is an appealing cost-effective solution. However, the changing node topology increases the required signalling for relay selection (RS). The signalling overhead consists of control signals that need to be exchanged between the RNs, the source node (SN) and the DN, to achieve the objectives of cooperation. To reduce signalling without penalising performance, the authors propose a three-step approach exploiting statistical knowledge on the likelihood of attaining performance gains by using RNs as a function of the node position (position of DNs and RNs). In the first step only the cell DNs that are likely to gain from relaying request the assistance of RNs. In the second step, for each DN that requests relaying, a limited set of RN candidates is formed. These decisions are made with the aid of thresholds applied to inter-node distances whose values are based on the acquired statistical knowledge. In the final step, RN candidates feed back the relevant channel state information to the SN that performs RS. Furthermore, the authors investigate the attained gains from mobile RNs as a function of the fading environment and they show that mobile RNs can help overcome the effects of severe fading

Performance analysis of multi-antenna and multi-user methods for 3G and beyond

Performance of cellular networks has become an issue with forecasted growing public demand for medium and high data rate services. Motivated by these expectations multi-antenna techniques such as transmit diversity (TD), channel-aware scheduling and multiple-input multiple-output (MIMO) transceivers have received a lot of enthusiasm within wireless communications community. We first focus on closed-loop (CL) TD and introduce extended mode 1 and 2 (e-mode 1 and 2) algorithms that are designed based on universal terrestrial radio access (UTRA) frequency division duplex (FDD) CL mode 1 and 2. We derive analytical performance results for e-mode 1 and 2 in terms of signal to noise ratio (SNR) gain, link capacity and bit error probability (BEP). We also consider the effect of feedback errors to the performance of closed-loop system. In the analysis of channel-aware scheduling we focus on on-off scheduling (OOS) where user's feedback consists of only a single bit. Performance results in both downlink and uplink clearly indicate that most of the achievable gain from channel-aware scheduling can be obtained with very scarce channel state information (CSI). Results also show that the design of feedback channel is of great importance because feedback errors may seriously degrade the system performance. The third topic of the thesis concentrates on MIMO techniques that can be implemented in UTRA FDD uplink without major revisions to the current air interface. We show that the UTRA FDD uplink coverage and capacity performance can be boosted by single-input multiple-output (SIMO) and MIMO transceivers. The information MIMO employing parallel multiplexing instead of transmit diversity shows its potential when extremely high user data rates are needed.Solukkoverkkojen suorituskyky on noussut tärkeään rooliin nopeiden datapalveluiden kasvuennusteiden myötä. Näiden kasvuodotusten perusteella moniantennitekniikat kuten lähetysdiversiteetti, kanavan huomioon ottava lähetyksen aikataulutus sekä useaa samanaikaista datavirtaa tukevat lähetinvastaanotinmenetelmät ovat saaneet osakseen paljon kiinnostusta langattoman tietoliikenteen tutkijayhteisössä. Tutkimuksessa keskitytään aluksi suljettua säätöä käyttäviin lähetysdiversiteettimenetelmiin, missä yhteydessä esitellään laajennetut moodien 1 ja 2 algoritmit, jotka on aiemmin kehitetty kolmannen sukupolven WCDMA järjestelmän suljetun säädön moodien 1 ja 2 pohjalta. Laajennetuille moodien 1 ja 2 algoritmeille johdetaan analyyttisiä suorituskykytuloksia käyttäen mittarina signaali-kohinasuhteen parannusta, linkin kapasiteettia sekä bittivirheiden todennäköisyyttä. Myös säätövirheiden vaikutusta järjestelmän suorituskykyyn tarkastellaan. Lähetyksen aikataulutuksen analyysi painottuu kytkettyyn aikataulutukseen, missä käyttäjän säätöinformaatio sisältyy yhteen bittiin. Sekä ylä- että alalinkin suorituskykytulokset osoittavat selvästi, että suurin osa mahdollisesta parannuksesta voidaan saavuttaa hyvin karkeaan kanavatilan informaatioon perustuen. Tulokset osoittavat myös, että säätökanavan suunnittelu on tärkeää, koska säätövirheet voivat vakavasti heikentää järjestelmän suorituskykyä. Kolmannessa aihealueessa keskitytään moniantennitekniikoihin, jotka voidaan toteuttaa WCDMA järjestelmän ylälinkissä ilman perustavanlaatuisia muutoksia nykyiseen ilmarajapintaan. Tutkimuksessa osoitetaan, että ylälinkin peittoa ja kapasiteettia voidaan parantaa tutkituilla moniantennitekniikoilla olipa lähettimessä yksi tai useampia antenneja. Menetelmä, jossa informaatio jaetaan useisiin rinnakkaisiin datavirtoihin sen sijaan että käytettäisiin vain yhtä datavirtaa, osoittautuu erityisen lupaavaksi kun tarvitaan hyvin nopeita tiedonsiirtoyhteyksiä.reviewe

Wireless secrecy under multivariate correlated Nakagami-m fading

Current wireless secrecy research in the literature has mainly been performed for one wiretapper under correlated fading. In this paper, a new wireless secrecy framework for multiple wiretappers under multivariate exponentially-correlated (exp.c.) Nakagami-m fading is proposed. Using the distribution of multivariate exp.c. Nakagami-m fading, new, exact, and compact expressions for the ergodic secrecy capacity, and secrecy outage probability (SOP) under multiple wiretappers are obtained for an integer fading parameter m. A secrecy analysis is also performed for the first time in this paper using an adaptive on/off transmission encoder under multivariate exp.c. Nakagami-m fading. A secrecy analysis with three wiretappers under quadrivariate exp.c. Nakagami-m fading is also given, which shows the effectiveness of the new framework. Simulation results are shown to exactly match theoretical predictions