Multi-cell Coordination Techniques for DL OFDMA Multi-hop Cellular Networks

The main objective of this project is to design coordinated spectrum sharing and reuse techniques among cells with the goal of mitigating interference at the cell edge and enhance the overall system capacity. The performance of the developed algorithm will be evaluated in an 802.16m (WiMAX) environment. In conventional cellular networks, frequency planning is usually considered to keep an acceptable signal-to-interference-plus noise ratio (SINR) level, especially at cell boundaries. Frequency assignations are done under a cell-by-cell basis, without any coordination between them to manage interference. Particularly this approach, however, hampers the system spectral efficiency at low reuse rates. For a specific reuse factor, the system throughput depends highly on the mobile station (MS) distribution and the channel conditions of the users to be served. If users served from different base stations (BS) experience a low level of interference, radio resources may be reused, applying a high reuse factor and thus, increasing the system spectral efficiency. On the other side, if the served users experience large interference, orthogonal transmissions are better and therefore a lower frequency reuse factor should be used. As a consequence, a dynamic reuse factor is preferable over a fixed one. This work addresses the design of joint multi-cell resource allocation and scheduling with coordination among neighbouring base stations (outer coordination) or sectors belonging to the same one (inner coordination) as a way to achieve flexible reuse factors. We propose a convex optimization framework to address the problem of coordinating bandwidth allocation in BS coordination problems. The proposed framework allows for different scheduling policies, which have an impact on the suitability of the reuse factor, since they determine which users have to be served. Therefore, it makes sense to consider the reuse factor as a result of the scheduling decision. To support the proposed techniques the BSs shall be capable of exchanging information with each other (decentralized approach) or with some control element in the back-haul network as an ASN gateway or some self-organization control entity (centralized approach)

Adaptive relay techniques for OFDM-based cooperative communication systems

Cooperative communication has been considered as a cost-effective manner to exploit the spatial diversity, improve the quality-of-service and extend transmission coverage. However, there are many challenges faced by cooperative systems which use relays to forward signals to the destination, such as the accumulation of multipath channels, complex resource allocation with the bidirectional asymmetric traffic and reduction of transmission efficiency caused by additional relay overhead. In this thesis, we aim to address the above challenges of cooperative communications, and design the efficient relay systems. Starting with the channel accumulation problem in the amplify-and-forward relay system, we proposed two adaptive schemes for single/multiple-relay networks respectively. These schemes exploit an adaptive guard interval (GI) technique to cover the accumulated delay spread and enhance the transmission efficiency by limiting the overhead. The proposed GI scheme can be implemented without any extra control signal. Extending the adaptive GI scheme to multiple-relay systems, we propose a relay selection strategy which achieves the trade-off between the transmission reliability and overhead by considering both the channel gain and the accumulated delay spread. We then consider resource allocation problem in the two-way decode-and-forward relay system with asymmetric traffic loads. Two allocation algorithms are respectively investigated for time-division and frequency-division relay systems to maximize the end-to-end capacity of the two-way system under a capacity ratio constraint. For the frequency-division systems, a balanced end-to-end capacity is defined as the objective function which combines the requirements of maximizing the end-to-end capacity and achieving the capacity ratio. A suboptimal algorithm is proposed for the frequency-division systems which separates subcarrier allocation and time/power allocation. It can achieve the similar performance with the optimal one with reduced complexity. In order to further enhance the transmission reliability and maintaining low processing delay, we propose an equalize-and-forward (EF) relay scheme. The EF relay equalizes the channel between source and relay to eliminate the channel accumulation without signal regeneration. To reduce the processing time, an efficient parallel structure is applied in the EF relay. Numerical results show that the EF relay exhibits low outage probability at the same data rate as compared to AF and DF schemes

Receiver Design and Security for Low Power Wireless Communications Systems

This dissertation focuses on two important areas in wireless communications: receiver design and security. In the first part of this dissertation we consider low data rate receiver design for ultra-wideband (UWB), a wideband radio technology that promises to help solve the frequency allocation problem that often inhibits narrowband systems. Reference-based receivers are promising candidates in the UWB regime, because the conventional rake receiver designs suffers from complexity limitations and inaccuracies in channel estimation. Many reference-based systems have arisen as viable solutions for receivers. We unify these systems as well as other systems into the general framework for performance analysis to suggest the optimal system for varying constraints. We improve the performance of frequency-shifted reference (FSR-UWB) for an average power constraint by halving the frequency offset and employing a sample-and-hold approach across the frame period. Also, we introduce a novel peak mitigation technique; tone reservation, for the multi-differential (MD) version of FSR-UWB, to reduce the high peak-to-average power ratio observed as the data carriers increase. The next part of this dissertation is about wireless security which is ubiquitous in modern news. Cryptography is widely use for security but it assumes limited computational abilities of an eavesdropper, is based on the unproven hardness of the underlying primitives, and allows for the message to be recorded and decrypted later. In this dissertation we consider an information-theoretic security approach to guaranteeing everlasting secrecy. We contribute a new secrecy rate pair outage formulation, where an outage event is based on the instantaneous rates of the destination and the eavesdropper being below and above desired thresholds, respectively. In our new secrecy rate pair outage formulation, two new unaccounted outage events emerge: secrecy breach, where the eavesdropper is above the targeted threshold; unreliable, where the destination is unable to successfully decode the message. The former case must be carefully avoided, while for the latter case we can exploit automatic retransmissions (ARQ) while maintaining the eavesdropper intercept probability below the target threshold. We look at both ``simple\u27\u27 receivers and also complex receivers that use a buffer to store previous messages to maximally combine signal-to-noise ratio (SNR). Then we extend these results to the two-hop case where we maximize the end-to-end secure throughput by optimizing the intercept probability at each eavesdropper given a total end-to-end intercept constraint. Lastly, we consider the difficult case in information-theoretic security: the near eavesdropper case, where we contribute an optimal power allocation algorithm that leverages nearby chatter nodes to generate noise to reduce the probability of intercept by the eavesdropper while minimally impeding the source-to-destination communication. As shown in both one-hop and two-hop cases, allowing a slight outage at the destination for cases of when the eavesdropper is above a specific threshold greatly improves secrecy performance

Outage Performance of Two-Hop OFDM Systems with Spatially Random Decode-and-Forward Relays

In this paper, we analyze the outage performance of different multicarrier relay selection schemes for two-hop orthogonal frequency-division multiplexing (OFDM) systems in a Poisson field of relays. In particular, special emphasis is placed on decode-and-forward (DF) relay systems, equipped with bulk and per-subcarrier selection schemes, respectively. The exact expressions for outage probability are derived in integrals for general cases. In addition, asymptotic expressions for outage probability in the high signal-to-noise ratio (SNR) region in the finite circle relay distribution region are determined in closed forms for both relay selection schemes. Also, the outage probabilities for free space in the infinite relay distribution region are derived in closed forms. Meanwhile, a series of important properties related to cooperative systems in random networks are investigated, including diversity, outage probability ratio of two selection schemes and optimization of the number of subcarriers in terms of system throughput. All analysis is numerically verified by simulations. Finally, a framework for analyzing the outage performance of OFDM systems with spatially random relays is constructed, which can be easily modified to analyze other similar cases with different forwarding protocols, location distributions and/or channel conditions

Multi-cell Coordination Techniques for DL OFDMA Multi-hop Cellular Networks

The main objective of this project is to design coordinated spectrum sharing and reuse techniques among cells with the goal of mitigating interference at the cell edge and enhance the overall system capacity. The performance of the developed algorithm will be evaluated in an 802.16m (WiMAX) environment. In conventional cellular networks, frequency planning is usually considered to keep an acceptable signal-to-interference-plus noise ratio (SINR) level, especially at cell boundaries. Frequency assignations are done under a cell-by-cell basis, without any coordination between them to manage interference. Particularly this approach, however, hampers the system spectral efficiency at low reuse rates. For a specific reuse factor, the system throughput depends highly on the mobile station (MS) distribution and the channel conditions of the users to be served. If users served from different base stations (BS) experience a low level of interference, radio resources may be reused, applying a high reuse factor and thus, increasing the system spectral efficiency. On the other side, if the served users experience large interference, orthogonal transmissions are better and therefore a lower frequency reuse factor should be used. As a consequence, a dynamic reuse factor is preferable over a fixed one. This work addresses the design of joint multi-cell resource allocation and scheduling with coordination among neighbouring base stations (outer coordination) or sectors belonging to the same one (inner coordination) as a way to achieve flexible reuse factors. We propose a convex optimization framework to address the problem of coordinating bandwidth allocation in BS coordination problems. The proposed framework allows for different scheduling policies, which have an impact on the suitability of the reuse factor, since they determine which users have to be served. Therefore, it makes sense to consider the reuse factor as a result of the scheduling decision. To support the proposed techniques the BSs shall be capable of exchanging information with each other (decentralized approach) or with some control element in the back-haul network as an ASN gateway or some self-organization control entity (centralized approach)

Physical layer authentication for wireless communications

指導教員：姜　暁

Resource Management in Multicarrier Based Cognitive Radio Systems

The ever-increasing growth of the wireless application and services affirms the importance of the effective usage of the limited radio spectrum. Existing spectrum management policies have led to significant spectrum under-utilization. Recent measurements showed that large range of the spectrum is sparsely used in both temporal and spatial manner. This conflict between the inefficient usage of the spectrum and the continuous evolution in the wireless communication calls upon the development of more flexible management policies. Cognitive radio (CR) with the dynamic spectrum access (DSA) is considered to be a key technology in making the best solution of this conflict by allowing a group of secondary users (SUs) to share the radio spectrum originally allocated to the primary user (PUs). The operation of CR should not negatively alter the performance of the PUs. Therefore, the interference control along with the highly dynamic nature of PUs activities open up new resource allocation problems in CR systems. The resource allocation algorithms should ensure an effective share of the temporarily available frequency bands and deliver the solutions in timely fashion to cope with quick changes in the network. In this dissertation, the resource management problem in multicarrier based CR systems is considered. The dissertation focuses on three main issues: 1) design of efficient resource allocation algorithms to allocate subcarriers and powers between SUs such that no harmful interference is introduced to PUs, 2) compare the spectral efficiency of using different multicarrier schemes in the CR physical layer, specifically, orthogonal frequency division multiplexing (OFDM) and filter bank multicarrier (FBMC) schemes, 3) investigate the impact of the different constraints values on the overall performance of the CR system. Three different scenarios are considered in this dissertation, namely downlink transmission, uplink transmission, and relayed transmission. For every scenario, the optimal solution is examined and efficient sub-optimal algorithms are proposed to reduce the computational burden of obtaining the optimal solution. The suboptimal algorithms are developed by separate the subcarrier and power allocation into two steps in downlink and uplink scenarios. In the relayed scenario, dual decomposition technique is used to obtain an asymptotically optimal solution, and a joint heuristic algorithm is proposed to find the suboptimal solution. Numerical simulations show that the proposed suboptimal algorithms achieve a near optimal performance and perform better than the existing algorithms designed for cognitive and non-cognitive systems. Eventually, the ability of FBMC to overcome the OFDM drawbacks and achieve more spectral efficiency is verified which recommends the consideration of FBMC in the future CR systems.El crecimiento continuo de las aplicaciones y servicios en sistemas inal´ambricos, indica la importancia y necesidad de una utilizaci´on eficaz del espectro radio. Las pol´ıticas actuales de gesti´on del espectro han conducido a una infrautilizaci´on del propio espectro radioel´ectrico. Recientes mediciones en diferentes entornos han mostrado que gran parte del espectro queda poco utilizado en sus ambas vertientes, la temporal, y la espacial. El permanente conflicto entre el uso ineficiente del espectro y la evoluci´on continua de los sistemas de comunicaci´on inal´ambrica, hace que sea urgente y necesario el desarrollo de esquemas de gesti´on del espectro m´as flexibles. Se considera el acceso din´amico (DSA) al espectro en los sistemas cognitivos como una tecnolog´ıa clave para resolver este conflicto al permitir que un grupo de usuarios secundarios (SUs) puedan compartir y acceder al espectro asignado inicialmente a uno o varios usuarios primarios (PUs). Las operaciones de comunicaci´on llevadas a cabo por los sistemas radio cognitivos no deben en ning´un caso alterar (interferir) los sistemas primarios. Por tanto, el control de la interferencia junto al gran dinamismo de los sistemas primarios implica nuevos retos en el control y asignaci´on de los recursos radio en los sistemas de comunicaci´on CR. Los algoritmos de gesti´on y asignaci´on de recursos (Radio Resource Management-RRM) deben garantizar una participaci´on efectiva de las bandas con frecuencias disponibles temporalmente, y ofrecer en cada momento oportunas soluciones para hacer frente a los distintos cambios r´apidos que influyen en la misma red. En esta tesis doctoral, se analiza el problema de la gesti´on de los recursos radio en sistemas multiportadoras CR, proponiendo varias soluciones para su uso eficaz y coexistencia con los PUs. La tesis en s´ı, se centra en tres l´ıneas principales: 1) el dise˜no de algoritmos eficientes de gesti´on de recursos para la asignaci´on de sub-portadoras y distribuci´on de la potencia en sistemas segundarios, evitando asi cualquier interferencia que pueda ser perjudicial para el funcionamiento normal de los usuarios de la red primaria, 2) analizar y comparar la eficiencia espectral alcanzada a la hora de utilizar diferentes esquema de transmisi´on multiportadora en la capa f´ısica del sistema CR, espec´ıficamente en sistemas basados en OFDM y los basados en banco de filtros multiportadoras (Filter bank Multicarrier-FBMC), 3) investigar el impacto de las diferentes limitaciones en el rendimiento total del sistema de CR. Los escenarios considerados en esta tesis son tres, es decir; modo de transmisi´on descendente (downlink), modo de transmisi´on ascendente (uplink), y el modo de transmisi´on ”Relay”. En cada escenario, la soluci´on ´optima es examinada y comparada con algoritmos sub- ´optimos que tienen como objetivo principal reducir la carga computacional. Los algoritmos sub-´optimos son llevados a cabo en dos fases mediante la separaci´on del propio proceso de distribuci´on de subportadoras y la asignaci´on de la potencia en los modos de comunicaci´on descendente (downlink), y ascendente (uplink). Para los entornos de tipo ”Relay”, se ha utilizado la t´ecnica de doble descomposici´on (dual decomposition) para obtener una soluci´on asint´oticamente ´optima. Adem´as, se ha desarrollado un algoritmo heur´ıstico para poder obtener la soluci´on ´optima con un reducido coste computacional. Los resultados obtenidos mediante simulaciones num´ericas muestran que los algoritmos sub-´optimos desarrollados logran acercarse a la soluci´on ´optima en cada uno de los entornos analizados, logrando as´ı un mayor rendimiento que los ya existentes y utilizados tanto en entornos cognitivos como no-cognitivos. Se puede comprobar en varios resultados obtenidos en la tesis la superioridad del esquema multiportadora FBMC sobre los sistemas basados en OFDM para los entornos cognitivos, causando una menor interferencia que el OFDM en los sistemas primarios, y logrando una mayor eficiencia espectral. Finalmente, en base a lo analizado en esta tesis, podemos recomendar al esquema multiportadora FBMC como una id´onea y potente forma de comunicaci´on para las futuras redes cognitivas