A research report submitted to the Faculty of Humanities, University of the Witwatersrand, in partial fulfilment of the requirements for the degree of Master of Arts (in the field of ICT Policy and Regulation), October 2017 / Spectrum management reforms involve a departure from state-commanded administrative methods to market-driven property rights and or technology-enabled spectrum commons. This study explores spectrum management reforms that have been undertaken in the last decade, between 2006 and 2016, in the Southern African Development Community (SADC) region, with specific focus on the mobile broadband (MBB) industry. As a result, only spectrum bands allocated to terrestrial mobile and identified for International Mobile Telecommunications (IMT) by the International Telecommunication Union (ITU) in ITU Region 1 (Europe, Middle East and Africa) were considered. The purpose was to firstly analyse the progress thus far in reforming spectrum management practice in the region and secondly to critically analyse the effects of these reforms on the MBB industry in SADC within the framework of high demand for more spectrum as the cornerstone for rapid diffusion of MBB. Using a constructivist case study methodology, qualitative research was conducted in three SADC countries, namely, Botswana, Zambia and South Africa, representing small, medium and large markets respectively. The study draws on published documents such as policies, legislation, regulations and directly from individuals tasked with spectrum management in public and private sector organisations in these countries. The findings reveal that several market-driven reforms such as technology and service neutrality, spectrum re-farming and administrative incentive pricing (AIP), together with technology-enabled reforms such as commons or license-exempt spectrum for MBB technologies are all becoming widespread in the region. However, secondary trading and auctions have been stillborn concepts, partly due to market concentration concerns and appropriateness issues. The artificial scarcity of MBB spectrum supply in SADC is laid bare against a backdrop of general scarcity for demand and a discord over how this spectrum should be assigned and to whom. Vast amounts of allocated mobile spectrum in SADC lie fallow or are encumbered by other services such as broadcasting or at times are historically assigned to Fixed Wireless Access (FWA) applications. Analysis of the data from these three country case study provides insights that may be relevant to many other countries in the region. In conclusion, the study advances that the implementation of spectrum management reforms should be nuanced as these can impact, positively or negatively, on the distributive agenda of government. This research further advances knowledge by positing a novel conceptual framework for spectrum management reform based on the finding that the latter is not a binary exercise of a departure from administrative approach to either a market-driven or a technology-enabled one. However, spectrum management reform can be a continuum on which different elements of administrative, market-driven and technology-enabled approaches can be applied to varying degrees, depending on the respective country’s context. / XL2019

The concept of network slicing has been introduced in order to enable mobile networks to accommodate multiple heterogeneous use cases that are anticipated to be served within a single physical infrastructure. The slices are end-to-end virtual networks that share the resources of a physical network, spanning the core network (CN) and the radio access network (RAN). RAN slicing can be more challenging than CN slicing as the former deals with the distribution of radio resources, where the capacity is not constant over time and is hard to extend. The main challenge in RAN slicing is to simultaneously improve multiplexing gains while assuring enough isolation between slices, meaning one of the slices cannot negatively influence other slices. In this work, a flexible and configurable framework for RAN slicing is provided, where diverse requirements of slices are taken into account, and slice management algorithms adjust the control parameters of different radio resource management (RRM) mechanisms to satisfy the slices' service level agreements (SLAs). A new entity that translates the key performance indicator (KPI) targets of the SLAs to the control parameters is introduced and is called RAN slice orchestrator. Diverse algorithms governing this entity are introduced, which range from heuristics-based to model-free methods. Besides, a protection mechanism is constructed to prevent the negative influences of slices on each other's performances. The simulation-based analysis demonstrates the feasibility of slicing the RAN with multiplexing gains and slice isolation.

Yes / This paper presents the architectural design, software implementation, the validation and flight trial results of an aeronautical communications system developed within the Seamless Aeronautical Networking through integration of Data links Radios and Antennas (SANDRA) project funded by the European 7th Framework Aeronautics and Transport Programme. Based on Software Defined Radio (SDR) techniques, an Integrated Modular Radio (IMR) platform was developed to accommodate several radio technologies. This can drastically reduce the size, weight and cost in avionics with respect to current radio systems implemented as standalone equipment. In addition, the modular approach ensures the possibility to dynamically reconfigure each radio element to operate on a specific type of radio link. A radio resource management (RRM) framework is developed in the IMR consisting of a communication manager for the resource allocation and management of the different radio links and a radio adaptation manager to ensure protocol convergence through IP. The IMR has been validated though flight trials held at Oberpfaffenhofen, Germany in June 2013. The results presented in the paper validate the flexibility and scalability of the IMR platform and demonstrate seamless service coverage across different airspace domains through interworking between the IMR and other components of the SANDRA network. / European Commission

Les systèmes de 3G offrent de nouveaux services support (bearer services) à plus hauts débits pour les modes de transmission "paquet". Ces services vont coexister avec la voix (ou d'autres services temps réels), des scénarios de trafic mixte, voix et données, doivent être envisagés. La norme UMTS permet effectivement aux utilisateurs d'avoir plus d'un service activé simultanément. Les différentes classes de trafic augmentent la complexité de la gestion des ressources radios. Dans ce contexte, deux types de fonctions sont étudiés: l'allocation de TFCI et l'ordonnancement de paquets. Leur impact sur la qualité de service (QoS) ainsi que sur la capacité du système est évalué. On propose des améliorations de ces mécanismes dans le but d'augmenter la capacité du système et par conséquent d'améliorer la QoS des utilisateurs. Les études se restreignent au sens montant, c'est à dire aux transmissions du mobile (User Equipment ou UE) vers le réseau. Un premier mécanisme pour lequel un effort d'amélioration est fait, est l'adaptation du lien radio par variation du débit instantané transmis. On simule le cas d'une transmission multiservice (voix et données). L'UE doit partager un débit global qui lui est alloué entre les différents services activés. Ces derniers sont véhiculés dans des radio bearers (tuyaux supports). À chaque intervalle élémentaire de transmission (Transmission Time Interval, TTI), l'UE sélectionne un sous-débit pour chaque bearer; ceci se fait par la sélection d'un "format de transport" à appliquer pendant la durée TTI. Cette procédure s'effectue dans la couche MAC (Medium Access Control); le résultat de la sélection est une combinaison de formats de transport (Transport Format Combination, TFC) que la couche physique doit utiliser. La procédure, nommée sélection de TFC, permet d'adapter la transmission des différents services aux conditions variables de la propagation radio: elle détermine notablement la performance de transmission. L'algorithme de sélection de TFC est tracé dans ses grandes lignes dans la norme. Un de ses principes est de favoriser le trafic temps réel au détriment des services de données par paquet. Cependant, le trafic temps réel peut être perturbé par le trafic de données sous certaines conditions, en particulier pour les mobiles éloignés de la station de base (Node B). On propose un algorithme de sélection de TFC qui limite ces perturbations et qui offre une plus large zone de couverture aux services temps réels. En plus, il améliore la QoS du service de données et le débit effectif de l'UE sans augmenter sa puissance de transmission. Un autre type d'études concerne l'ordonnancement de paquets entre les différents utilisateurs ou UEs. C'est une procédure qui est contrôlée par la partie fixe du réseau. Nous l'étudions principalement par simulation en considérant divers mécanismes ou variations. Un premier mécanisme est nommé fast Variable Spreading Factor (fast VSF): les UEs distants changent rapidement leur facteur d'étalement (SF) afin de conserver une puissance de transmission constante, ce qui vise à stabiliser l'interférence inter-cellulaire. Un deuxième mécanisme étudié est un accès paquet décentralisé (decentralized mode) utilisant une information en retour sur le niveau global d'interférence dans la cellule. Un troisième mécanisme nommé "fast scheduling" (ordonnancement rapide) raccourcit le cycle d'ordonnancement. Les résultats ont montré que dans le cas de faible ou moyenne charge dans la cellule, le mode décentralisé réduit le délai par paquet jusqu'à 25 %. L'ordonnancement rapide augmente la capacité du système jusqu' à 10%. En plus, il améliore la QoS perçue par les utilisateurs en terme de débit par utilisateur et délai par paquet transmis.

The popularity of ubiquitous Internet services has spurred the fast growth of wireless communications by launching data hungry multimedia applications to mobile devices. Powered by spectrum agile cognitive radios, the newly emerged cognitive radio networks (CRN) are proposed to provision the efficient spectrum reuse to improve spectrum utilization. Unlicensed users in CRN, or secondary users (SUs), access the temporarily idle channels in a secondary and opportunistic fashion while preventing harmful interference to licensed primary users (PUs). To effectively detect and exploit the spectrum access opportunities released from a wide spectrum, the heterogeneous wireless channel characteristics and the underlying prioritized spectrum reuse features need to be considered in the protocol design and resource management schemes in CRN, which plays a critical role in unlicensed spectrum sharing among multiple users. The purpose of this dissertation is to address the challenges of utilizing heterogeneous wireless channels in CRN by its intrinsic dynamic and diverse natures, and build the efficient, scalable and, more importantly, practical dynamic spectrum access mechanisms to enable the cost-effective transmissions for unlicensed users. Note that the spectrum access opportunities exhibit the diversity in the time/frequency/space domain, secondary transmission schemes typically follow three design principles including 1) utilizing local free channels within short transmission range, 2) cooperative and opportunistic transmissions, and 3) effectively coordinating transmissions in varying bandwidth. The entire research work in this dissertation casts a systematic view to address these principles in the design of the routing protocols, medium access control (MAC) protocols and radio resource management schemes in CRN. Specifically, as spectrum access opportunities usually have small spatial footprints, SUs only communicate with the nearby nodes in a small area. Thus, multi-hop transmissions in CRN are considered in this dissertation to enable the connections between any unlicensed users in the network. CRN typically consist of intermittent links of varying bandwidth so that the decision of routing is closely related with the spectrum sensing and sharing operations in the lower layers. An efficient opportunistic cognitive routing (OCR) scheme is proposed in which the forwarding decision at each hop is made by jointly considering physical characteristics of spectrum bands and diverse activities of PUs in each single band. Such discussion on spectrum aware routing continues coupled with the sensing selection and contention among multiple relay candidates in a multi-channel multi-hop scenario. An SU selects the next hop relay and the working channel based upon location information and channel usage statistics with instant link quality feedbacks. By evaluating the performance of the routing protocol and the joint channel and route selection algorithm with extensive simulations, we determine the optimal channel and relay combination with reduced searching complexity and improved spectrum utilization. Besides, we investigate the medium access control (MAC) protocol design in support of multimedia applications in CRN. To satisfy the quality of service (QoS) requirements of heterogeneous applications for SUs, such as voice, video, and data, channels are selected to probe for appropriate spectrum opportunities based on the characteristics and QoS demands of the traffic along with the statistics of channel usage patterns. We propose a QoS-aware MAC protocol for multi-channel single hop scenario where each single SU distributedly determines a set of channels for sensing and data transmission to satisfy QoS requirements. By analytical model and simulations, we determine the service differentiation parameters to provision multiple levels of QoS. We further extend our discussion of dynamic resource management to a more practical deployment case. We apply the experiences and skills learnt from cognitive radio study to cellular communications. In heterogeneous cellular networks, small cells are deployed in macrocells to enhance link quality, extend network coverage and offload traffic. As different cells focus on their own operation utilities, the optimization of the total system performance can be analogue to the game between PUs and SUs in CRN. However, there are unique challenges and operation features in such case. We first present challenging issues including interference management, network coordination, and interworking between cells in a tiered cellular infrastructure. We then propose an adaptive resource management framework to improve spectrum utilization and mitigate the co-channel interference between macrocells and small cells. A game-theory-based approach is introduced to handle power control issues under constrained control bandwidth and limited end user capability. The inter-cell interference is mitigated based upon orthogonal transmissions and strict protection for macrocell users. The research results in the dissertation can provide insightful lights on flexible network deployment and dynamic spectrum access for prioritized spectrum reuse in modern wireless systems. The protocols and algorithms developed in each topic, respectively, have shown practical and efficient solutions to build and optimize CRN.

The popularity of ubiquitous Internet services has spurred the fast growth of wireless communications by launching data hungry multimedia applications to mobile devices. Powered by spectrum agile cognitive radios, the newly emerged cognitive radio networks (CRN) are proposed to provision the efficient spectrum reuse to improve spectrum utilization. Unlicensed users in CRN, or secondary users (SUs), access the temporarily idle channels in a secondary and opportunistic fashion while preventing harmful interference to licensed primary users (PUs). To effectively detect and exploit the spectrum access opportunities released from a wide spectrum, the heterogeneous wireless channel characteristics and the underlying prioritized spectrum reuse features need to be considered in the protocol design and resource management schemes in CRN, which plays a critical role in unlicensed spectrum sharing among multiple users. The purpose of this dissertation is to address the challenges of utilizing heterogeneous wireless channels in CRN by its intrinsic dynamic and diverse natures, and build the efficient, scalable and, more importantly, practical dynamic spectrum access mechanisms to enable the cost-effective transmissions for unlicensed users. Note that the spectrum access opportunities exhibit the diversity in the time/frequency/space domain, secondary transmission schemes typically follow three design principles including 1) utilizing local free channels within short transmission range, 2) cooperative and opportunistic transmissions, and 3) effectively coordinating transmissions in varying bandwidth. The entire research work in this dissertation casts a systematic view to address these principles in the design of the routing protocols, medium access control (MAC) protocols and radio resource management schemes in CRN. Specifically, as spectrum access opportunities usually have small spatial footprints, SUs only communicate with the nearby nodes in a small area. Thus, multi-hop transmissions in CRN are considered in this dissertation to enable the connections between any unlicensed users in the network. CRN typically consist of intermittent links of varying bandwidth so that the decision of routing is closely related with the spectrum sensing and sharing operations in the lower layers. An efficient opportunistic cognitive routing (OCR) scheme is proposed in which the forwarding decision at each hop is made by jointly considering physical characteristics of spectrum bands and diverse activities of PUs in each single band. Such discussion on spectrum aware routing continues coupled with the sensing selection and contention among multiple relay candidates in a multi-channel multi-hop scenario. An SU selects the next hop relay and the working channel based upon location information and channel usage statistics with instant link quality feedbacks. By evaluating the performance of the routing protocol and the joint channel and route selection algorithm with extensive simulations, we determine the optimal channel and relay combination with reduced searching complexity and improved spectrum utilization. Besides, we investigate the medium access control (MAC) protocol design in support of multimedia applications in CRN. To satisfy the quality of service (QoS) requirements of heterogeneous applications for SUs, such as voice, video, and data, channels are selected to probe for appropriate spectrum opportunities based on the characteristics and QoS demands of the traffic along with the statistics of channel usage patterns. We propose a QoS-aware MAC protocol for multi-channel single hop scenario where each single SU distributedly determines a set of channels for sensing and data transmission to satisfy QoS requirements. By analytical model and simulations, we determine the service differentiation parameters to provision multiple levels of QoS. We further extend our discussion of dynamic resource management to a more practical deployment case. We apply the experiences and skills learnt from cognitive radio study to cellular communications. In heterogeneous cellular networks, small cells are deployed in macrocells to enhance link quality, extend network coverage and offload traffic. As different cells focus on their own operation utilities, the optimization of the total system performance can be analogue to the game between PUs and SUs in CRN. However, there are unique challenges and operation features in such case. We first present challenging issues including interference management, network coordination, and interworking between cells in a tiered cellular infrastructure. We then propose an adaptive resource management framework to improve spectrum utilization and mitigate the co-channel interference between macrocells and small cells. A game-theory-based approach is introduced to handle power control issues under constrained control bandwidth and limited end user capability. The inter-cell interference is mitigated based upon orthogonal transmissions and strict protection for macrocell users. The research results in the dissertation can provide insightful lights on flexible network deployment and dynamic spectrum access for prioritized spectrum reuse in modern wireless systems. The protocols and algorithms developed in each topic, respectively, have shown practical and efficient solutions to build and optimize CRN.

nÃo hà / De modo a suprirem o aumento de trÃfego previsto para os prÃximos anos, os sistemas de comunicaÃÃes mÃveis da prÃxima geraÃÃo contam com tecnologias avanÃadas, como mÃltiplas subportadoras ortogonais e coordenaÃÃo entre pontos de transmissÃo. Os recursos de rÃdio passam a ser organizados em um nÃmero maior de dimensÃes, tornando mais complexas tarefas como a alocaÃÃo de recursos e a avaliaÃÃo de desempenho do enlace. Com base em tÃcnicas de aprendizagem de mÃquinas, foram investigadas novas maneiras de abordar essas tarefas, de modo a realizÃ-las eficientemente. Esta tese traz duas propostas: (i) agrupamento de pontos de transmissÃo e (ii) realizaÃÃo de interface enlace-a-sistema. Na proposta (i), utiliza-se o algoritmo k-mÃdias para identificar os vetores de forÃa do sinal similares, resultando em reduÃÃo na complexidade de cooperaÃÃo. Na proposta (ii), utilizam-se redes neurais artificiais para que o comportamento de simulaÃÃes de enlace possa ser aprendido, resultando em uma interface enlace-a-sistema mais confiÃvel para certas situaÃÃes na regiÃo de borda de cÃlula. Os resultados obtidos em ambas as propostas confirmam a aprendizagem de mÃquinas como abordagem apropriada aos problemas tratados, sendo capaz de conduzir a interpretaÃÃes alternativas e soluÃÃes eficientes. / In order to bear the growth in the traffic volume expected for the coming years, the next generation of mobile communication systems relies on advanced technologies such as multiple orthogonal subcarriers and coordination of multiple transmission points. The radio resources are organized in a higher number of dimensions, making resource allocation and assessment of link-level performance more complex tasks. Based on techniques from machine learning, we investigated novel ways of addressing these tasks in order to perform them efficiently. This thesis provides two proposals: (i) clustering of transmission points and (ii) design of a link-to-system interface. In proposal (i), the k-means algorithm is used to identify the strength signal vectors that are similar to each other, leading to a decrease on the cooperation complexity. In proposal (ii), we make use of artificial neural networks to learn the behavior of link-level simulations, resulting in a link-to-system interface more reliable for certain situations on the cell-edge region. The results obtained in both proposals confirm machine learning as an appropriate approach to the problems addressed, being able to lead to alternative interpretations and efficient solutions.

With the advancement in the current wireless technology standards such as terrestrial digital video broadcasting systems (DVB-T, DVB-T2, and DVB-H) and the massive usage of the Internet over mobile devices, streaming of television channels in smart phones has become a necessary advancement for mobile users. As, UMTS dominating the entire mobile market globally and with the evolution of LTE, several mobile operators are working on an MBMS framework which will help to launch mobile TV services on respective operators. This paper deals with terrestrial and mobile TV with IP multicasting and broadcasting and is aimed to improve system spectral efficiency.  With the help of IP multicasting, the base station can be able to provide with significantly less spectrum by saving it from the channels which the user is not viewing currently. This case is analysed from several sets, called schemes of resource plan sets. The transmitter scheduling is dealt with by means of a Packet and Resource Plan Scheduling (PARPS) algorithm, and the simulated results are plotted in Matlab which assists in analysing the efficiency in the spectrum management and the coverage probability for the number of transmitters used for each scheme. The schemes are simulated in Matlab for different number of transmitters (2-7) in both the static and random model. The SFN schemes are offering greater coverage probability than MFN schemes, in all cases. Multicasting over Continuous Transmission Dynamic Single Frequency Network (CT-DSFN) offers a 1342% and 582% gain in Multi-user System Spectral Efficiency (MSSE) for 7 transmitters, from Broadcasting over MFN and Broadcasting over SFN respectively.  For 7 transmitters, Multicasting over CT-DSFN offers a 1213% and 428% gain in System Spectral Efficiency (SSE) from Broadcasting over MFN and Broadcasting over SFN respectively.

Abstract The application of optimization techniques for resource management in wireless communication networks is considered in this thesis. It is understood that a wide variety of resource management problems of recent interest, including power/rate control, link scheduling, cross-layer control, network utility maximization, beamformer design of multiple-input multiple-output networks, and many others are directly or indirectly reliant on the general weighted sum-rate maximization (WSRMax) problem. Thus, in this dissertation a greater emphasis is placed on the WSRMax problem, which is known to be NP-hard. A general method, based on the branch and bound technique, is developed, which solves globally the nonconvex WSRMax problem with an optimality certificate. Efficient analytic bounding techniques are derived as well. More broadly, the proposed method is not restricted to WSRMax. It can also be used to maximize any system performance metric, which is Lipschitz continuous and increasing on signal-to-interference-plus-noise ratio. The method can be used to find the optimum performance of any network design method, which relies on WSRMax, and therefore it is also useful for evaluating the performance loss encountered by any heuristic algorithm. The considered link-interference model is general enough to accommodate a wide range of network topologies with various node capabilities, such as singlepacket transmission, multipacket transmission, simultaneous transmission and reception, and many others. Since global methods become slow in large-scale problems, fast local optimization methods for the WSRMax problem are also developed. First, a general multicommodity, multichannel wireless multihop network where all receivers perform singleuser detection is considered. Algorithms based on homotopy methods and complementary geometric programming are developed for WSRMax. They are able to exploit efficiently the available multichannel diversity. The proposed algorithm, based on homotopy methods, handles efficiently the self interference problem that arises when a node transmits and receives simultaneously in the same frequency band. This is very important, since the use of supplementary combinatorial constraints to prevent simultaneous transmissions and receptions of any node is circumvented. In addition, the algorithm together with the considered interference model, provide a mechanism for evaluating the gains when the network nodes employ self interference cancelation techniques with different degrees of accuracy. Next, a similar multicommodity wireless multihop network is considered, but all receivers perform multiuser detection. Solutions for the WSRMax problem are obtained by imposing additional constraints, such as that only one node can transmit to others at a time or that only one node can receive from others at a time. The WSRMax problem of downlink OFDMA systems is also considered. A fast algorithm based on primal decomposition techniques is developed to jointly optimize the multiuser subcarrier assignment and power allocation to maximize the weighted sum-rate (WSR). Numerical results show that the proposed algorithm converges faster than Lagrange relaxation based methods. Finally, a distributed algorithm for WSRMax is derived in multiple-input single-output multicell downlink systems. The proposed method is based on classical primal decomposition methods and subgradient methods. It does not rely on zero forcing beamforming or high signal-to-interference-plus-noise ratio approximation like many other distributed variants. The algorithm essentially involves coordinating many local subproblems (one for each base station) to resolve the inter-cell interference such that the WSR is maximized. The numerical results show that significant gains can be achieved by only a small amount of message passing between the coordinating base stations, though the global optimality of the solution cannot be guaranteed. / Tiivistelmä Tässä työssä tutkitaan optimointimenetelmien käyttöä resurssienhallintaan langattomissa tiedonsiirtoverkoissa. Monet ajankohtaiset resurssienhallintaongelmat, kuten esimerkiksi tehonsäätö, datanopeuden säätö, radiolinkkien ajastus, protokollakerrosten välinen optimointi, verkon hyötyfunktion maksimointi ja keilanmuodostus moniantenniverkoissa, liittyvät joko suoraan tai epäsuorasti painotetun summadatanopeuden maksimointiongelmaan (weighted sum-rate maximization, WSRMax). Tästä syystä tämä työ keskittyy erityisesti WSRMax-ongelmaan, joka on tunnetusti NP-kova. Työssä kehitetään yleinen branch and bound -tekniikkaan perustuva menetelmä, joka ratkaisee epäkonveksin WSRMax-ongelman globaalisti ja tuottaa todistuksen ratkaisun optimaalisuudesta. Työssä johdetaan myös tehokkaita analyyttisiä suorituskykyrajojen laskentatekniikoita. Ehdotetun menetelmän käyttö ei rajoitu vain WSRMax-ongelmaan, vaan sitä voidaan soveltaa minkä tahansa suorituskykymetriikan maksimointiin, kunhan se on Lipschitz-jatkuva ja kasvava signaali-häiriö-plus-kohinasuhteen funktiona. Menetelmää voidaan käyttää minkä tahansa WSRMax-ongelmaan perustuvan verkkosuunnittelumenetelmän optimaalisen suorituskyvyn määrittämiseen, ja siksi sitä voidaan hyödyntää myös minkä tahansa heuristisen algoritmin aiheuttaman suorituskykytappion arvioimiseen. Tutkittava linkki-häiriömalli on riittävän yleinen monien erilaisten verkkotopologioiden ja verkkosolmujen kyvykkyyksien mallintamiseen, kuten esimerkiksi yhden tai useamman datapaketin siirtoon sekä yhtäaikaiseen lähetykseen ja vastaanottoon. Koska globaalit menetelmät ovat hitaita suurien ongelmien ratkaisussa, työssä kehitetään WSRMax-ongelmalle myös nopeita paikallisia optimointimenetelmiä. Ensiksi käsitellään yleistä useaa eri yhteyspalvelua tukevaa monikanavaista langatonta monihyppyverkkoa, jossa kaikki vastaanottimet suorittavat yhden käyttäjän ilmaisun, ja kehitetään algoritmeja, joiden perustana ovat homotopiamenetelmät ja komplementaarinen geometrinen optimointi. Ne hyödyntävät tehokkaasti saatavilla olevan monikanavadiversiteetin. Esitetty homotopiamenetelmiin perustuva algoritmi käsittelee tehokkaasti itsehäiriöongelman, joka syntyy, kun laite lähettää ja vastaanottaa samanaikaisesti samalla taajuuskaistalla. Tämä on tärkeää, koska näin voidaan välttää lisäehtojen käyttö yhtäaikaisen lähetyksen ja vastaanoton estämiseksi. Lisäksi algoritmi yhdessä tutkittavan häiriömallin kanssa auttaa arvioimaan, paljonko etua saadaan, kun laitteet käyttävät itsehäiriön poistomenetelmiä erilaisilla tarkkuuksilla. Seuraavaksi tutkitaan vastaavaa langatonta monihyppyverkkoa, jossa kaikki vastaanottimet suorittavat monen käyttäjän ilmaisun. Ratkaisuja WSRMax-ongelmalle saadaan asettamalla lisäehtoja, kuten että vain yksi lähetin kerrallaan voi lähettää tai että vain yksi vastaanotin kerrallaan voi vastaanottaa. Edelleen tutkitaan WSRMax-ongelmaa laskevalla siirtotiellä OFDMA-järjestelmässä, ja johdetaan primaalihajotelmaan perustuva nopea algoritmi, joka yhteisoptimoi monen käyttäjän alikantoaalto- ja tehoallokaation maksimoiden painotetun summadatanopeuden. Numeeriset tulokset osoittavat, että esitetty algoritmi suppenee nopeammin kuin Lagrangen relaksaatioon perustuvat menetelmät. Lopuksi johdetaan hajautettu algoritmi WSRMax-ongelmalle monisoluisissa moniantennilähetystä käyttävissä järjestelmissä laskevaa siirtotietä varten. Esitetty menetelmä perustuu klassisiin primaalihajotelma- ja aligradienttimenetelmiin. Se ei turvaudu nollaanpakotus-keilanmuodostukseen tai korkean signaali-häiriö-plus-kohinasuhteen approksimaatioon, kuten monet muut hajautetut muunnelmat. Algoritmi koordinoi monta paikallista aliongelmaa (yhden kutakin tukiasemaa kohti) ratkaistakseen solujen välisen häiriön siten, että WSR maksimoituu. Numeeriset tulokset osoittavat, että merkittävää etua saadaan jo vähäisellä yhdessä toimivien tukiasemien välisellä viestinvaihdolla, vaikka globaalisti optimaalista ratkaisua ei voidakaan taata.

Abstract Radio resource management techniques for broadband wireless systems beyond the existing cellular systems are developed while considering their special characteristics such as multi-carrier techniques, adaptive radio links and multiple-input multiple-output (MIMO) antenna techniques. Special focus is put on the design of linear transmission strategies in a cooperative cellular system where signal processing can be performed in a centralised manner across distributed base station (BS) antenna heads. A time-division duplex cellular system based on orthogonal frequency division multiplexing (OFDM) with adaptive MIMO transmission is considered in the case where the received signals are corrupted by non-reciprocal inter-cell interference. A bandwidth efficient closed-loop compensation algorithm combined with interference suppression at the receiver is proposed to compensate for the interference and to guarantee the desired Quality of Service (QoS) when the interference structure is known solely at the receiver. A greedy beam ordering and selection algorithm is proposed to maximise the sum rate of a multiuser MIMO downlink (DL) with a block zero forcing (ZF) transmission. The performance of the block-ZF transmission combined with the greedy scheduling is shown to approach the sum capacity as the number of users increases. The maximum sum rate is often found to be achieved by transmitting to a smaller number of users or beams than the spatial dimensions allow. In addition, a low complexity algorithm for joint user, bit and power allocation with a low signalling overhead is proposed. Different linear transmission schemes, including the ZF as a special case, are developed for the scenario where the cooperative processing of the transmitted signal is applied to users located within a soft handover (SHO) region. The considered optimisation criteria include minimum power beamformer design; balancing the weighted signal-to-interference-plus-noise ratio (SINR) values per data stream; weighted sum rate maximisation; and balancing the weighted rate per user with additional QoS constraints such as guaranteed bit rate per user. The method can accommodate supplementary constraints, e.g., per antenna or per BS power constraints, and upper/lower bounds for the SINR values of the data streams. The proposed iterative algorithms are shown to provide powerful solutions for difficult non-convex transceiver optimisation problems. System level evaluation is performed in order to assess the impact of a realistic multi-cell environment on the performance of a cellular MIMO-OFDM system. The users located in the SHO region are shown to benefit from greatly increased transmission rates. Consequently, significant overall system level gains result from cooperative SHO processing. The proposed SHO scheme can be used for providing a more evenly distributed service over the entire cellular network.