Enhanced Spectrum Sensing Techniques for Cognitive Radio Systems

Due to the rapid growth of new wireless communication services and applications, much attention has been directed to frequency spectrum resources. Considering the limited radio spectrum, supporting the demand for higher capacity and higher data rates is a challenging task that requires innovative technologies capable of providing new ways of exploiting the available radio spectrum. Cognitive radio (CR), which is among the core prominent technologies for the next generation of wireless communication systems, has received increasing attention and is considered a promising solution to the spectral crowding problem by introducing the notion of opportunistic spectrum usage. Spectrum sensing, which enables CRs to identify spectral holes, is a critical component in CR technology. Furthermore, improving the efficiency of the radio spectrum use through spectrum sensing and dynamic spectrum access (DSA) is one of the emerging trends. In this thesis, we focus on enhanced spectrum sensing techniques that provide performance gains with reduced computational complexity for realistic waveforms considering radio frequency (RF) impairments, such as noise uncertainty and power amplifier (PA) non-linearities. The first area of study is efficient energy detection (ED) methods for spectrum sensing under non-flat spectral characteristics, which deals with relatively simple methods for improving the detection performance. In realistic communication scenarios, the spectrum of the primary user (PU) is non-flat due to non-ideal frequency responses of the devices and frequency selective channel conditions. Weighting process with fast Fourier transform (FFT) and analysis filter bank (AFB) based multi-band sensing techniques are proposed for overcoming the challenge of non-flat characteristics. Furthermore, a sliding window based spectrum sensing approach is addressed to detect a re-appearing PU that is absent in one time and present in other time. Finally, the area under the receiver operating characteristics curve (AUC) is considered as a single-parameter performance metric and is derived for all the considered scenarios. The second area of study is reduced complexity energy and eigenvalue based spectrum sensing techniques utilizing frequency selectivity. More specifically, novel spectrum sensing techniques, which have relatively low computational complexity and are capable of providing accurate and robust performance in low signal-to-noise ratio (SNR) with noise uncertainty, as well as in the presence of frequency selectivity, are proposed. Closed-form expressions are derived for the corresponding probability of false alarm and probability of detection under frequency selectivity due the primary signal spectrum and/or the transmission channel. The offered results indicate that the proposed methods provide quite significant saving in complexity, e.g., 78% reduction in the studied example case, whereas their detection performance is improved both in the low SNR and under noise uncertainty. Finally, a new combined spectrum sensing and resource allocation approach for multicarrier radio systems is proposed. The main contribution of this study is the evaluation of the CR performance when using wideband spectrum sensing methods in combination with water-filling and power interference (PI) based resource allocation algorithms in realistic CR scenarios. Different waveforms, such as cyclic prefix based orthogonal frequency division multiplexing (CP-OFDM), enhanced orthogonal frequency division multiplexing (E-OFDM) and filter bank based multicarrier (FBMC), are considered with PA nonlinearity type RF impairments to see the effects of spectral leakage on the spectrum sensing and resource allocation performance. It is shown that AFB based spectrum sensing techniques and FBMC waveforms with excellent spectral containment properties have clearly better performance compared to the traditional FFT based spectrum sensing techniques with the CP-OFDM. Overall, the investigations in this thesis provide novel spectrum sensing techniques for overcoming the challenge of noise uncertainty with reduced computational complexity. The proposed methods are evaluated under realistic signal models

Network performance & Quality of service in data networks involving spectrum utilization techniques

This research has developed technique to improve the quality of service in wireless data networks that employ spectrum utilization techniques based on Cognitive Radio. Most multiple dimension implementations focus on maximizing the Successful Communication Probability SCP in order to improve the wireless network utilization. However this usually has a negative impact on the Quality of Service, since increasing the SCP leads to increasing signal interference and Packet Loss, and thus network performance deterioration. The Multiple Dimension Cognitive Radio technique is a new technique, proposed in this thesis, that improves the Cognitive Radio Networks (CRN) efficiency by giving opportunity to secondary users (Unlicensed users) to use several dimension such as time, frequency, modulation, coding, and antenna directionality to increase their opportunity in finding spectrum hole. In order to draw a balance between improving the networking utilization and keeping the network performance at an acceptable level, this thesis proposes a new model of multiple dimension CR which provides a compromise between maximizing the SCP and network throughput from one side and keeping the QoS within the accepted thresholds from the other side. This is important so as to avoid network performance degradation which may result from the high user density in single wireless domain as a result of maximizing the SCP. In this research, a full Cognitive Radio model has been implemented in the OPNET simulator by developing modified nodes with the appropriate coding which include basic functionality. The Purpose of this model is to simulate the CR environment and study the network performance after applying the controlled multi dimension technique presented here. The proposed technique observes the channel throughput on TCP (Transmission Control Protocol) level, also QoS KPIs (Key Performance Index) like Packet Loss and Bit Error rate, during the operation of the CR multi dimension technique and alerts the system when the throughput degrades below a certain level. The proposed technique has interactive cautious nature which keeps monitoring the network performance and once find evident on network performance deterioration it takes corrective action, terminates low priority connections and releases over utilized channels, in order to keep the performance accepted

Multiuser Downlink Beamforming Techniques for Cognitive Radio Networks

Spectrum expansion and a significant network densification are key elements in meeting the ever increasing demands in data rates and traffic loads of future communication systems. In this context, cognitive radio (CR) techniques, which sense and opportunistically use spectrum resources, as well as beamforming methods, which increase spectral efficiency by exploiting spatial dimensions, are particularly promising. Thus, the scope of this thesis is to propose efficient downlink (DL) beamforming and power allocation schemes, in a CR framework. The methods developed here, can be further applied to various practical scenarios such as hierarchical multi-tier, heterogenous or dense networks. In this work, the particular CR underlay paradigm is considered, according to which, secondary users (SUs) opportunistically use the spectrum held by primary users (PUs), without disturbing the operation of the latter. Developing beamforming algorithms, in this scenario, requires that channel state information (CSI) from both SUs and PUs is required at the BS. Since in CR networks PUs have typically limited or no cooperation with the SUs, we particularly focus on designing beamforming schemes based on statistical CSI, which can be obtained with limited or no feedback. To further meet the energy efficiency requirements, the proposed beamforming designs aim to minimize the transmitted power at the BS, which serves SUs at their desired Quality-of-Service (QoS), in form of Signal-to-interference-plus-noise (SINR), while respecting the interference requirements of the primary network. In the first stage, this problem is considered under the assumption of perfect CSI of both SUs and PUs. The difficulty of this problem consists on one hand, in its non-convexity and, on the other hand, in the fact that the beamformers are coupled in all constraints. State-of-the-art approaches are based on convex approximations, given by semidefinite relaxation (SDR) methods, and suffer from large computational complexity per iteration, as well as the drawback that optimal beamformers cannot always be retrieved from the obtained solutions. The approach, proposed in this thesis, aims to overcome these limitations by exploiting the structure of the problem. We show that the original downlink problem can be equivalently represented in a so called ’virtual’ uplink domain (VUL), where the beamformers and powers are allocated, such that uplink SINR constraints of the SUs are satisfied, while both SUs and PUs transmit to the BS. The resulting VUL problem has a simpler structure than the original formulation, as the beamformers are decoupled in the SINR constraints. This allows us to develop algorithms, which solve the original problem, with significantly less computational complexity than the state-of-the-art methods. The rigurous analysis of the Lagrange duality, performed next, exposes scenarios, in which the equivalence between VUL and DL problems can be theroretically proven and shows the relation between the obtained powers in the VUL domain and the optimal Lagrange multipliers, corresponding to the original problem. We further use the duality results and the intuition of the VUL reformulation, in the extended problem of joint admission control and beamforming. The aim of this is to find a maximal set of SUs, which can be jointly served, as well as the corresponding beamforming and power allocation. Our approach uses Lagrange duality, to detect infeasible cases and the intuition of the VUL reformulation to decide upon the users, which have the largest contribution to the infeasibiity of the problem. With these elements, we construct a deflation based algorithm for the joint beamforming and admission control problem, which benefits from low complexity, yet close to optimal perfomance. To make the method also suitable for dense networks, with a large number of SUs and PUs, a cluster aided approach is further proposed and consists in grouping users, based on their long term spatial signatures. The information in the clusters serves as an initial indication of the SUs which cannot be simultaneously served and the PUs which pose similar interference constraints to the BS. Thus, the cluster information can be used to significantly reduce the dimension of the problem in scenarios with large number of SUs and PUs, and this fact is further validated by extensive simulations. In the second part of this thesis, the practical case of imperfect covariance based CSI, available at the transmitter, is considered. To account for the uncertainty in the channel knowledge, a worst case approach is taken, in which the SINR and the interference constraints are considered for all CSI mismatches in a predefined set One important factor, which influences the performance of the worst case beamforming approach is a proper choice of the the defined uncertainty set, to accurately model the possible uncertainties in the CSI. In this thesis, we show that recently derived Riemannian distances are better suited to measure the mismatches in the statistical CSI than the commonly used Frobenius norms, as they better capture the properties of the covariance matrices, than the latter. Therefore, we formulate a novel worst case robust beamforming problem, in which the uncertainty set is bounded based on these measures and for this, we derive a convex approximation, to which a solution can be efficiently found in polynomial time. Theoretical and numerical results confirm the significantly better performance of our proposed methods, as compared to the state-of-the-art methods, in which Frobenius norms are used to bound the mismatches. The consistently better results of the designs utilizing Riemannian distances also manifest in scenarios with large number of users, where admission control techniques must supplement the beamforming design with imperfect CSI. Both benchmark methods as well as low complexity techniques, developed in this thesis to solve this problem, show that designs based on Riemannian distance outperform their competitors, in both required transmit power as well as number of users, which can be simultaneously served

Théorie des jeux et apprentissage pour les réseaux sans fil distribués

Dans cette thèse, nous étudions des réseaux sans fil dans lesquels les terminaux mobiles sont autonomes dans le choix de leurs configurations de communication. Cette autonomie de décision peut notamment concerner le choix de la technologie d'accès au réseau, le choix du point d'accès, la modulation du signal, les bandes de fréquences occupées, la puissance du signal émis, etc. Typiquement, ces choix de configuration sont réalisés dans le but de maximiser des métriques de performances propres à chaque terminal. Sous l'hypothèse que les terminaux prennent leurs décisions de manière rationnelle afin de maximiser leurs performances, la théorie des jeux s'applique naturellement pour modéliser les interactions entre les décisions des différents terminaux. Plus précisément, l'objectif principal de cette thèse est d'étudier des stratégies d'équilibre de contrôle de puissance d'émission afin de satisfaire des considérations d'efficacité énergétique. Le cadre des jeux stochastiques est particulièrement adapté à ce problème et nous permet notamment de caractériser la région de performance atteignable pour toutes les stratégies de contrôle de puissance qui mènent à un état d'équilibre. Lorsque le nombre de terminaux en jeu est grand, nous faisons appel à la théorie des jeux à champ moyen pour simplifier l'étude du système. Cette théorie nous permet d'étudier non pas les interactions individuelles entre les terminaux, mais l'interaction de chaque terminal avec un champ moyen qui représente l'état global des autres terminaux. Des stratégies de contrôle de puissance optimales du jeu à champ moyen sont étudiées. Une autre partie de la thèse a été consacrée à des problématiques d'apprentissage de points d'équilibre dans les réseaux distribués. En particulier, après avoir caractérisé les positions d'équilibre d'un jeu de positionnement de points d'accès, nous montrons comment des dynamiques de meilleures réponses et d'apprentissage permettent de converger vers un équilibre. Enfin, pour un jeu de contrôle de puissance, la convergence des dynamiques de meilleures réponses vers des points d'équilibre a été étudiée. Il est notamment proposé un algorithme d'adaptation de puissance convergeant vers un équilibre avec une faible connaissance du réseau.In this thesis, we study wireless networks in which mobile terminals are free to choose their communication configuration. Theses configuration choices include access wireless technology, access point association, coding-modulation scheme, occupied bandwidth, power allocation, etc. Typically, these configuration choices are made to maximize some performance metrics associated to every terminals. Under the assumption that mobile terminals take their decisions in a rational manner, game theory can be applied to model the interactions between the terminals. Precisely, the main objective of this thesis is to study energy-efficient power control policies from which no terminal has an interest to deviate. The framework of stochastic games is particularly suited to this problem and allows to characterize the achievable utility region for equilibrium power control strategies. When the number of terminals in the network is large, we invoke mean field game theory to simplify the study of the system. Indeed, in a mean field game, the interactions between a player and all the other players are not considered individually. Instead, one only studies the interactions between each player and a mean field, which is the distribution of the states of all the other players. Optimal power control strategies from the mean field formulation are studied. Another part of this thesis has been focused on learning equilibria in distributed games. In particular, we show how best response dynamics and learning algorithms can converge to an equilibrium in a base station location game. For another scenario, namely a power control problem, we study the convergence of the best response dynamics. In this case, we propose a power control behavioral rule that converges to an equilibrium with very little information about the network.PARIS11-SCD-Bib. électronique (914719901) / SudocSudocFranceF

Posicionamento cooperativo para redes sem fios heterogéneas

Doutoramento em Engenharia ElectrotécnicaFuture emerging market trends head towards positioning based services placing a new perspective on the way we obtain and exploit positioning information. On one hand, innovations in information technology and wireless communication systems enabled the development of numerous location based applications such as vehicle navigation and tracking, sensor networks applications, home automation, asset management, security and context aware location services. On the other hand, wireless networks themselves may bene t from localization information to improve the performances of di erent network layers. Location based routing, synchronization, interference cancellation are prime examples of applications where location information can be useful. Typical positioning solutions rely on measurements and exploitation of distance dependent signal metrics, such as the received signal strength, time of arrival or angle of arrival. They are cheaper and easier to implement than the dedicated positioning systems based on ngerprinting, but at the cost of accuracy. Therefore intelligent localization algorithms and signal processing techniques have to be applied to mitigate the lack of accuracy in distance estimates. Cooperation between nodes is used in cases where conventional positioning techniques do not perform well due to lack of existing infrastructure, or obstructed indoor environment. The objective is to concentrate on hybrid architecture where some nodes have points of attachment to an infrastructure, and simultaneously are interconnected via short-range ad hoc links. The availability of more capable handsets enables more innovative scenarios that take advantage of multiple radio access networks as well as peer-to-peer links for positioning. Link selection is used to optimize the tradeo between the power consumption of participating nodes and the quality of target localization. The Geometric Dilution of Precision and the Cramer-Rao Lower Bound can be used as criteria for choosing the appropriate set of anchor nodes and corresponding measurements before attempting location estimation itself. This work analyzes the existing solutions for node selection in order to improve localization performance, and proposes a novel method based on utility functions. The proposed method is then extended to mobile and heterogeneous environments. Simulations have been carried out, as well as evaluation with real measurement data. In addition, some speci c cases have been considered, such as localization in ill-conditioned scenarios and the use of negative information. The proposed approaches have shown to enhance estimation accuracy, whilst signi cantly reducing complexity, power consumption and signalling overhead.As tendências nos mercados emergentes caminham na direção dos serviços baseados em posicionamento, criando uma nova perspectiva na forma como podemos obter e utilizar informação de posicionamento. Por um lado, as inovações em tecnologias da informação e sistemas de comunicação sem fios permitiram o desenvolvimento de inúmeras aplicações baseadas em localização, tais como a navegação e monitorização de veículo, aplicações de redes de sensores, domótica, gestão de ativos, segurança e serviços de localização sensíveis ao contexto. Por outro lado, as próprias redes sem fios podem beneficiar da informação de localização dos utilizadores de forma a melhorarem as performances de diferentes camadas de rede. Routing baseado em localização, sincronização e cancelamento de interferência são os exemplos mais representativos de áreas onde a informação de localização pode ser útil. Soluções de localização típicas dependem de medições e de aproveitamento de métricas de sinal dependentes da distância, tais como a potência do sinal recebido, o tempo ou ângulo de chegada. São mais baratos e fáceis de implementar do que sistemas de localização dedicados com base em fingerprinting, com a desvantagem da perda de precisão. Consequentemente, algoritmos inteligentes de localização e técnicas de processamento de sinal têm de ser aplicados para compensar a falta de precisão das estimativas de distância. A cooperação entre nodos é usada nos casos em que as técnicas convencionais de posicionamento não têm um bom desempenho devido à inexistência de infraestrutura adequada, ou a um ambiente interior com obstruções. O objetivo é ter uma arquitetura híbrida, onde alguns nós têm pontos de ligação a uma infraestrutura e simultaneamente estão interligados através ligações ad-hoc de curto alcance. A disponibilidade de equipamentos mais capazes permite cenários mais inovadores que tiram proveito de múltiplas redes de acesso de rádio, bem como ligações peer-to-peer, para o posicionamento. A seleção de ligações é usada para otimizar o equilíbrio entre o consumo de energia dos nós participantes e da qualidade da localização do alvo. A diluição geométrica de precisão e a Cramér Rao Lower Bound podem ser utilizadas como critrio para a escolha do conjunto adequado de nodos de ancoragem e as medições correspondentes antes de realizar a tarefa de estimativa de localizaçãoo. Este trabalho analisa as soluções existentes para a seleção de nós, a fim de melhorar o desempenho de localização e propõe um novo método baseado em funções de utilidade. O método proposto é então estendido para ambientes móveis e heterogéneos. Foram realizadas simulações bem como avaliação de dados de medições reais. Além disso, alguns casos específicos foram considerados, tais como a localização em cenários mal-acondicionados e uso de informação negativa. As abordagens propostas revelaram uma melhoria na precisão da estimação, ao mesmo tempo que reduziram significativamente a complexidade do cálculo, o consumo de energia e o overhead do sinal

Journal of Telecommunications and Information Technology, 2014, nr 3

kwartalni

Game Theory Relaunched

The game is on. Do you know how to play? Game theory sets out to explore what can be said about making decisions which go beyond accepting the rules of a game. Since 1942, a well elaborated mathematical apparatus has been developed to do so; but there is more. During the last three decades game theoretic reasoning has popped up in many other fields as well - from engineering to biology and psychology. New simulation tools and network analysis have made game theory omnipresent these days. This book collects recent research papers in game theory, which come from diverse scientific communities all across the world; they combine many different fields like economics, politics, history, engineering, mathematics, physics, and psychology. All of them have as a common denominator some method of game theory. Enjoy