We consider optimal power allocation policies for a single server, multiuser wireless communication system. The transmission channel may experience multipath fading. We obtain very efficient, low computational complexity algorithms which minimize power and ensure stability of the data queues. We also obtain policies when the users may have mean delay constraints. If the power required is a linear function of rate then we exploit linearity and obtain linear programs with low complexity. We also provide closed-form optimal power policies when there is a hard deadline delay constraint. Later on, we also extend single hop results to multihop networks. First we consider the case, when the transmission rate is a linear function of power. We provide low complexity algorithms for joint routing, scheduling and power control which ensure stability of the queues, certain minimum rates, end-to-end hard deadlines, and/or upper bounds on the end-to-end mean delays. Further we extend these results to the multihop networks where the power is a general monotonically increasing function of rate. For our algorithms, we also provide rates of convergence to the stationary distributions for the queue length process and also approximate end-to-end mean delays. Finally, we provide computationally efficient algorithms that minimize the total power when there is a end-to-end hard deadline delay constraint.

Grâce aux avancées technologiques dans le domaine des réseaux cellulaires et des équipements mobiles, le nombre d'applications multimédia à haut débit dans les réseaux mobiles ne cesse d'augmenter. On prévoit que le trafic de données dans les réseaux mobiles en 2017 sera 13 fois plus important que celui en 2012. Pour satisfaire aux besoins des équipements mobiles, de nouvelles approches pour la gestion des ressources radio et des puissances de transmission sont requises.Dans le cadre de cette thèse, on s'intéresse à proposer des solutions pour remédier aux problèmes des interférences intercellulaires dans les réseaux mobiles de dernière génération. Nous enquêtons d'une manière exhaustive les différentes techniques de coordination des interférences intercellulaires existantes. Ces techniques sont qualitativement comparées, puis classées selon le taux de coopération requis entre les différentes stations de base, mais aussi selon leurs principes de fonctionnement. Nous abordons également le problème multicellulaire d'allocation des ressources et des puissances de transmission d'une manière centralisée. Nous formulons ce problème d'optimisation centralisé, puis nous le décomposons en deux sous-problèmes indépendants : l'allocation de ressources et l'allocation des puissances de transmission. De plus, une approche distribuée basée sur la théorie des jeux est proposée pour l'allocation des puissances de transmission. Les techniques centralisées de minimisation des interférences intercellulaires offrent la solution optimale au prix d'une grande charge de signalisation. Par contre, les solutions décentralisées réduisent le trafic de signalisation sans garantir l'optimalité de la solution obtenue. Nous proposons ensuite une heuristique de contrôle de puissance qui modifie localement l'allocation des puissances de transmission de manière à éviter le gaspillage d'énergie et pour réduire les interférences ressenties par les utilisateurs des stations de base voisines. Nous proposons également une technique autonome qui gère la distribution des ressources radio entre les différentes zones de chaque cellule. Cette technique répond aux besoins des utilisateurs dans chaque zone en adaptant la distribution des ressources d'une manière dynamique. Nous abordons aussi le compromis entre les techniques de gestion d'interférences intercellulaires centralisées et décentralisées. Nous proposons une approche hybride où l'allocation des ressources radio et des puissances de transmission est faite d'une manière coopérative entre les différentes cellules. Dans un premier lieu, les cellules voisines collaborent afin d'ajuster les puissances de transmission allouées aux ressources radio. Ensuite, la distribution des ressources entre les différentes zones de chaque cellule est modifiée localement, selon les besoins des utilisateurs dans chaque zone. / The exponentially increasing demand for mobile broadband communications have led to the dense deployment of cellular networks with aggressive frequency reuse patterns. The future Fifth Generation (5G) networks are expected to overcome capacity and throughput challenges by adopting a multi-tier architecture where several low-power Base Stations (BSs) are deployed within the coverage area of the macro cell. However, Inter-Cell Interference (ICI) caused by the simultaneous usage of the same spectrum in different cells, creates severe problems. ICI reduces system throughput and network capacity, and has a negative impact on cell-edge User Equipment (UE) performance. Therefore, Inter-Cell Interference Coordination (ICIC) techniques are required to mitigate the impact of ICI on system performance. In this thesis, we address the resource and power allocation problem in multiuser Orthogonal Frequency Division Multiple Access (OFDMA) networks such as LTE/LTE-A networks and dense small cell networks. We start by overviewing the state-of-the-art schemes, and provide an exhaustive classification of the existing ICIC approaches. This qualitative classification is followed by a quantitative investigation of several interference mitigation techniques. Then, we formulate a centralized multi-cell joint resource and power allocation problem, and prove that this problem is separable into two independent convex optimization problems. The objective function of the formulated problem consists in maximizing system throughput while guaranteeing throughput fairness between UEs. ICI is taken into account, and resource and power allocation is managed accordingly in a centralized manner. Furthermore, we introduce a decentralized game-theoretical method to solve the power allocation problem without the need to exchange signaling messages between the different cells. We also propose a decentralized heuristic power control algorithm based on the received Channel Quality Indication (CQI) feedbacks. The intuition behind this algorithm is to avoid power wastage for UEs that are close to the serving cell, and reducing ICI for UEs in the neighboring cells. An autonomous ICIC scheme that aims at satisfying throughput demands in each cell zone is also introduced. The obtained results show that this technique improves UE throughput fairness, and it reduces the percentage of unsatisfied UEs without generating additional signaling messages. Lastly, we provide a hybrid ICIC scheme as a compromise between the centralized and the decentralized approaches. For a cluster of adjacent cells, resource and power allocation decisions are made in a collaborative manner. First, the transmission power is adjusted after receiving the necessary information from the neighboring cells. Second, resource allocation between cell zones is locally modified, according to throughput demands in each zone.

Les schémas de Codage Vidéo Linéaire (CVL) inspirés de SoftCast ont émergé dans la dernière décennie comme une alternative aux schémas de codage vidéo classiques. Ces schémas de codage source-canal conjoint exploitent des résultats théoriques montrant qu’une transmission (quasi-)analogique est plus performante dans des situations de multicast que des schémas numériques lorsque les rapports signal-à-bruit des canaux (C-SNR) diffèrent d’un récepteur à l’autre. Dans ce contexte, les schémas de CVL permettent d’obtenir une qualité de vidéo décodée proportionnelle au C-SNR du récepteur.Une première contribution de cette thèse concerne l’optimisation de la matrice de précodage de canal pour une transmission de type OFDM de flux générés par un CVL lorsque les contraintes de puissance diffèrent d’un sous-canal à l’autre. Ce type de contrainte apparait en sur des canaux DSL, ou dans des dispositifs de transmission sur courant porteur en ligne (CPL). Cette thèse propose une solution optimale à ce problème de type multi-level water filling et nécessitant la solution d’un problème de type Structured Hermitian Inverse Eigenvalue. Trois algorithmes sous-optimaux de complexité réduite sont également proposés. Des nombreux résultats de simulation montrent que les algorithmes sous-optimaux ont des performances très proches de l’optimum et réduisent significativement le temps de codage. Le calcul de la matrice de précodage dans une situation de multicast est également abordé. Une seconde contribution principale consiste en la réduction de l’impact du bruit impulsif dans les CVL. Le problème de correction du bruit impulsif est formulé comme un problème d’estimation d’un vecteur creux. Un algorithme de type Fast Bayesian Matching Pursuit (FBMP) est adapté au contexte CVL. Cette approche nécessite de réserver des sous-canaux pour la correction du bruit impulsif, entrainant une diminution de la qualité vidéo en l'absence de bruit impulsif. Un modèle phénoménologique (MP) est proposé pour décrire l’erreur résiduelle après correction du bruit impulsif. Ce modèle permet de d’optimiser le nombre de sous-canaux à réserver en fonction des caractéristiques du bruit impulsif. Les résultats de simulation montrent que le schéma proposé améliore considérablement les performances lorsque le flux CVL est transmis sur un canal sujet à du bruit impulsif. / SoftCast based Linear Video Coding (LVC) schemes have been emerged in the last decade as a quasi analog joint-source-channel alternative to classical video coding schemes. Theoretical analyses have shown that analog coding is better than digital coding in a multicast scenario when the channel signal-to-noise ratios (C-SNR) differ among receivers. LVC schemes provide in such context a decoded video quality at different receivers proportional to their C-SNR.This thesis considers first the channel precoding and decoding matrix design problem for LVC schemes under a per-subchannel power constraint. Such constraint is found, e.g., on Power Line Telecommunication (PLT) channels and is similar to per-antenna power constraints in multi-antenna transmission system. An optimal design approach is proposed, involving a multi-level water filling algorithm and the solution of a structured Hermitian Inverse Eigenvalue problem. Three lower-complexity alternative suboptimal algorithms are also proposed. Extensive experiments show that the suboptimal algorithms perform closely to the optimal one and can reduce significantly the complexity. The precoding matrix design in multicast situations also has been considered.A second main contribution consists in an impulse noise mitigation approach for LVC schemes. Impulse noise identification and correction can be formulated as a sparse vector recovery problem. A Fast Bayesian Matching Pursuit (FBMP) algorithm is adapted to LVC schemes. Subchannels provisioning for impulse noise mitigation is necessary, leading to a nominal video quality decrease in absence of impulse noise. A phenomenological model (PM) is proposed to describe the impulse noise correction residual. Using the PM model, an algorithm to evaluate the optimal number of subchannels to provision is proposed. Simulation results show that the proposed algorithms significantly improve the video quality when transmitted over channels prone to impulse noise.

[pt] Sistemas de múltiplas antenas livres de células surgiram recentemente como uma combinação de MIMO massivo, sistemas de antenas distribuídas (DAS) e network MIMO. Esta dissertação explora o downlink deste cenário com pontos de acesso (PAs) de uma ou múltiplas antenas e considerando conhecimento perfeito e imperfeito do canal. São desenvolvidos esquemas que combinam pré-codificação, alocação de potência e seleção de PAs (SPA). Para começar, duas estratégias de SPA foram investigadas, uma baseada em busca exaustiva (BE-SPA) e a outra em coeficientes de desvanecimento de larga escala (LE-SPA), com o intuito de reduzir a complexidade das redes livres de células. Subsequentemente, apresentamos duas técnicas iterativas de pré-codificação, todas seguindo o critério Minimum Mean-Square Error (MMSE), combinadas à restrição de potência total. A primeira nós chamamos de MMSE, com restrição de potência total. Nós também incorporamos robustez ao método desenvolvido chamado RMMSE, um pré-codificador robusto com restrição de potência total. Como terceiro elemento da configuração proposta, esquemas de alocação de potência foram desenvolvidos, com abordagens ótimas, adaptativas e uniformes. Um algoritmo de alocação de potência ótima (APO) é apresentado, baseado na maximização da mínima Signal-to-Interference-plus-Noise Ratio (SINR). A solução adaptativa (APA) é caracterizada pelo gradiente estocástico (GE) do mean-square error (MSE) e a alternativa uniforme (UPA) propõe a equalização de todos os coeficientes de potência. Todas as configurações devem respeitar a restrição de potência por antena, imposta pelo sistema. Uma análise de soma das taxas é feita, para todas as técnicas estudadas e o custo computacional de cada uma delas é calculado. Resultados numéricos provam que as técnicas propostas têm performance superior à pré-codificadores Conjugate Beamforming (CB) e Zero-Forcing (ZF), ambos com alocação de potência uniforme e ótima, na forma de taxa de erro de bit (BER), soma das taxas e mínima SINR. Além disso, os resultados atestam que o desempenho pode ser mantido e até melhorado com a aplicação de SPA. / [en] Cell-Free Massive multiple-input multiple-output (MIMO) systems have emerged in recent years as a combination of massive MIMO, distributed antenna systems (DAS) and network MIMO. This thesis explores the downlink channel of such scenario with single and multiple-antenna access points (APs) and takes into account both perfect and imperfect channel state information (CSI). We propose transmit processing schemes that combine precoding, power allocation and AP selection (APS). To begin with, two APS strategies have been investigated, one based on exhaustive search (ES-APS) and the other on the large-scale fading coefficients (LSAPS), in order to reduce the complexity of cell-free networks. Subsequently, we present two iterative precoding techniques following the minimum meansquare error (MMSE) criterion with total power constraint. The first we call MMSE, with total power constraint. We also incorporate robustness in the developed method, called RMMSE, a robust precoder with total power constraint. As the third element of the proposed schemes, power allocation techniques are developed, with optimal, adaptive and uniform approaches. An optimal power allocation (OPA) algorithm is presented based on the maximization of the minimum signal-to-interference-plus-noise ratio (SINR). The adaptive solution (APA) is characterized by the stochastic gradient of the mean-square error (MSE) and the uniform alternative (UPA) proposes to equalize all power coefficients. All configurations must fulfil an antenna power constraint, imposed by the system. A sum-rate analysis is carried out for all studied techniques and the computational cost of each one is calculated. Numerical results prove that the proposed techniques outperform existing conjugate beamforming (CB) and zero-forcing (ZF) precoders, both with uniform and optimal power allocation, in terms of bit error rate (BER), sum-rate and minimum SINR. Furthermore, we also attest that performance can be maintained or even improved in the presence of APS.

This thesis considers the uplink of cell-free single input multiple output systems, in which the access points employ matched-filter reception. In this setting, our objectiveis to develop a scalable uplink power control scheme that relies only on large-scale channel gain estimates and is robust to changes in the environment. Specifically, we formulate the problem as max-min and max-product signal-to-interference ratio optimization tasks, which can be solved by geometric programming. Next, we study the performance of supervised and unsupervised learning approaches employing a feed-forward neural network. We find that both approaches perform close to the optimum achieved by geometric programming, while the unsupervised scheme avoids the pre-computation of training data that supervised learning would necessitate for every system or environment modification. / Den här avhandlingen tar hänsyn till upplänken till cellfria multipla utgångssystem med en enda ingång, där åtkomstpunkterna använder matchad filtermottagning. I den här inställningen är vårt mål att utveckla ett skalbart styrsystem för upplänkskraft som endast förlitar sig på storskaliga uppskattningar av kanalökningar och är robusta för förändringar i miljön. Specifikt formulerar vi problemet som maxmin och max-produkt signal-till-störningsförhållande optimeringsuppgifter, som kan lösas genom geometrisk programmering. Därefter studerar vi resultatet av övervakade och okontrollerade inlärningsmetoder som använder ett framåtriktat neuralt nätverk. Vi finner att båda metoderna fungerar nära det optimala som uppnås genom geometrisk programmering, medan det övervakade schemat undviker förberäkningen av träningsdata som övervakat inlärning skulle kräva för varje system- eller miljöändring.

Future mobile networks are anticipated to not only enhance communication performance but also facilitate new sensing-based applications. This highlights the essential role of integrated sensing and communication (ISAC) in sixth-generation (6G) and beyond mobile networks. The seamless integration of sensing and communication poses challenges in deployment and resource allocation. Cell-free massive multiple-input multiple-output (MIMO) networks, characterized by multiple distributed access points, offer a promising infrastructure for ISAC implementation. However, the effective realization of ISAC necessitates joint design and resource allocation optimization. In this thesis, we study ISAC within cell-free massive MIMO systems, with a particular emphasis on developing power allocation algorithms under various scenarios. In this thesis, we explore two scenarios: utilizing existing communication signals and incorporating additional sensing signals. We propose power allocation algorithms aiming to maximize the sensing performance while meeting communication and power constraints. In addition, we develop two maximum a posteriori ratio test (MAPRT) target detectors under clutter-free and cluttered scenarios. Results indicate that employing additional sensing signals enhances sensing performance, particularly in scenarios where the target has low reflectivity. Moreover, although the clutter-aware detector requires more advanced processing, it leads to better sensing performance. Furthermore, we introduced sensing spectral efficiency (SE) to measure the effect of resource block utilization, highlighting the integration advantages of ISAC over orthogonal resource sharing approaches.  In the next part of the thesis, we study the energy efficiency aspects of ISAC in cell-free massive MIMO systems with ultra-reliable low-latency communications (URLLC) users. We propose a power allocation algorithm aiming to maximize energy efficiency of the system while meeting communication and sensing requirements. We conduct a comparative analysis between the proposed power allocation algorithms and a URLLC-only approach which takes into account only URLLC and power requirements. The results reveal that while the URLLC-only algorithm excels in energy efficiency, it is not able to support sensing requirements.   Moreover, we study the impact of ISAC on end-to-end (including radio and processing) energy consumption. Particularly, we present giga-operations per second (GOPS) analysis for both communication and sensing tasks. Two optimization problems are formulated and solved to minimize transmission and end-to-end energy through blocklength and power optimization. Results indicate that while end-to-end energy minimization offers substantial energy savings, its efficacy diminishes with sensing integration due to processing energy requirements. / Framtida mobila nätverk förväntas inte bara förbättra kommunikations-prestanda utan även mögliggöra nya applikationer baserade på sensorer. Dettaunderstryker den avgörande rollen för Integrerad avkänning och kommunika-tion (ISAC) i sjätte generationens (6G) och efterföljande mobila nätverk. Densömlösa integrationen av sensorer och kommunikation medför utmaningar iutrullning och resursallokering. Cellfria massiva flerantennsystem (MIMO-nätverk), kännetecknade av flera distribuerade åtkomstpunkter, erbjuder enlovande infrastruktur för implementering av ISAC. Dock kräver den effektivarealiseringen av ISAC samverkande design och optimering av resursallokering.I denna avhandling studerar vi ISAC inom cellfria massiva MIMO-system,med särskild tonvikt på att utveckla effektallokeringsalgoritmer under olikascenarier.Vi utforskar två scenarier: att utnyttja befintliga kommunikationssignaleroch att inkludera ytterligare sensorssignaler. Vi föreslår effektallokeringsalgo-ritmer med målet att maximera sensorsprestandan samtidigt som kommunika-tions och effektbegränsningar uppfylls. Dessutom utvecklar vi två detektorerbaserade på maximum a posteriori ratio test (MAPRT) under störningsfriaoch störda scenarier. Resultaten visar att användning av ytterligare sensors-signaler förbättrar sensorsprestandan, särskilt i scenarier där målet har lågreflektivitet. Dessutom, även om den störkänsliga detektorn kräver mer avan-cerad bearbetning, leder den till bättre sensorsprestanda. Vidare introducerarvi sensorerspektral effektivitet (SE) för att mäta effekten av resursblocksan-vändning och framhäva integrationsfördelarna med ISAC över ortogonala re-sursdelningsmetoder.I den andra delen av avhandlingen studerar vi energieffektivitetsaspek-terna av ISAC i cellfria massiva MIMO-system med användare med ultra-tillförlitlig låg-latens (URLLC) kommunikation. Vi föreslår en effektalloke-ringsalgoritm med syfte att maximera systemets energieffektivitet samtidigtsom kommunikations- och sensorskraven uppfylls. Vi utför en jämförande ana-lys mellan de föreslagna effektallokeringsalgoritmerna och ett URLLC-ensamttillvägagångssätt som tar hänsyn enbart till URLLC- och effektkrav. Resul-taten avslöjar att medan URLLC-ensamma algoritmen utmärker sig i energi-effektivitet, kan den inte stödja sensorskraven. Dessutom studerar vi effektenav ISAC på slut till slut (inklusive radios och bearbetning) energiförbruk-ning. Särskilt presenterar vi giga-operationer per sekund (GOPS) analys förbåde kommunikations- och sensorsuppgifter. Två optimeringsproblem formu-leras och löses för att minimera överförings- och slut till slut energi genomblocklängd- och effektoptimering. Resultaten indikerar att medan slut till slutenergiminimering erbjuder betydande energibesparingar, minskar dess effek-tivitet med sensorintegrationen på grund av bearbetningsenergikrav. / <p>QC 20240513</p>

Resource allocation in wireless networks is one of the most studied class of problems. Generally, these problems are formulated as utility maximization problems under relevant constraints. The challenges posed by these problems vary widely depending on the nature of the utility function under consideration. Recently, the widespread prevalence of wireless devices prompted researchers and engineers to delve into the security issues of wireless communication. As compared to the wired medium, ensuring security for the wireless medium is more challenging mainly due to the broadcast nature of the transmission. But the ongoing research on physical layer security promises robust and reliable security schemes for wireless communication. Contrary to conventional cryptographic schemes, physical layer security techniques are impregnable as the security is ensured by the inherent randomness present in the wireless medium. In this thesis, we consider several wireless scenarios and propose secrecy enhancing resource allocation schemes for them in the first few chapters. We initially address the problem of secure transmission by following the conventional approach in the secrecy literature|secrecy rate maximization. Needless to say, in these chapters, secrecy rate is the utility function and the constraints are posed by the available power budget. Then we consider a pragmatic approach where we target the signal-to-noise ratio (SNR) of participating nodes and ensure information secrecy by appropriately constraining the SNRs of those nodes. In those SNR based formulations, SNR at the destination is the utility function and we are interested in maximizing it. In the last two chapters, we study two scenarios in a non-secrecy setting. In one of them, end-to-end data rate is the utility, whereas, in the other one, two utility functions|based on revenue generated|are defined for two rational agents in a game-theoretic setting. In the second chapter, we study parallel independent Gaussian channels with imperfect channel state information (CSI) for the eavesdropper. Firstly, we evaluate the probability of zero secrecy rate in this system for (i) given instantaneous channel conditions and (ii) a Rayleigh fading scenario. Secondly, when non-zero secrecy is achievable in the low SNR regime, we aim to solve a robust power allocation problem which minimizes the outage probability at a target secrecy rate. In the third, fourth and fifth chapters, we consider scenarios where the source node transmits a message to the destination using M parallel amplify-and-forward (AF) relays in the presence of a single or multiple eavesdroppers. The third chapter addresses the problem of the maximum achievable secrecy rate for two specific network models: (a) degraded eavesdropper channel with complex channel gain and (b) scaled eavesdropper channel with real-valued channel gains. In the fourth chapter, we consider the SNR based approach and address two problems: (i) SNR maximization at the destination and (ii) Total relay power minimization. In the fifth chapter, we assume that the relay nodes are untrusted and to counter them, we deliberately introduce artificial noise in the source message. For this model, we propose and solve SNR maximization problems for the following two scenarios: (i) Total power constraint on all the relay nodes and (ii) Individual power constraints on each of the relay nodes. In the sixth chapter, we address the problem of passive eavesdroppers in multi-hop wire-less networks using the technique of friendly jamming. Assuming decode-and-forward (DF) relaying, we consider a scheduling and power allocation (PA) problem for a multiple-source multiple-sink scenario so that eavesdroppers are jammed, and source-destination throughput targets are met. When channel state information (CSI) of all the node are available, we intend to minimize the total power consumption of all the transmitting nodes. In the absence of eavesdroppers CSI, we minimize vulnerability region of the network. In chapter seven, the problem of cooperative beamforming for maximizing the achievable data rate of two-hop amplify-and-forward (AF) network (in the absence of eavesdropper(s)) is considered. Along with an individual power constraint on each of the relay nodes, we consider a weighted sum power constraint. To solve this problem, we propose a novel algorithm based on the Quadratic Eigenvalue Problem (QEP) and discuss its convergence. In chapter eight, we study a Stackelberg game between a base station and a multi-antenna power beacon for wireless energy harvesting in a multiple sensor node scenario. Assuming imperfect CSI between the sensor nodes and the power beacon, we propose a utility function that is based on throughput non-outage probability at the base station. We find the optimal strategies for the base station and the power beacon that maximize their respective utility functions.

The ever-growing demand of wireless traffic poses a challenge for current cellular networks. Each new generation must find new ways to boost the network capacity and spectral efficiency (SE) per device. A pillar of 5G is massive multiple-input-multiple-output (MIMO) technology. Through utilizing a large number of antennas at each transmitting node, massive MIMO has the ability to multiplex several user equipments (UEs) on the same time-frequency resources via spatial multiplexing. Looking beyond 5G, cell-free massive MIMO has attracted a lot of attention for its ability to utilize spatial macro diversity and higher resilience to interference. The cell-free architecture is based on a large number of distributed access points (APs) jointly serving the UEs within a coverage area without creating artificial cell boundaries. It provides a promising solution that is focused on delivering uniform service quality throughout the mobile network. The main challenges of the cell-free network architecture lie in the computational complexity for signal processing and the huge fronthaul requirements for information exchange among the APs. In this thesis, we tackle some of the inherent problems of the cell-free network architecture by providing distributed solutions to the power allocation and mobility management problems. We then introduce a new method for characterizing unknown interference in wireless networks. For the problem of power allocation, a distributed learning-based solution that provides a good trade-off between SE performance and applicability for implementation in large-scale networks is developed with reduced fronthaul requirements and computational complexity. The problem is divided in a way that enables each AP (or group of APs) to separately decide on the power coefficients to the UEs based on the locally available information at the AP without exchanging information with the other APs, however, still attempting to achieve a network wide optimization objective.  Regarding mobility management, a handover procedure is devised for updating the serving sets of APs and assigned pilot to each UE in a dynamic scenario considering UE mobility. The algorithm is tailored to reduce the required number of handovers per UE and changes in pilot assignment. Numerical results show that our proposed solution identifies the essential refinements since it can deliver comparable SE to the case when the AP-UE association is completely redone. Finally, we developed a new technique based on a Bayesian approach to model the distribution of the unknown interference arising from scheduling variations in neighbouring cells. The method is shown to provide accurate modelling for the unknown interference power and an effective tool for robust rate allocation in the uplink with a guaranteed target outage performance. / Den ständigt växande efterfrågan på trådlös datatrafik är en stor utmaning för dagens mobilnät. Varje ny nätgeneration måste hitta nya sätt att öka den totala kapaciteten och spektraleffektiviteten (SE) per uppkopplad enhet. En pelare i 5G är massiv-MIMO-teknik (multiple-input-multiple-output). Genom att använda ett stort antal antenner på varje mobilmast har massiv MIMO förmågan att kommunicera med flera användarutrustningar (eng. user equipment, UE) på samma tid/frekvensresurser via så kallad rumslig multiplexing. Om man ser bortom 5G-tekniken så har cellfri massiv-MIMO väckt stort intresse tack vare sin förmåga att utnyttja rumslig makrodiversitet för att förbättra täckningen och uppnå högre motståndskraft mot störningar. Den cellfria arkitekturen bygger på att ha ett stort antal distribuerade accesspunkter (AP) som gemensamt serverar UE:erna inom ett täckningsområde utan att dela upp området konstgjorda celler. Detta är en lovande lösning som är fokuserad på att leverera enhetliga datahastigheter i hela mobilnätet. De största forskningsutmaningarna med den cellfria nätverksarkitekturen ligger i beräkningskomplexiteten för signalbehandling och de enorma kraven på fronthaul-kablarna som möjliggör informationsutbyte mellan AP:erna. I den här avhandlingen löser vi några av de grundläggande utmaningarna med den cellfria nätverksarkitekturen genom att tillhandahålla distribuerade algoritmlösningar på problem relaterade till signaleffektreglering och mobilitetshantering. Vi introducerar sedan en ny metod för att karakterisera okända störningar i trådlösa nätverk. När det gäller signaleffektreglering så utvecklas en distribuerad inlärnings-baserad metod som ger en bra avvägning mellan SE-prestanda och tillämpbarhet för implementering i storskaliga cellfria nätverk med reducerade fronthaulkrav och lägre beräkningskomplexitet. Lösningen är uppdelat på ett sätt som gör det möjligt för varje AP (eller grupp av AP) att separat besluta om effektkoefficienterna relaterade till varje UE baserat på den lokalt tillgängliga informationen vid AP:n utan att utbyta information med de andra AP:erna, men ändå försöka uppnå ett nätverksomfattande optimeringsmål. När det gäller mobilitetshantering utformas en överlämningsprocedur som dynamiskt uppdaterar vilken uppsättning av AP:er som servar en viss UE och vilken pilotsekvens som används när den rör sig över täckningsområdet. Algoritmen är skräddarsydd för att minska antalet överlämningar per UE och förändringar i pilottilldelningen. Numeriska resultat visar att vår föreslagna lösning identifierar de väsentliga förfiningarna eftersom den kan leverera jämförbar SE som när AP-UE-associationen görs om helt och hållet. Slutligen utvecklade vi en ny Bayesiansk metod för att modellera den statistiska fördelningen av de okända störningarna som uppstår på grund av schemaläggningsvariationer i närliggande celler. Metoden har visat sig ge en korrekt modell av den okända störningseffekten och är ett effektivt verktyg för robust SE-allokering i upplänken med en garanterad maximal avbrottsnivå. / <p>QC 20230503</p>

The importance of cooperative relaying communication in substituting for, or complementing, multiantenna systems is described, and a brief literature review is presented. Amplify-and-forward (AF) and decode-and-forward (DF) relaying are investigated and compared for a dual-hop relay channel. The optimal strategy, source and relay optimal power allocation, and maximum cooperative gain are determined for the relay channel. It is shown that while DF relaying is preferable to AF relaying for strong source-relay links, AF relaying leads to more gain for strong source-destination or relay-destination links. Superimposed and selection AF relaying are investigated for multirelay, dual-hop relaying. Selection AF relaying is shown to be globally strictly outage suboptimal. A necessary condition for the selection AF outage optimality, and an upper bound on the probability of this optimality are obtained. A near-optimal power allocation scheme is derived for superimposed AF relaying. The maximum instantaneous rates, outage probabilities, and average capacities of multirelay, dual-hop relaying schemes are obtained for superimposed, selection, and orthogonal DF relaying, each with parallel channel cooperation (PCC) or repetition-based cooperation (RC). It is observed that the PCC over RC gain can be as much as 4 dB for the outage probabilities and 8.5 dB for the average capacities. Increasing the number of relays deteriorates the capacity performance of orthogonal relaying, but improves the performances of the other schemes. The application of rateless codes to DF relaying networks is studied by investigating three single-relay protocols, one of which is new, and three novel, low complexity multirelay protocols for dual-hop networks. The maximum rate and minimum energy per bit and per symbol are derived for the single-relay protocols under a peak power and an average power constraint. The long-term average rate and energy per bit, and relay-to-source usage ratio (RSUR), a new performance measure, are evaluated for the single-relay and multirelay protocols. The new single-relay protocol is the most energy efficient single-relay scheme in most cases. All the multirelay protocols exhibit near-optimal rate performances, but are vastly different in the RSUR. Several future research directions for fixed-rate and rateless coded cooperative systems, and frameworks for comparing these systems, are suggested. / Communications

No description available.