In this thesis we formulate joint cell, channel and power allocation problems within wireless communication networks. The objectives are to maximize the user with mini- mum data throughput (Shannon capacity) or to maximize the total system throughput, referred to as the max-min and max-sum problem respectively. The complexity is stud- ied together with proposed optimization- and heuristic-based approaches. In the first paper an overall joint cell, channel and power allocation max-min prob- lem is formulated. We show that the decision problem is NP-hard and that the op- timization problem is not approximable unless P is equal to NP, for instances with a sufficiently large number of channels. Further, it follows that for a feasible binary cell and channel allocation, the remaining continuous power allocation optimization problem is still not approximable unless P is equal to NP. In addition, it is shown that first-order optimality conditions give global optimum of the single channel power al- location optimization problem, although the problem is in general not convex. In the following two papers heuristics for solving the overall problem are proposed. In the second paper we consider the single channel problem with convex combinations of the max-min and the max-sum objective functions. This variable utility provides the ability of tuning the amount of fairness and total throughput. The third paper investi- gates the multiple channel setting. On a system with three cells, eight mobile users and three channels, we perform an exhaustive search over feasible cell and channel alloca- tions. The exhaustive search is then compared to the less computationally expensive heuristic approaches, presenting potential earnings to strive for. A conclusion is that several of the proposed heuristics perform very well. The final paper incorporates fixed relay stations into the overall joint cell, channel and power allocation max-min problem. The complexity is inherited from the formula- tion without relay stations. Further, we propose a heuristic channel allocation approach that shows good performance, compared to an optimization based approach, in numer- ical simulations on the relay setting. / Financial support by the Swedish Foundation for Strategic Research (SSF) QC 20110915

O padrão IEEE 802.16e é uma tecnologia emergente para redes de próxima geração com suporte à qualidade de serviço para usuários fixos e móveis. No contexto de aplicações móveis, a técnica OFDMA (Orthogonal Frequency Division Multiple Access) deve ser empregada para multiplexação de canais de rádio frequência, suportando a alocação simultânea do canal para múltiplos usuários. Porém, essa alocação, considerando a estrutura do quadro OFDMA, não é definida pelo padrão IEEE 802.16e. A maioria das pesquisas atuais sobre arquiteturas de escalonamento baseadas nessa técnica de multiplexação estão focadas na transmissão downlink ou consideram apenas parcialmente os aspectos decorrentes do emprego da técnica OFDMA. Sendo assim, neste trabalho é apresentada uma arquitetura de escalonamento hierárquica, com dois níveis, para transmissões uplink em redes IEEE 802.16e, baseadas em OFDMA. A arquitetura proposta aborda a divisão do subquadro uplink entre oportunidades de requisição de banda e oportunidades de transmissão de dados, no Nível 1, e a seleção das requisições de banda para atendimento, no Nível 2. A proposta considera, além da técnica de multiplexação do canal, as cinco classes de serviço previstas pelo padrão IEEE 802.16e e o mecanismo de alocação de banda definido para a tecnologia. Uma ferramenta de simulação foi desenvolvida para avaliar o desempenho da proposta, considerando os diferentes aspectos da arquitetura e comparando com trabalhos relacionados. A avaliação é realizada considerando métricas como atraso médio no atendimento de requisições, percentual de requisições descartadas e a utilização do quadro. / The IEEE 802.16e standard is an emerging next generation network technology, designed to provide guaranteed QoS to both fixed and mobile users. In the context of mobile users, OFDMA technique must be used to multiplex the radio frequency channel. This technique allows to allocate the channel to multiple users at the same time. However, details about this allocation, considering the OFDMA frame structure, are not defined by the IEEE 802.16e standard. In this context, most of the current researches found on literature focus on proposing scheduling architectures for downlink transmissions only. Furthermore, researches that consider uplink transmissions, typically consider OFDMA aspects only partially. Therefore, this work presents an hierarchical scheduling architecture designed for uplink transmissions. The proposed architecture is composed of two levels. In the Level 1 the architecture addresses the division of the uplink subframe in bandwidth request opportunities, and data transmission opportunities. Level 2 is used to select among the bandwidth request, those that will be served on the next uplink subframe. The proposal considers OFDMA multiplexing technique, the five classes of service defined for QoS provisioning, and the bandwidth allocation mechanism defined in IEEE 802.16e standard. In order to evaluate the behavior of the proposed architecture, a simulation tool was developed. The approach used for evaluation was to compare the performance of the proposed architecture with related works found in the literature. The performance evaluation considers metrics such as average delay for serving requests, requests discarded, and the overall frame utilization.

O padrão IEEE 802.16e é uma tecnologia emergente para redes de próxima geração com suporte à qualidade de serviço para usuários fixos e móveis. No contexto de aplicações móveis, a técnica OFDMA (Orthogonal Frequency Division Multiple Access) deve ser empregada para multiplexação de canais de rádio frequência, suportando a alocação simultânea do canal para múltiplos usuários. Porém, essa alocação, considerando a estrutura do quadro OFDMA, não é definida pelo padrão IEEE 802.16e. A maioria das pesquisas atuais sobre arquiteturas de escalonamento baseadas nessa técnica de multiplexação estão focadas na transmissão downlink ou consideram apenas parcialmente os aspectos decorrentes do emprego da técnica OFDMA. Sendo assim, neste trabalho é apresentada uma arquitetura de escalonamento hierárquica, com dois níveis, para transmissões uplink em redes IEEE 802.16e, baseadas em OFDMA. A arquitetura proposta aborda a divisão do subquadro uplink entre oportunidades de requisição de banda e oportunidades de transmissão de dados, no Nível 1, e a seleção das requisições de banda para atendimento, no Nível 2. A proposta considera, além da técnica de multiplexação do canal, as cinco classes de serviço previstas pelo padrão IEEE 802.16e e o mecanismo de alocação de banda definido para a tecnologia. Uma ferramenta de simulação foi desenvolvida para avaliar o desempenho da proposta, considerando os diferentes aspectos da arquitetura e comparando com trabalhos relacionados. A avaliação é realizada considerando métricas como atraso médio no atendimento de requisições, percentual de requisições descartadas e a utilização do quadro. / The IEEE 802.16e standard is an emerging next generation network technology, designed to provide guaranteed QoS to both fixed and mobile users. In the context of mobile users, OFDMA technique must be used to multiplex the radio frequency channel. This technique allows to allocate the channel to multiple users at the same time. However, details about this allocation, considering the OFDMA frame structure, are not defined by the IEEE 802.16e standard. In this context, most of the current researches found on literature focus on proposing scheduling architectures for downlink transmissions only. Furthermore, researches that consider uplink transmissions, typically consider OFDMA aspects only partially. Therefore, this work presents an hierarchical scheduling architecture designed for uplink transmissions. The proposed architecture is composed of two levels. In the Level 1 the architecture addresses the division of the uplink subframe in bandwidth request opportunities, and data transmission opportunities. Level 2 is used to select among the bandwidth request, those that will be served on the next uplink subframe. The proposal considers OFDMA multiplexing technique, the five classes of service defined for QoS provisioning, and the bandwidth allocation mechanism defined in IEEE 802.16e standard. In order to evaluate the behavior of the proposed architecture, a simulation tool was developed. The approach used for evaluation was to compare the performance of the proposed architecture with related works found in the literature. The performance evaluation considers metrics such as average delay for serving requests, requests discarded, and the overall frame utilization.

Dans cette thèse, nous étudions le problème de l'allocation de ressources dans le cadre des réseaux 4G LTE. La méthode d'accès OFDMA qui est utilisée partage les ressources radios à la fois dans le domaine fréquentiel et temporel. En raison des déficiences du canal, les utilisateurs ne bénéficient pas toujours des mêmes débits d'émission/réception sur chacune des ressources. Dans ce cadre, notre problème consiste à distribuer ces ressources radios aux mobiles afin de leur permettre de transmettre/recevoir des données. L'algorithme utilisé pour allouer les ressources a une importance fondamentale sur les performances du système. La norme LTE ajoute des contraintes supplémentaires à ce problème et rend l'exploitation de la diversité fréquentielle et de la diversité multi-utilisateurs plus difficile. En effet, sous ces contraintes, nous montrons que le problème de l'allocation de ressources fait alors partie de la classe des problèmes « difficiles ». Par conséquent, les algorithmes classiques de la littérature sont souvent inadaptés à un réseau LTE réel. Nous proposons des algorithmes d'allocation de ressources à la fois pour le sens montant et descendant de LTE. Les contraintes de la norme sont rigoureusement prises en compte afin de construire des solutions efficaces. De plus, les algorithmes proposés sont génériques et peuvent donc s'adapter à une grande variété d'objectifs. En particulier, nous nous attachons à prendre en charge les trafics multimédias dont les débits et les besoins en qualité de service sont très hétérogènes (taux d’erreurs binaires, retard, gigue, etc.). En effet, l'augmentation progressive des débits et la forte popularité des équipements mobiles intelligents amènent à une utilisation toujours plus massive des applications multimédias. Tous nos algorithmes sont validés par simulation. Par ce biais, nous montrons que la prise en compte des contraintes de LTE est essentielle à l'obtention de performances élevées. / In this thesis, we study the resource allocation problem within the framework of 4G LTE networks. The OFDMA access method divides the radio resources both in the frequency and time domains. Due to channel impairments, users do not always have the same transmit/receive rates on each resource. In this context, our problem is to share the radio resources between users and enable them to transmit/receive data. The algorithm used to allocate resources is of fundamental importance on system performance. The LTE standard adds constraints to this problem and makes harder the exploitation of the frequency and the multi-user diversity. Indeed, under these constraints, we show that the resource allocation problem becomes part of the « most difficult » problems. Therefore, the conventional algorithms are often not adapted to a real LTE network. We provide resource allocation algorithms for both the uplink and downlink of LTE. The constraints of the standard are rigorously taken into account in order to build effective solutions. In addition, the proposed algorithms are generic and can adapt to a wide variety of objectives. In particular, we focus on the support of multimedia traffic with heterogeneous quality of service requirements (bit error rate, delay, jitter, etc.). Indeed, the gradual increase of the offered throughput and the strong popularity of smart mobile devices lead to a massive use of multimedia applications. Our algorithms are validated through extensive simulation. By this means, we show that the inclusion of LTE constraints is essential to achieving high performance.

Cette thèse a permis de travailler sur l'efficacité d'un canal des systèmes massifs MIMO pour lesquels il faille déterminer le débit à l'Uplink des terminaux présents dans leurs cellules respectives. Comme hypothèse, la bande de fréquence en mode TDD est réutilisée dans chaque cellule. Tous les symboles sont propagés de manière asynchrone par les terminaux présents dans les cellules, n'empêchant pas de fait des interactions intra et inter symboles au niveau des stations de base. Ces signaux rencontrent beaucoup d'obstacles sur leur trajet qui entraînent des retards, des pertes de signaux (destructifs), des régénérations de signaux (constructifs) avec divers types de modulation (amplitude, fréquentielle, phase), etc. L’affaiblissement du trajet dans le canal est mis en exergue avec les différentes valeurs prises par le coefficient d'atténuation choisi lors des simulations. Face à cette situation, il a fallu rechercher le meilleur et robuste estimateur de canal à un temps de cohérence donné. La méthode MMSE (Minimum Mean Square Error) est retenue, comparée à d'autres. Pour la performance des systèmes massifs MIMO, nous nous sommes appesantis sur les méthodes de diversité des antennes (diversité d'ordre N), les méthodes de coding, les méthodes d'accès OFDMA et les méthodes d'égalisation pour montrer qu'effectivement le fait d'utiliser de nombreuses antennes au niveau des stations de base améliore et contribue aux gains recherchés en débits. Avec les systèmes massifs MIMO, nous avons montré que l'apport antennaire est bien reconnu dans la gestion des interférences. Un algorithme de calcul de débit à l'Uplink a été réalisé avec trois récepteurs conventionnels que sont le MRC (Maximum Ratio Combiner), le ZF (Zero-Forcing) et le MMSE (Minimum Mean Square Error). Les simulations ont permis de comparer les différentes approches. En faisant varier la puissance de contamination des symboles pilotes, nous observons la convergence des courbes ZF et MMSE. Si le nombre des cellules L augmentent, nous constatons que plus la puissance de contamination des symboles pilotes (pp) est élevée, plus la capacité diminue dans le canal. Après plusieurs itérations, notre algorithme converge vers une asymptote (régime stationnaire et linéaire) où les échantillons à la sortie des détecteurs s’approchent de la séquence de données émises. Le SINR obtenu avec les détecteurs conventionnels permet le calcul des débits respectifs dans le canal avec le théorème de SHANNON. / This thesis made it possible to work on the efficiency of a channel of massive MIMO systems for which it is necessary to determine the throughput at the Uplink of the terminals present in their respective cells. As an assumption, the frequency band in TDD mode is reused in each cell. All symbols are propagated asynchronously by the terminals present in the cells, not effectively preventing intra- and inter-symbol interactions at the base stations. These signals encounter many obstacles on their path that lead to delays, signal losses (destructive), signal regenerations (constructive) with various types of modulation (amplitude, frequency, phase), etc. The path loss in the channel is highlighted with the different values taken by the attenuation coefficient chosen during the simulations. Faced with this situation, it was necessary to look for the best and most robust channel estimator at a given consistency time. The MMSE (Minimum Mean Square Error) method is used, compared to others. For the performance of massive MIMO systems, we have focused on antenna diversity methods (N-order diversity), coding methods, OFDMA access methods and equalization methods to show that effectively using multiple antennas at base stations improves and contributes to the desired rate gains. With massive MIMO systems, we have shown that antennar contribution is well recognized in interference management. An algorithm for calculating the flow rate at the Uplink was developed using three conventional receivers: the MRC (Maximum Ratio Combiner), the ZF (Zero-Forcing) and the MMSE (Minimum Mean Square Error). The simulations made it possible to compare the different approaches. By varying the contamination power of the pilot symbols, we observe the convergence of the ZF and MMSE curves. If the number of L cells increases, we find that the higher the contamination power of the pilot symbols (pp), the lower the capacity in the channel. After several iterations, our algorithm converges to an asymptote (stationary and linear regime) where the samples at the detector output approach the transmitted data sequence. The SINR obtained with conventional detectors allows the calculation of the respective flows in the channel with the SHANNON theorem.

Dans les systèmes de transmission multiporteuses et impliquant plusieurs utilisateurs, deux phénomènes viennent perturber la réception et la détection de symboles : le canal de propagation et le décalage des fréquences porteuses (DFP). Cette thèse traite de techniques d’égalisation et de synchronisation en fréquence reposant sur des techniques de type Kalman telles que le filtrage de Kalman étendu (EKF) du 1er ou du 2nd ordre, le filtrage de Kalman étendu itératif ou le filtrage de Kalman par sigma point (SPKF). Pour relaxer les hypothèses de Gaussianité sur les bruits de mesure et de modèle dans la représentation dans l’espace d’état, des approches de type H[infini] sont aussi étudiées.Ces méthodes sont ensuite exploitées dans des systèmes de type OFDMA ou OFDM-IDMA et sont combinées avec d’autres approches (MMSE-SD, tests statistiques, etc.) pour mettre en œuvre des récepteurs pouvant être notamment robustes à des interférences large bande, comme c’est le cas dans des applications de radio intelligence. / Multicarrier modulation is the common feature of high-data rate mobile wirelesssystems. In that case, two phenomena disturb the symbol detection. Firstly,due to the relative transmitter-receiver motion and a difference between the localoscillator (LO) frequency at the transmitter and the receiver, a carrier frequencyoffset (CFO) affects the received signal. This leads to an intercarrier interference(ICI). Secondly, several versions of the transmitted signal are received due to thewireless propagation channel. These unwanted phenomena must be taken intoaccount when designing a receiver. As estimating the multipath channel and theCFO is essential, this PhD deals with several CFO and channel estimation methodsbased on optimal filtering.Firstly, as the estimation issue is nonlinear, we suggest using the extended Kalmanfilter (EKF). It is based on a local linearization of the equations around the laststate estimate. However, this approach requires a linearization based on calculationsof Jacobians and Hessians matrices and may not be a sufficient descriptionof the nonlinearity. For these reasons, we can consider the sigma-point Kalmanfilter (SPKF), namely the unscented Kalman Filter (UKF) and the central differenceKalman filter (CDKF). The UKF is based on the unscented transformationwhereas the CDKF is based on the second order Sterling polynomial interpolationformula. Nevertheless, the above methods require an exact and accurate apriori system model as well as perfect knowledge of the additive measurementnoisestatistics. Therefore, we propose to use the H∞ filtering, which is known tobe more robust to uncertainties than Kalman filtering. As the state-space representationof the system is non-linear, we first evaluate the “extended H∞ filter”,which is based on a linearization of the state-space equations like the EKF. As analternative, the “unscented H∞ filter”, which has been recently proposed in theliterature, is implemented by embedding the unscented transformation into the“extended H∞ filter” and carrying out the filtering by using the statistical linearerror propagation approach.The above techniques have been implemented in different multicarrier contexts:Firstly, we address the estimation of the multiple CFOs and channels by meansof a control data in an uplink orthogonal frequency division multiple access(OFDMA) system. To reduce the amount of control data, the optimal filteringtechniques are combined in an iterative way with the so-called minimum meansquare error successive detector (MMSE-SD) to obtain an estimator that doesnot require pilot subcarriers.

Cette thèse s'intéresse aux stratégies de transmission de contenu multimédia des réseaux sans fil. L'intérêt d'une stratégie repose sur sa capacité à gérer les ressources selon les objectifs des applications visées. On propose ainsi un schéma de transmission, qui garantit la qualité de service (QdS), quelles que soient les conditions du canal et suivant les spécificités du contenu multimédia. On exploite pour cela les diversités (spatiales, fréquentielles, etc.) du canal radio. A ce titre, l'association MIMO-OFDM apparaît comme une solution idéale pour accroitre les performances du système. On propose ainsi un système MIMO-OFDMA, qui intègre des stratégies inter-couches. Celles-ci se basent sur des techniques d'adaptation de lien pour régler dynamiquement les paramètres du système. On développe en premier un schéma inter-couches PHY 1 APPL, associé à un système MIMO-OFDM mono-utilisateur, qui transmet une vidéo H.264/SVC. L'adaptation de lien permet de définir le jeu de paramètres optimaux, qui minimise la distorsion de la vidéo reçue. On introduit ainsi une politique d'optimisation sous contraintes de puissance et de taux d'erreurs binaires. Pour tenir compte d'aspects de transmission réalistes, on propose un schéma inter-couches PHY/MAC, dédié à un système MIMO-OFDMA, multi-utilisateurs et multi-services. Ce dernier associe un algorithme d'ordonnancement, au paramétrage optimal, pour fournir au maximum d'utilisateurs des débits utiles respectant les exigences des services demandés. Enfin, on combine les deux premières solutions pour définir les paramètres optimaux minimisant la distorsion de la vidéo reçue par utilisateur, tout en garantissant la QdS des autres services. / This thesis focuses on the transmission strategies of the multimedia content in wireless networks. The advantage of a such strategy is its ability to manage the resources, according to the objectives of the targeted applications. We propose a transmission scheme, which guarantees the quality of service (QoS), depending on the channel state information and on the multimedia content specifications. We take advantage of the radio channel diversities (spatial, frequency, etc.). ln fact, the association of MIMO and OFDM techniques appears as effective solution to increase the system performance. For this reason, we propose a MIMO-OFDMA system, which considers cross-layer srtategies based on link adaptation schemes to dynamically adjust the system parameters. Firstly, we develop a PHY/APPL cross-layer strategy, dedicated to a single user of a MIMO-OFDMA system, which transmits an H.264/SVC video. The Iink adaptation scheme allows to define the optimum parameters, which minimize the end-ta-end video distortion by using an optimization algorithm under power and bit error rate constraints. To consider the realistic transmission aspects, we propose a PHY/MAC cross-layer strategy, dedicated to a multi-user, multi-service, MIMOOFDMA system. This scheme combines a scheduling policy with optimal parameterization to provide a satisfied troughput to a maximum number of users, acheiving the required services. Finally, the first two solutions are combined to determine the optimal parameters which minimize the end-ta-end distortion of the received video by user, and also acheive QoS requirements of the other services.

Abstract This thesis concentrates on joint optimization of transmit power allocation and receive filtering in multiuser, multi-antenna communications. Due to the increasing number of wireless devices, the design of energy-efficient communication links is becoming increasingly important. In cellular mobile communications, reducing the average power consumption in uplink transmission is beneficial for users in order to extend battery life and, hence, energy efficiency in general. However, the power consumption of the high power amplifier (HPA) at the transmitter depends on the peak power of the transmission. This thesis focuses on power allocation problems for single-carrier (SC) frequency division multiple access (FDMA) and orthogonal FDMA (OFDMA) transmission assuming iterative reception. The goal in the first scheme presented in this thesis is to reduce the average power consumption by designing a power allocation method that takes into account the convergence properties of an iterative receiver in multiuser uplink communications. The proposed scheme can guarantee that the desired quality of service (QoS) is achieved after a sufficient number of iterations. Reducing the peak-to-average power ratio (PAPR) in any transmission system is beneficial because it allows the use of inexpensive, energy-efficient power amplifiers. The goal in the second scheme presented in this thesis is to control the PAPR of the transmitted signal. Hence, in addition to the QoS constraint, the instantaneous PAPR constraint is derived for SC-FDMA and OFDMA transmission. Moreover, a statistical approach is considered in which the power variance of the transmitted waveform is controlled. The QoS and PAPR constraints are considered jointly and, therefore, the proposed power allocation strategy jointly takes into account the channel quality and the PAPR characteristics of the power amplifier. However, the PAPR constraint can be adopted to any SC-FDMA or OFDMA framework and it is not restricted to the scheme presented in this thesis. The objective of the optimization problems considered throughout the thesis is to minimize the sum power. The majority of the derived constraints are non-convex and therefore, two alternative successive convex approximations (SCAs) are derived for all the non-convex constraints considered. The numerical results show that the proposed power allocation strategies can significantly reduce the average transmission power of users while allowing flexible PAPR control. Hence, the proposed methods can be used to extend battery life for users and especially improve the QoS at the cell edges. / Tiivistelmä Väitöskirjassa tutkitaan lähettimessä tapahtuvan tehoallokoinnin sekä vastaanottimessa tapahtuvan signaalin suodatuksen yhteisoptimointia monikäyttöön suunnatussa langattomassa moniantennikommunikaatiossa. Langattomien laitteiden lukumäärän kasvaessa energiatehokkuuden merkitys tiedonsiirtolinkkien suunnittelussa korostuu. Soluihin perustuvassa langattomassa tietoliikenteessä keskimääräisen tehonkulutuksen pienentäminen ylälinkkilähetyksessä (käyttäjältä tukiasemaan) on tärkeää käyttäjän kannalta, sillä se pidentää laitteen akun kestoa. Lähettimen tehovahvistimen (high power amplifier (HPA)) tehonkulutus on kuitenkin verrannollinen lähetyksen huipputehoon. Väitöskirjassa luodaaan uusia menetelmiä sekä vertaillaan tehoallokointia yhden kantoaallon taajuustason monikäyttöön (single carrier frequency division multiple access (SC-FDMA)) ja ortogonaalisen taajuustason monikäyttöön (orthogonal FDMA (OFDMA)) perustuvissa lähetysteknologioissa. Työn ensimmäisessä osiossa tavoitteena on keskimääräisen tehonkulutuksen pienentäminen monen käyttäjän ylälinkkikommunikaatiossa suunnittelemalla tehoallokointimenetelmä, joka ottaa huomioon iteratiivisen vastaanottimen konvergenssiominaisuudet. Työssä ehdotettu menetelmä takaa vastaanotetun informaation halutun laadun (quality of service (QoS)) riittävän monen vastaanottimessa tehdyn iteraation jälkeen. Huipputehon ja keskitehon suhteen (peak to average power ratio (PAPR)) pienentäminen missä tahansa lähetyksessä on hyödyllistä, sillä sen ansiosta voidaan käyttää energiatehokkaampia ja halvempia tehovahvistimia. Työn jälkimmäisessä osiossa tavoitteena on kontrolloida lähetetyn signaalin huipputehon ja keskitehon suhdetta. Työn ensimmäisessä osiossa esitetyn QoS-rajoitteen lisäksi tehoallokointia rajoitetaan symbolisekvenssikohtaisella PAPR-rajoitteella SCFDMA- ja OFDMA-lähetyksessä. Lisäksi esitetään tilastollinen menetelmä, jossa rajoitetaan lähetetyn signaalin tehon varianssia. Kun käytetään yhtäaikaisesti QoS- ja PAPR-rajoitteita, voidaan tiedonsiirtokanavaan suunnitella optimaalinen tehoallokointi ottaen huomioon tehovahvistimen epälineaarisuudet. Työssä esitetty PAPR-rajoite on kuitenkin geneerinen, ja se voidaan sovittaa mihin tahansa SCFDMA- tai OFDMA- optimointikehykseen. Työssä esitettävien optimointiongelmien tavoitteena on käyttäjien summatehon minimointi. Suurin osa työssä esiintyvistä ongelmista on ei-konvekseja, joten siinä esitetään kaksi vaihtoehtoista peräkkäinen konveksi approksimaatio (successive convex approximation (SCA)) -menetelmää kaikille ei-konvekseille rajoitteille. Numeeriset tulokset osoittavat, että esitetyt tehoallokointimenetelmät pienentävät merkittävästi keskimääräistä tehonkulutusta mahdollistaen lisäksi adaptiivisen PAPR-kontrolloinnin. Väitöskirjassa esitettyjen menetelmien avulla voidaan pidentää mobiilikäyttäjien akun kestoa sekä erityisesti parantaa solun reunakäyttäjien palvelun laatua.

Les problèmes d’optimisation combinatoire sont généralement réputés NP-difficiles, donc il n’y a pas d’algorithmes efficaces pour les résoudre. Afin de trouver des solutions optimales locales ou réalisables, on utilise souvent des heuristiques ou des algorithmes approchés. Les dernières décennies ont vu naitre des méthodes approchées connues sous le nom de métaheuristiques, et qui permettent de trouver une solution approchées. Cette thèse propose de résoudre des problèmes d’optimisation déterministe et stochastique à l’aide de métaheuristiques. Nous avons particulièrement étudié la méthode de voisinage variable connue sous le nom de VNS. Nous avons choisi cet algorithme pour résoudre nos problèmes d’optimisation dans la mesure où VNS permet de trouver des solutions de bonne qualité dans un temps CPU raisonnable. Le premier problème que nous avons étudié dans le cadre de cette thèse est le problème déterministe de largeur de bande de matrices creuses. Il s’agit d’un problème combinatoire difficile, notre VNS a permis de trouver des solutions comparables à celles de la littérature en termes de qualité des résultats mais avec temps de calcul plus compétitif. Nous nous sommes intéressés dans un deuxième temps aux problèmes de réseaux mobiles appelés OFDMA-TDMA. Nous avons étudié le problème d’affectation de ressources dans ce type de réseaux, nous avons proposé deux modèles : Le premier modèle est un modèle déterministe qui permet de maximiser la bande passante du canal pour un réseau OFDMA à débit monodirectionnel appelé Uplink sous contraintes d’énergie utilisée par les utilisateurs et des contraintes d’affectation de porteuses. Pour ce problème, VNS donne de très bons résultats et des bornes de bonne qualité. Le deuxième modèle est un problème stochastique de réseaux OFDMA d’affectation de ressources multi-cellules. Pour résoudre ce problème, on utilise le problème déterministe équivalent auquel on applique la méthode VNS qui dans ce cas permet de trouver des solutions avec un saut de dualité très faible. Les problèmes d’allocation de ressources aussi bien dans les réseaux OFDMA ou dans d’autres domaines peuvent aussi être modélisés sous forme de problèmes d’optimisation bi-niveaux appelés aussi problèmes d’optimisation hiérarchique. Le dernier problème étudié dans le cadre de cette thèse porte sur les problèmes bi-niveaux stochastiques. Pour résoudre le problème lié à l’incertitude dans ce problème, nous avons utilisé l’optimisation robuste plus précisément l’approche appelée « distributionnellement robuste ». Cette approche donne de très bons résultats légèrement conservateurs notamment lorsque le nombre de variables du leader est très supérieur à celui du suiveur. Nos expérimentations ont confirmé l’efficacité de nos méthodes pour l’ensemble des problèmes étudiés. / Combinatorial optimization problems are generally NP-hard problems, so they can only rely on heuristic or approximation algorithms to find a local optimum or a feasible solution. During the last decades, more general solving techniques have been proposed, namely metaheuristics which can be applied to many types of combinatorial optimization problems. This PhD thesis proposed to solve the deterministic and stochastic optimization problems with metaheuristics. We studied especially Variable Neighborhood Search (VNS) and choose this algorithm to solve our optimization problems since it is able to find satisfying approximated optimal solutions within a reasonable computation time. Our thesis starts with a relatively simple deterministic combinatorial optimization problem: Bandwidth Minimization Problem. The proposed VNS procedure offers an advantage in terms of CPU time compared to the literature. Then, we focus on resource allocation problems in OFDMA systems, and present two models. The first model aims at maximizing the total bandwidth channel capacity of an uplink OFDMA-TDMA network subject to user power and subcarrier assignment constraints while simultaneously scheduling users in time. For this problem, VNS gives tight bounds. The second model is stochastic resource allocation model for uplink wireless multi-cell OFDMA Networks. After transforming the original model into a deterministic one, the proposed VNS is applied on the deterministic model, and find near optimal solutions. Subsequently, several problems either in OFDMA systems or in many other topics in resource allocation can be modeled as hierarchy problems, e.g., bi-level optimization problems. Thus, we also study stochastic bi-level optimization problems, and use robust optimization framework to deal with uncertainty. The distributionally robust approach can obtain slight conservative solutions when the number of binary variables in the upper level is larger than the number of variables in the lower level. Our numerical results for all the problems studied in this thesis show the performance of our approaches.

Master of Science / Department of Electrical and Computer Engineering / Balasubramaniam Natarajan / In recent years, orthogonal frequency division multiplexing (OFDM) scheme has received significant research interest due to its capability of supporting high data rates in hostile environments. As compared to conventional single-carrier modulation schemes, OFDM benefits from low complexity equalization filters and high spectral efficiency. A multiple access implementation of OFDM, i.e., orthogonal frequency division multiple access (OFDMA) has been considered as the multiple access (MA) scheme in 3GPP LTE, or LTE advanced downlink. In cellular OFDMA, frequency hopping (FH) is widely used to exploit frequency diversity gain and improve system throughput; and pilot patterns that have low-cross correlation are employed to improve the quality of channel estimation. However, there are numerous unsolved problems that need to be addressed in frequency hopped and pilot assisted OFDMA systems. Surveying the prior works in the literature, we find that limited research efforts have focused on coping with the inherent disadvantages regarding OFDM in cellular OFDMA systems. In this thesis, we employ the so-called residue number system (RNS) arithmetic concentrating on (a) FH pattern design for minimizing/averaging intra/inter-cell interference, (b) pilot pattern design for improving the quality of channel estimation, and (c) pilot pattern design for facilitating time-frequency synchronization and device identification in multi-cell OFDMA. Regarding (a), RNS-based FH patterns not only preserve orthogonality within the same cell, but also have the minimum number of symbol collisions among adjacent cells. Additionally, the RNS-based method exhibits consistent system performance and more frequency diversity gains as compared to previous efforts. With respect to (b), RNS-based pilot pattern design generates more unique pilot patterns than conventional methods. This results in low probability of pilot-to-pilot collisions, which in turn, significantly improves the quality of channel estimation from the system level perspective. For (c), as a special case of linear congruence sequences, RNS-based pilot patterns have good auto-correlation properties, which are extremely helpful in time-frequency synchronization and device identification.