Cognitive radios are the radios which use spectrum licensed to other users. For this, they perform Radio Environment Analysis, identify the Spectral holes and then operate in those holes. We consider the problem of Spectrum Sensing in Cognitive Radio Networks. Our Algorithms are based on Sequential Change Detection techniques. In this work we have used DualCUSUM, a distributed algorithm developed recently for cooperative spectrum sensing. This is used by cognitive (secondary) nodes to sense the spectrum which then send their local decisions to a fusion center. The fusion center again sequentially processes the received information to arrive at the final decision. We show that DualCUSUM performs better than all other existing spectrum sensing algorithms. We present a generalized analysis of DualCUSUM and compare the analysis with simulations to show its accuracy. DualCUSUM requires the knowledge of the channel gains for each of the secondary users and the receiver noise power. In Cognitive Radio setup it is not realistic to assume that each secondary user will have this knowledge. So later we modify DualCUSUM to develop GLRCUSUM algorithms which can work with imprecise estimates of the channel gains and receiver noise power. We show that the SNR wall problem encountered in this scenario by other detectors is not experienced by our algorithm. We also analyze the GLRCUSUM algorithms theoretically. We also apply our algorithms for detecting the presence of the primary in an Orthogonal Frequency Division Multiplexing (OFDM) setup. We first consider the Cyclic Prefix (CP) detector, which is considered to be robust to uncertainties in noise power, and further modify the CPdetector to take care of some of the common impairments like Timing offset, Frequency offset and IQ imbalance. We further modify the CPdetector to work under frequency selective channel. We also consider the energy detector under different impairments and show that the sequential detection based energy detectors outperform cyclic prefix based Detectors.

In wireless communication systems, one of the most important resources being focused on all the researchers is spectrum. A cognitive radio (CR) system is one of the efficient ways to access the radio spectrum opportunistically, and efficiently use the available underutilized licensed spectrum. Spectrum utilization can be significantly enhanced by developing more applications with adopting CR technology. CR systems are implemented using a radio technology called software-defined radios (SDR). SDR provides a flexible and cost-effective solution to fulfil the requirements of end users. We can see a lot of innovations in Internet of Things (IoT) and increasing number of smart devices. Hence, a CR system application involving an IoT device is studied in this thesis. Opportunistic spectrum access involves two tasks of CR system: spectrum sensing and dynamic spectrum access. The functioning of the CR system is rest upon the spectrum sensing. There are different spectrum sensing techniques used to detect the spectrum holes and a few of them are discussed here in this thesis. The simplest and easiest to implement energy detection spectrum sensing technique is used here to implement the CR system. Dynamic spectrum access involves different models and strategies to access the spectrum. Amongst the available models, an interweave model is more challenging and is used in this thesis. Interweave model needs effective spectrum sensing before accessing the spectrum opportunistically. The system designed and simulated in this thesis is capable of transmitting an output from an IoT device using USRP and GNU radio through accessing the radio spectrum opportunistically.

ITC/USA 2006 Conference Proceedings / The Forty-Second Annual International Telemetering Conference and Technical Exhibition / October 23-26, 2006 / Town and Country Resort & Convention Center, San Diego, California / Spectrum allocation in wireless communication and telemetry systems of the future may be performed in a dynamic and distributed manner, as opposed to static centralized regulations currently in place. This paper surveys a new area of research in the communications field known as cognitive radio which will allow dynamic sharing of spectral bands. An introduction to cognitive radio, a review of existing research results, and discussion of open problems in the area is provided.

We investigate spectral-efficient design and develop novel schemes to improve spectral efficiency of the modern wireless communications networks. Nowadays, more and more spectrum resources are required to support various high-data-rate applications while spectrum resources are limited. Moreover, static allocation and exclusive access in current spectrum assignment policy caused a lot of licensed spectrum bands to be underutilized. To deal with the problem, cognitive radio (CR) has been developed, which allows unlicensed/secondary users to transmit with licensed/primary users as long as the former ones do not generate intolerable interference to the latter ones. The coexistence of users and networks requires careful and dynamic planning to mitigate interference. Otherwise, the network performance will be severely undermined. We study both spectrum sensing and spectrum access techniques and propose several transmit schemes for different types of cognitive ratio networks, including spectrum overlay and spectrum underlay systems. The proposed algorithms can improve spectral efficiency of the networks efficiently and have potentials to be used in future wireless communications networks.

‘Game Theory’ is the formal study of conflict and cooperation. The theory is based on a set of tools that have been developed in order to assist with the modelling and analysis of individual, independent decision makers. These actions potentially affect any decisions, which are made by other competitors. Therefore, it is well suited and capable of addressing the various issues linked to wireless communications. This work presents a Green Game-Based Hybrid Vertical Handover Model. The model is used for heterogeneous wireless networks, which combines both dynamic (Received Signal Strength and Node Mobility) and static (Cost, Power Consumption and Bandwidth) factors. These factors control the handover decision process; whereby the mechanism successfully eliminates any unnecessary handovers, reduces delay and overall number of handovers to 50% less and 70% less dropped packets and saves 50% more energy in comparison to other mechanisms. A novel Game-Based Multi-Interface Fast-Handover MIPv6 protocol is introduced in this thesis as an extension to the Multi-Interface Fast-handover MIPv6 protocol. The protocol works when the mobile node has more than one wireless interface. The protocol controls the handover decision process by deciding whether a handover is necessary and helps the node to choose the right access point at the right time. In addition, the protocol switches the mobile nodes interfaces ‘ON’ and ‘OFF’ when needed to control the mobile node’s energy consumption and eliminate power lost of adding another interface. The protocol successfully reduces the number of handovers to 70%, 90% less dropped packets, 40% more received packets and acknowledgments and 85% less end-to-end delay in comparison to other Protocols. Furthermore, the thesis adapts a novel combination of both game and auction theory in dynamic resource allocation and price-power-based routing in wireless Ad-Hoc networks. Under auction schemes, destinations nodes bid the information data to access to the data stored in the server node. The server will allocate the data to the winner who values it most. Once the data has been allocated to the winner, another mechanism for dynamic routing is adopted. The routing mechanism is based on the source-destination cooperation, power consumption and source-compensation to the intermediate nodes. The mechanism dramatically increases the seller’s revenue to 50% more when compared to random allocation scheme and briefly evaluates the reliability of predefined route with respect to data prices, source and destination cooperation for different network settings. Last but not least, this thesis adjusts an adaptive competitive second-price pay-to-bid sealed auction game and a reputation-based game. This solves the fairness problems associated with spectrum sharing amongst one primary user and a large number of secondary users in a cognitive radio environment. The proposed games create a competition between the bidders and offers better revenue to the players in terms of fairness to more than 60% in certain scenarios. The proposed game could reach the maximum total profit for both primary and secondary users with better fairness; this is illustrated through numerical results.

With the current scenario of development of antennas in the wireless communication field, the need of compact multiband, multifunctional and cost effective antenna is on the rise. The objective of this thesis is to present fixed and reconfigurable techniques and methods for small and slim multiband antennas, which are applicable to serve modern small and slime wireless, mobile and cognitive radio applications. In the fixed designs, independent control of the operating frequencies is investigated to enhance the antennas capabilities and to give the designer an additional level of freedom to design the antenna for other bands easily without altering the shape or the size of the antenna. In addition, for mobile phone antenna, the effect of user’s hand and mobile phone housing are studied to be with minimum effect. Although fixed multiband antennas can widely be used in many different systems or devices, they lack flexibility to accommodate new services compared with reconfigurable antennas. A reconfigurable antenna can be considered as one of the key advances for future wireless communication transceivers. The advantage of using a reconfigurable antenna is to operate in multiband where the total antenna volume can be reused and therefore the overall size can be reduced. Moreover, the future of cell phones and other personal mobile devices require compact multiband antennas and smart antennas with reconfigurable features. Two different types of frequency reconfigurability are investigated in this thesis: switchable and tunable. In the switchable reconfigurability, PIN diodes have been used so the antenna’s operating frequencies can hop between different services whereas varactor diode with variable capacitance allow the antenna’s operating frequencies to be fine-tuned over the operating bands. With this in mind, firstly, a switchable compact and slim antenna with two patch elements is presented for cognitive radio applications where the antenna is capable of operating in wideband and narrow bands depending on the states of the switches. In addition to this, a switchable design is proposed to switch between single, dual and tri bands applications (using a single varactor diode to act as a switch at lower capacitance values) with some fine tuning capabilities for the first and third bands when the capacitance of the diode is further increased. Secondly, the earlier designed fixed antennas are modified to be reconfigurable with fine-tuning so that they can be used for more applications in both wireless and mobile applications with the ability to control the bands simultaneously or independently over a wide range. Both analytical and numerical methods are used to implement a realistic and functional design. Parametric analyses using simulation tools are performed to study critical parameters that may affect the designs. Finally, the simulated designs are fabricated, and measured results are presented that validate the design approaches.

The design and analysis of various distributed space time block coding schemes for cooperative relay networks is considered in this thesis. Rayleigh frequency flat and selective fading channels are assumed to model the links in the networks, and interference suppression techniques together with an orthogonal frequency division multiplexing (OFDM) type transmission approach are employed to mitigate synchronization errors at the destination node induced by the different delays through the relay nodes. Closed-loop space time block coding is first considered in the context of decode-and-forward (regenerative) networks. In particular, quasi orthogonal and extended orthogonal coding techniques are employed for transmission from four relay nodes and parallel interference cancellation detection is exploited to mitigate synchronization errors. Availability of a direct link between the source and destination nodes is studied. Outer coding is then added to gain further improvement in end-to-end performance and amplify-and-forward (non regenerative) type networks together with distributed space time coding are considered to reduce relay node complexity. A novel detection scheme is then proposed for decode-and-forward and amplify-and-forward networks with closed-loop extended orthogonal coding and closed-loop quasi-orthogonal coding which reduce the computational complexity of the parallel interference cancellation. The near-optimum detector is presented for relay nodes with single or dual antennas. End-to-end bit error rate simulations confirm the potential of the approach and its ability to mitigate synchronization errors.

Nous proposons un nouveau schéma d’échantillonnage non uniforme périodique appelé Système d’Échantillonnage Non Uniforme en Radio Intelligente (SENURI). Notre schéma détecte la localisation spectrale des bandes actives dans la bande totale échantillonnée afin de réduire la fréquence moyenne d’échantillonnage, le nombre d’échantillons prélevé et par conséquent la consommation d’énergie au niveau du traitement numérique. La fréquence moyenne d’échantillonnage du SENURI dépend uniquement du nombre de bandes contenues dans le signal d’entrée x(t). Il est nettement plus performant, en termes d’erreur quadratique, qu’une architecture classique d’échantillonnage non uniforme périodique constituée de p branches, lorsque le spectre de x(t) change dynamiquement. / In this work we consider the problem of designing an effective sampling scheme for sparse multi-band signals. Based on previous results on periodic non-uniform sampling (Multi-Coset) and using the well known Non-Uniform Fourier Transform through Bartlett’s method for Power Spectral Density estimation, we propose a new sampling scheme named the Dynamic Single Branch Non-uniform Sampler (DSB-NUS). The idea of the proposed scheme is to reduce the average sampling frequency, the number of samples collected, and consequently the power consumption of the Analog to Digital Converter (ADC). In addition to that our proposed method detects the location of the bands in order to adapt the sampling rate. In this thesis, we show through simulation results that compared to existing multi-coset based samplers, our proposed sampler provides superior performance, both in terms of sampling rate and energy consumption. It is notconstrained by the inflexibility of hardware circuitry and is easily reconfigurable. We also show the effect of the false detection of active bands on the average sampling rate of our new adaptive non-uniform sub-Nyquist sampler scheme.

La thèse aborde le problème de la détection d’un signal dans une bande de fréquences donnée sans aucune connaissance à priori sur la source (détection aveugle) dans le contexte de la radio intelligente. Le détecteur proposé dans la thèse est basé sur l’estimation des valeurs propres de la matrice de corrélation du signal reçu. A partir de ces valeurs propres, plusieurs critères ont été développés théoriquement (Standard Condition Number, Scaled Largest Eigenvalue, Largest Eigenvalue) en prenant pour hypothèse majeure un nombre fini d’éléments, contrairement aux hypothèses courantes de la théorie des matrices aléatoires qui considère un comportement asymptotique de ces critères. Les paramètres clés des détecteurs ont été formulés mathématiquement (probabilité de fausse alarme, densité de probabilité) et une correspondance avec la densité GEV a été explicitée. Enfin, ce travail a été étendu au cas multi-antennes (MIMO) pour les détecteurs SLE et SCN. / In Cognitive Radio, Spectrum Sensing (SS) is the task of obtaining awareness about the spectrum usage. Mainly it concerns two scenarios of detection: (i) detecting the absence of the Primary User (PU) in a licensed spectrum in order to use it and (ii) detecting the presence of the PU to avoid interference. Several SS techniques were proposed in the literature. Among these, Eigenvalue Based Detector (EBD) has been proposed as a precious totally-blind detector that exploits the spacial diversity, overcome noise uncertainty challenges and performs adequately even in low SNR conditions. The first part of this study concerns the Standard Condition Number (SCN) detector and the Scaled Largest Eigenvalue (SLE) detector. We derived exact expressions for the Probability Density Function (PDF) and the Cumulative Distribution Function (CDF) of the SCN using results from finite Random Matrix Theory; In addition, we derived exact expressions for the moments of the SCN and we proposed a new approximation based on the Generalized Extreme Value (GEV) distribution. Moreover, using results from the asymptotic RMT we further provided a simple forms for the central moments of the SCN and we end up with a simple and accurate expression for the CDF, PDF, Probability of False-Alarm, Probability of Detection, of Miss-Detection and the decision threshold that could be computed and hence provide a dynamic SCN detector that could dynamically change the threshold value depending on target performance and environmental conditions. The second part of this study concerns the massive MIMO technology and how to exploit the large number of antennas for SS and CRs. Two antenna exploitation scenarios are studied: (i) Full antenna exploitation and (ii) Partial antenna exploitation in which we have two options: (i) Fixed use or (ii) Dynamic use of the antennas. We considered the Largest Eigenvalue (LE) detector if noise power is perfectly known and the SCN and SLE detectors when noise uncertainty exists.

A Research Report submitted to the Faculty of Engineering and the Built Environment, University of Witwatersrand, in the partial fulfilment of the requirements for the degree of Master of Science in Engineering Johannesburg, 2015. / Due to the enormous demand for multimedia services which relies hugely on the availability of spectrum, service providers and technologist are devising a means or method which is able to fully satisfy these growing demands. The availability of spectrum to meet these demands has been a lingering issue for the past couple of years. Many would have it tagged as spectrum scarcity but really the main problem is not how scarce the spectrum is but how efficiently allocated to use is the spectrum. Once such inefficiency is tackled effectively, then we are a step closer in meeting the enormous demands for uninterrupted services. However, to do so, there are techniques or methodologies being developed to aid in the efficient management of spectrum. In this research project, two methodologies were considered and the efficiency of these methodologies in the areas of spectrum management. The Geo-location Spectrum Database (GLSD) which is the most adopted technique and the Cognitive radio spectrum sensing technique are currently the available techniques in place. The TV whitespaces (TVWS) was explored using both techniques and certain comparison based on performances; implementation, practicability, cost and flexibility were used as an evaluation parameter in arriving at a conclusion. After accessing both methodologies, conclusions were deduced on the preferred methodology and how its use would efficiently solve the issues encountered in spectrum management