Practical Secrecy at the Physical Layer: Key Extraction Methods with Applications in Cognitive Radio

The broadcast nature of wireless communication imposes the risk of information leakage to adversarial or unauthorized receivers. Therefore, information security between intended users remains a challenging issue. Currently, wireless security relies on cryptographic techniques and protocols that lie at the upper layers of the wireless network. One main drawback of these existing techniques is the necessity of a complex key management scheme in the case of symmetric ciphers and high computational complexity in the case of asymmetric ciphers. On the other hand, physical layer security has attracted significant interest from the research community due to its potential to generate information-theoretic secure keys. In addition, since the vast majority of physical layer security techniques exploit the inherent randomness of the communication channel, key exchange is no longer mandatory. However, additive white Gaussian noise, interference, channel estimation errors and the fact that communicating transceivers employ different radio frequency (RF) chains are among the reasons that limit utilization of secret key generation (SKG) algorithms to high signal to noise ratio levels. The scope of this dissertation is to design novel secret key generation algorithms to overcome this main drawback. In particular, we design a channel based SKG algorithm that increases the dynamic range of the key generation system. In addition, we design an algorithm that exploits angle of arrival (AoA) as a common source of randomness to generate the secret key. Existing AoA estimation systems either have high hardware and computation complexities or low performance, which hinder their incorporation within the context of SKG. To overcome this challenge, we design a novel high performance yet simple and efficient AoA estimation system that fits the objective of collecting sequences of AoAs for SKG. Cognitive radio networks (CRNs) are designed to increase spectrum usage efficiency by allowing secondary users (SUs) to exploit spectrum slots that are unused by the spectrum owners, i.e., primary users (PUs). Hence, spectrum sensing (SS) is essential in any CRN. CRNs can work both in opportunistic (interweaved) as well as overlay and/or underlay (limited interference) fashions. CRNs typically operate at low SNR levels, particularly, to support overlay/underlay operations. Similar to other wireless networks, CRNs are susceptible to various physical layer security attacks including spectrum sensing data falsification and eavesdropping. In addition to the generalized SKG methods provided in this thesis and due to the peculiarity of CRNs, we further provide a specific method of SKG for CRNs. After studying, developing and implementing several SS techniques, we design an SKG algorithm that exploits SS data. Our algorithm does not interrupt the SS operation and does not require additional time to generate the secret key. Therefore, it is suitable for CRNs

Throughput analysis of full-duplex communication cognitive radio network

In this paper we deal with the throughput of full-duplex cognitive communication radio which exploits unused band of primary user (PU) network. Classical cognitive radio uses half-duplex communication spectrum sensing to perform spectrum sensing and data transmission at different time intervals. It’s well-established fact that in half-duplex communication cognitive radio spectrum sensing time increases at low SNR which gives rise to lesser data transmission time for secondary user (SU) and hence results in less throughput for SU. It’s useful idea to do spectrum sensing and data transmission at the same time with two different antennas co-located on the SU transceiver. This shall not only guarantee high probability of detection of PU but also increased data transmission which means more throughput for SU. However, simultaneous sensing and data transmission has inherent problem of self-interference. One of the possible solution is to use polarisation discrimination in which sensing and data transmission antennas must use different polarisation. This is feasible if there is prior information about the polarisation of the signals emitted by the PUs. It shall be of special interest to assess throughput using analytical expressions for probability of detection PD, probability of false alarm PFA at various values of SNR for time-slotted cognitive radio which uses half-duplex spectrum sensing and non-time-slotted cognitive radio which uses full-duplex communication cognitive radio

Modified isotropic orthogonal transform algorithm-universal filtered multicarrier transceiver for 5G cognitive radio application

Rapid developments in modern wireless communication permit the trade of spectrum scarcity.  Higher data rate and wider bandwidth emerge the development in growing demand of wireless communication system. The innovative solution for the spectrum scarcity is cognitive radio (CR). Cognitive radio is the significant technology used to utilize the spectrum effectively. The important aspect of CR is sensing the spectrum band and detects the presence or absence of the primary user in the licensed band. Moreover, another serious issue in next generation (5G) wireless communication is to decide the less complex 5G waveform candidate for achieving higher data rate, low latency and better spectral efficiency. Universal filtered multi-carrier (UFMC) is one of the noticeable waveform candidates for 5G and its applications. In this article, we investigate the spectrum sensing methods in multi-carrier transmission for cognitive radio network applications. Especially, we integrate the sensing algorithm into UFMC transceiver to analyze the spectral efficiency, higher data rates and system complexity. Through the simulation results, we prove that the UFMC based cognitive radio applications outperform the existing Orthogonal Frequency Division Multiplexing (OFDM) based CR applications

On the Performance of Quickest Detection Spectrum Sensing: The Case of Cumulative Sum

Quickest change detection (QCD) is a fundamental problem in many applications. Given a sequence of measurements that exhibits two different distributions around a certain flipping point, the goal is to detect the change in distribution around the flipping point as quickly as possible. The QCD problem appears in many practical applications, e.g., quality control, power system line outage detection, spectrum reuse, and resource allocation and scheduling. In this paper, we focus on spectrum sensing as our application since it is a critical process for proper functionality of cognitive radio networks. Relying on the cumulative sum (CUSUM), we derive the probability of detection and the probability of false alarm of CUSUM based spectrum sensing. We show the correctness of our derivations using numerical simulations.Comment: This paper is accepted for publication in IEEE Communication Letters Jan 202

A Unified Multi-Functional Dynamic Spectrum Access Framework: Tutorial, Theory and Multi-GHz Wideband Testbed

Dynamic spectrum access is a must-have ingredient for future sensors that are ideally cognitive. The goal of this paper is a tutorial treatment of wideband cognitive radio and radar—a convergence of (1) algorithms survey, (2) hardware platforms survey, (3) challenges for multi-function (radar/communications) multi-GHz front end, (4) compressed sensing for multi-GHz waveforms—revolutionary A/D, (5) machine learning for cognitive radio/radar, (6) quickest detection, and (7) overlay/underlay cognitive radio waveforms. One focus of this paper is to address the multi-GHz front end, which is the challenge for the next-generation cognitive sensors. The unifying theme of this paper is to spell out the convergence for cognitive radio, radar, and anti-jamming. Moore’s law drives the system functions into digital parts. From a system viewpoint, this paper gives the first comprehensive treatment for the functions and the challenges of this multi-function (wideband) system. This paper brings together the inter-disciplinary knowledge

Recent Trends in Communication Networks

In recent years there has been many developments in communication technology. This has greatly enhanced the computing power of small handheld resource-constrained mobile devices. Different generations of communication technology have evolved. This had led to new research for communication of large volumes of data in different transmission media and the design of different communication protocols. Another direction of research concerns the secure and error-free communication between the sender and receiver despite the risk of the presence of an eavesdropper. For the communication requirement of a huge amount of multimedia streaming data, a lot of research has been carried out in the design of proper overlay networks. The book addresses new research techniques that have evolved to handle these challenges

Opportunistic communications in large uncoordinated networks

(English) The increase of wireless devices offering high data rate services limits the coexistence of wireless systems sharing the same resources in a given geographical area because of inter-system interference. Therefore, interference management plays a key role in permitting the coexistence of several heterogeneous communication services. However, classical interference management strategies require lateral information giving rise to the need for inter-system coordination and cooperation, which is not always practical. Opportunistic communications offer a potential solution to the problem of inter-system interference management. The basic principle of opportunistic communications is to efficiently and robustly exploit the resources available in a wireless network and adapt the transmitted signals to the state of the network to avoid inter-system interference. Therefore, opportunistic communications depend on inferring the available network resources that can be safely exploited without inducing interference in coexisting communication nodes. Once the available network resources are identified, the most prominent opportunistic communication techniques consist in designing scenario-adapted precoding/decoding strategies to exploit the so-called null space. Despite this, classical solutions in the literature suffer from two main drawbacks: the lack of robustness to detection errors and the need for intra-system cooperation. This thesis focuses on the design of a null space-based opportunistic communication scheme that addresses the drawbacks exhibited by existing methodologies under the assumption that opportunistic nodes do not cooperate. For this purpose, a generalized detection error model independent of the null-space identification mechanism is introduced that allows the design of solutions that exhibit minimal inter-system interference in the worst case. These solutions respond to a maximum signal-to-interference ratio (SIR) criterion, which is optimal under non-cooperative conditions. The proposed methodology allows the design of a family of orthonormal waveforms that perform a spreading of the modulated symbols within the detected null space, which is key to minimizing the induced interference density. The proposed solutions are invariant within the inferred null space, allowing the removal of the feedback link without giving up coherent waveform detection. In the absence of coordination, the waveform design relies solely on locally sensed network state information, inducing a mismatch between the null spaces identified by the transmitter and receiver that may worsen system performance. Although the proposed solution is robust to this mismatch, the design of enhanced receivers using active subspace detection schemes is also studied. When the total number of network resources increases arbitrarily, the proposed solutions tend to be linear combinations of complex exponentials, providing an interpretation in the frequency domain. This asymptotic behavior allows us to adapt the proposed solution to frequency-selective channels by means of a cyclic prefix and to study an efficient modulation similar to the time division multiplexing scheme but using circulant waveforms. Finally, the impact of the use of multiple antennas in opportunistic null space-based communications is studied. The performed analysis reveals that, in any case, the structure of the antenna clusters affects the opportunistic communication, since the proposed waveform mimics the behavior of a single-antenna transmitter. On the other hand, the number of sensors employed translates into an improvement in terms of SIR.(Català) El creixement incremental dels dispositius sense fils que requereixen serveis d'alta velocitat de dades limita la coexistència de sistemes sense fils que comparteixen els mateixos recursos en una àrea geogràfica donada a causa de la interferència entre sistemes. Conseqüentment, la gestió d'interferència juga un paper fonamental per a facilitar la coexistència de diversos serveis de comunicació heterogenis. No obstant això, les estratègies clàssiques de gestió d'interferència requereixen informació lateral originant la necessitat de coordinació i cooperació entre sistemes, que no sempre és pràctica. Les comunicacions oportunistes ofereixen una solució potencial al problema de la gestió de les interferències entre sistemes. El principi bàsic de les comunicacions oportunistes és explotar de manera eficient i robusta els recursos disponibles en una xarxa sense fils i adaptar els senyals transmesos a l'estat de la xarxa per evitar interferències entre sistemes. Per tant, les comunicacions oportunistes depenen de la inferència dels recursos de xarxa disponibles que poden ser explotats de manera segura sense induir interferència en els nodes de comunicació coexistents. Una vegada que s'han identificat els recursos de xarxa disponibles, les tècniques de comunicació oportunistes més prominents consisteixen en el disseny d'estratègies de precodificació/descodificació adaptades a l'escenari per explotar l'anomenat espai nul. Malgrat això, les solucions clàssiques en la literatura sofreixen dos inconvenients principals: la falta de robustesa als errors de detecció i la necessitat de cooperació intra-sistema. Aquesta tesi tracta el disseny d'un esquema de comunicació oportunista basat en l'espai nul que afronta els inconvenients exposats per les metodologies existents assumint que els nodes oportunistes no cooperen. Per a aquest propòsit, s'introdueix un model generalitzat d'error de detecció independent del mecanisme d'identificació de l'espai nul que permet el disseny de solucions que exhibeixen interferències mínimes entre sistemes en el cas pitjor. Aquestes solucions responen a un criteri de màxima relació de senyal a interferència (SIR), que és òptim en condicions de no cooperació. La metodologia proposada permet dissenyar una família de formes d'ona ortonormals que realitzen un spreading dels símbols modulats dins de l'espai nul detectat, que és clau per minimitzar la densitat d’interferència induïda. Les solucions proposades són invariants dins de l'espai nul inferit, permetent suprimir l'enllaç de retroalimentació i, tot i així, realitzar una detecció coherent de forma d'ona. Sota l’absència de coordinació, el disseny de la forma d'ona es basa únicament en la informació de l'estat de la xarxa detectada localment, induint un desajust entre els espais nuls identificats pel transmissor i receptor que pot empitjorar el rendiment del sistema. Tot i que la solució proposada és robusta a aquest desajust, també s'estudia el disseny de receptors millorats fent ús de tècniques de detecció de subespai actiu. Quan el nombre total de recursos de xarxa augmenta arbitràriament, les solucions proposades tendeixen a ser combinacions lineals d'exponencials complexes, proporcionant una interpretació en el domini freqüencial. Aquest comportament asimptòtic permet adaptar la solució proposada a entorns selectius en freqüència fent ús d'un prefix cíclic i estudiar una modulació eficient derivada de l'esquema de multiplexat per divisió de temps emprant formes d'ona circulant. Finalment, s’estudia l'impacte de l'ús de múltiples antenes en comunicacions oportunistes basades en l'espai nul. L'anàlisi realitzada permet concloure que, en cap cas, l'estructura de les agrupacions d'antenes tenen un impacte sobre la comunicació oportunista, ja que la forma d'ona proposada imita el comportament d'un transmissor mono-antena. D'altra banda, el nombre de sensors emprat es tradueix en una millora en termes de SIR.(Español) El incremento de los dispositivos inalámbricos que ofrecen servicios de alta velocidad de datos limita la coexistencia de sistemas inalámbricos que comparten los mismos recursos en un área geográfica dada a causa de la interferencia inter-sistema. Por tanto, la gestión de interferencia juega un papel fundamental para facilitar la coexistencia de varios servicios de comunicación heterogéneos. Sin embargo, las estrategias clásicas de gestión de interferencia requieren información lateral originando la necesidad de coordinación y cooperación entre sistemas, que no siempre es práctica. Las comunicaciones oportunistas ofrecen una solución potencial al problema de la gestión de las interferencias entre sistemas. El principio básico de las comunicaciones oportunistas es explotar de manera eficiente y robusta los recursos disponibles en una red inalámbricas y adaptar las señales transmitidas al estado de la red para evitar interferencias entre sistemas. Por lo tanto, las comunicaciones oportunistas dependen de la inferencia de los recursos de red disponibles que pueden ser explotados de manera segura sin inducir interferencia en los nodos de comunicación coexistentes. Una vez identificados los recursos disponibles, las técnicas de comunicación oportunistas más prominentes consisten en el diseño de estrategias de precodificación/descodificación adaptadas al escenario para explotar el llamado espacio nulo. A pesar de esto, las soluciones clásicas en la literatura sufren dos inconvenientes principales: la falta de robustez a los errores de detección y la necesidad de cooperación intra-sistema. Esta tesis propone diseñar un esquema de comunicación oportunista basado en el espacio nulo que afronta los inconvenientes expuestos por las metodologías existentes asumiendo que los nodos oportunistas no cooperan. Para este propósito, se introduce un modelo generalizado de error de detección independiente del mecanismo de identificación del espacio nulo que permite el diseño de soluciones que exhiben interferencias mínimas entre sistemas en el caso peor. Estas soluciones responden a un criterio de máxima relación de señal a interferencia (SIR), que es óptimo en condiciones de no cooperación. La metodología propuesta permite diseñar una familia de formas de onda ortonormales que realizan un spreading de los símbolos modulados dentro del espacio nulo detectado, que es clave para minimizar la densidad de interferencia inducida. Las soluciones propuestas son invariantes dentro del espacio nulo inferido, permitiendo suprimir el enlace de retroalimentación sin renunciar a la detección coherente de forma de onda. En ausencia de coordinación, el diseño de la forma de onda se basa únicamente en la información del estado de la red detectada localmente, induciendo un desajuste entre los espacios nulos identificados por el transmisor y receptor que puede empeorar el rendimiento del sistema. A pesar de que la solución propuesta es robusta a este desajuste, también se estudia el diseño de receptores mejorados usando técnicas de detección de subespacio activo. Cuando el número total de recursos de red aumenta arbitrariamente, las soluciones propuestas tienden a ser combinaciones lineales de exponenciales complejas, proporcionando una interpretación en el dominio frecuencial. Este comportamiento asintótico permite adaptar la solución propuesta a canales selectivos en frecuencia mediante un prefijo cíclico y estudiar una modulación eficiente derivada del esquema de multiplexado por división de tiempo empleando formas de onda circulante. Finalmente, se estudia el impacto del uso de múltiples antenas en comunicaciones oportunistas basadas en el espacio nulo. El análisis realizado revela que la estructura de las agrupaciones de antenas no afecta la comunicación oportunista, ya que la forma de onda propuesta imita el comportamiento de un transmisor mono-antena. Por otro lado, el número de sensores empleado se traduce en una mejora en términos de SIR.Postprint (published version

Design and Analysis of GFDM-Based Wireless Communication Systems

Le multiplexage généralisé par répartition en fréquence (GFDM), une méthode de traitement par blocs de modulation multiporteuses non orthogonales, est une candidate prometteuse pour les technologies de forme d'onde pour les systèmes sans fil au-delà de la cinquième génération (5G). La capacité du GFDM à ajuster de manière flexible la taille du bloc et le type de filtres de mise en forme des impulsions en fait une méthode appropriée pour répondre à plusieurs exigences importantes, comme une faible latence, un faible rayonnement hors bande (OOB) et des débits de données élevés. En appliquant aux systèmes GFDM la technique des systèmes à entrées multiples et sorties multiples (MIMO), la technique de MIMO massif ou des codes de contrôle de parité à faible densité (LDPC), il est possible d'améliorer leurs performances. Par conséquent, l'étude de ces systèmes combinés sont d'une grande importance théorique et pratique. Dans cette thèse, nous étudions les systèmes de communication sans fil basés sur le GFDM en considérant trois aspects. Tout d'abord, nous dérivons une borne d'union sur le taux d'erreur sur les bits (BER) pour les systèmes MIMO-GFDM, technique qui est basée sur des probabilités d'erreur par paires exactes (PEP). La PEP exacte est calculée en utilisant la fonction génératrice de moments(MGF) pour les détecteurs à maximum de vraisemblance (ML). La corrélation spatiale entre les antennes et les erreurs d'estimation de canal sont prises en compte dans l'environnement de canal étudié. Deuxièmement, les estimateurs et les précodeurs de canal de faible complexité basés sur une expansion polynomiale sont proposés pour les systèmes MIMO-GFDM massifs. Des pilotes sans interférence sont utilisés pour l'estimation du canal basée sur l'erreur quadratique moyenne minimale(MMSE) pour lutter contre l'influence de la non-orthogonalité entre les sous-porteuses dans le GFDM. La complexité de calcul cubique peut être réduite à une complexité d'ordre au carré en utilisant la technique d'expansion polynomiale pour approximer les inverses de matrices dans l'estimation MMSE conventionnelle et le précodage. De plus, nous calculons les limites de performance en termes d'erreur quadratique moyenne (MSE) pour les estimateurs proposés, ce qui peut être un outil utile pour prédire la performance des estimateurs dans la région de Eₛ/N₀ élevé. Une borne inférieure de Cramér-Rao(CRLB) est dérivée pour notre modèle de système et agit comme une référence pour les estimateurs. La complexité de calcul des estimateurs de canal proposés et des précodeurs et les impacts du degré du polynôme sont également étudiés. Enfin, nous analysons les performances de la probabilité d'erreur des systèmes GFDM combinés aux codes LDPC. Nous dérivons d'abord les expressions du ratio de vraisemblance logarithmique (LLR) initiale qui sont utilisées dans le décodeur de l'algorithme de somme de produits (SPA). Ensuite, basé sur le seuil de décodage, nous estimons le taux d'erreur de trame (FER) dans la région de bas E[indice b]/N₀ en utilisant le BER observé pour modéliser les variations du canal. De plus, une borne inférieure du FER du système est également proposée basée sur des ensembles absorbants. Cette borne inférieure peut agir comme une estimation du FER dans la région de E[indice b]/N₀ élevé si l'ensemble absorbant utilisé est dominant et que sa multiplicité est connue. La quantification a également un impact important sur les performances du FER et du BER. Des codes LDPC basés sur un tableau et construit aléatoirement sont utilisés pour supporter les analyses de performances. Pour ces trois aspects, des simulations et des calculs informatiques sont effectués pour obtenir des résultats numériques connexes, qui vérifient les méthodes proposées.8 372162\u a Generalized frequency division multiplexing (GFDM) is a block-processing based non-orthogonal multi-carrier modulation scheme, which is a promising candidate waveform technology for beyond fifth-generation (5G) wireless systems. The ability of GFDM to flexibly adjust the block size and the type of pulse-shaping filters makes it a suitable scheme to meet several important requirements, such as low latency, low out-of-band (OOB) radiation and high data rates. Applying the multiple-input multiple-output (MIMO) technique, the massive MIMO technique, or low-density parity-check (LDPC) codes to GFDM systems can further improve the systems performance. Therefore, the investigation of such combined systems is of great theoretical and practical importance. This thesis investigates GFDM-based wireless communication systems from the following three aspects. First, we derive a union bound on the bit error rate (BER) for MIMO-GFDM systems, which is based on exact pairwise error probabilities (PEPs). The exact PEP is calculated using the moment-generating function (MGF) for maximum likelihood (ML) detectors. Both the spatial correlation between antennas and the channel estimation errors are considered in the investigated channel environment. Second, polynomial expansion-based low-complexity channel estimators and precoders are proposed for massive MIMO-GFDM systems. Interference-free pilots are used in the minimum mean square error (MMSE) channel estimation to combat the influence of non-orthogonality between subcarriers in GFDM. The cubic computational complexity can be reduced to square order by using the polynomial expansion technique to approximate the matrix inverses in the conventional MMSE estimation and precoding. In addition, we derive performance limits in terms of the mean square error (MSE) for the proposed estimators, which can be a useful tool to predict estimators performance in the high Eₛ/N₀ region. A Cramér-Rao lower bound (CRLB) is derived for our system model and acts as a benchmark for the estimators. The computational complexity of the proposed channel estimators and precoders, and the impacts of the polynomial degree are also investigated. Finally, we analyze the error probability performance of LDPC coded GFDM systems. We first derive the initial log-likelihood ratio (LLR) expressions that are used in the sum-product algorithm (SPA) decoder. Then, based on the decoding threshold, we estimate the frame error rate (FER) in the low E[subscript b]/N₀ region by using the observed BER to model the channel variations. In addition, a lower bound on the FER of the system is also proposed based on absorbing sets. This lower bound can act as an estimate of the FER in the high E[subscript b]/N₀ region if the absorbing set used is dominant and its multiplicity is known. The quantization scheme also has an important impact on the FER and BER performances. Randomly constructed and array-based LDPC codes are used to support the performance analyses. For all these three aspects, software-based simulations and calculations are carried out to obtain related numerical results, which verify our proposed methods