Sparse Spectrum Sensing in Infrastructure-less Cognitive Radio Networks via Binary Consensus Algorithms

Compressive Sensing has been utilized in Cognitive Radio Networks (CRNs) to exploit the sparse nature of the occupation of the primary users. Also, distributed spectrum sensing has been proposed to tackle the wireless channel problems, like node or link failures, rather than the common (centralized approach) for spectrum sensing. In this paper, we propose a distributed spectrum sensing framework based on consensus algorithms where SU nodes exchange their binary decisions to take global decisions without a fusion center to coordinate the sensing process. Each SU will share its decision with its neighbors, and at every new iteration each SU will take a new decision based on its current decision and the decisions it receives from its neighbors; in the next iteration, each SU will share its new decision with its neighbors. We show via simulations that the detection performance can tend to the performance of majority rule Fusion Center based CRNs

A Belief-Based Decision-Making Framework for Spectrum Selection in Cognitive Radio Networks

This paper presents a comprehensive cognitive management framework for spectrum selection in cognitive radio (CR) networks. The framework uses a belief vector concept as a means to predict the interference affecting the different spectrum blocks (SBs) and relies on a smart analysis of the scenario dynamicity to properly determine an adequate observation strategy to balance the tradeoff between achievable performance and measurement requirements. In this respect, the paper shows that the interference dynamics in a given SB can be properly characterized through the second highest eigenvalue of the interference state transition matrix. Therefore, this indicator is retained in the proposed framework as a relevant parameter to drive the selection of both the observation strategy and spectrum selection decision-making criterion. This paper evaluates the proposed framework to illustrate the capability to properly choose among a set of possible observation strategies under different scenario conditions. Furthermore, a comparison against other state-of-the-art solutions is presented

A cognitive QoS management framework for WLANs

Due to the precipitous growth of wireless networks and the paucity of spectrum, more interference is imposed to the wireless terminals which constraints their performance. In order to preserve such performance degradation, this paper proposes a framework which uses cognitive radio techniques for quality of service (QoS) management of wireless local area networks (LANs). The framework incorporates radio environment maps as input to a cognitive decision engine that steers the network to optimize its QoS parameters such as throughput. A novel experimentally verified heuristic physical model is developed to predict and optimize the throughput of wireless terminals. The framework was applied to realistic stationary and time-variant interference scenarios where an average throughput gain of 344% was achieved in the stationary interference scenario and 70% to 183% was gained in the time-variant interference scenario

Optimization of Spectrum Allocation in Cognitive Radio and Dynamic Spectrum Access Networks

Spectrum has become a treasured commodity. However, many licensed frequency bands exclusively assigned to the primary license holders (also called primary users) remain relatively unused or under-utilized for most of the time. Allowing other users (also called secondary users) without a license to operate in these bands with no interference becomes a promising way to satisfy the fast growing needs for frequency spectrum resources. A cognitive radio adapts to the environment it operates in by sensing the spectrum and quickly decides on appropriate frequency bands and transmission parameters to use in order to achieve certain performance goals. One of the most important issues in cognitive radio networks (CRNs) is intelligent channel allocation which will improve the performance of the network and spectrum utilization. The objective of this dissertation is to address the channel allocation optimization problem in cognitive radio and DSA networks under both centralized architecture and distributed architecture. By centralized architecture we mean the cognitive radio and DSA networks are infrastructure based. That is, there is a centralized device which collects all information from other cognitive radios and produces a channel allocation scheme. Then each secondary user follows the spectrum allocation and accesses the corresponding piece of spectrum. By distributed architecture we mean that each secondary user inside the cognitive radio and DSA networks makes its own decision based on local information on the spectrum usage. Each secondary user only considers the spectrum usage around itself. We studied three common objectives of the channel allocation optimization problem, including maximum network throughput (MNT), max-min fairness (MMF), and proportional fairness (PF). Given different optimization objectives, we developed mathematical models in terms of linear programing and non-linear programing formulations, under the centralized architecture. We also designed a unified framework with different heuristic algorithms for different optimization objectives and the best results from different algorithms can be automatically chosen without manual intervention. We also conducted additional work on spectrum allocation under distributed architecture. First, we studied the channel availability prediction problem. Since there is a lot of usable statistic information on spectrum usage from national and regional agencies, we presented a Bayesian inference based prediction method, which utilizes prior information to make better prediction on channel availability. Finally a distributed channel allocation algorithm is designed based on the channel prediction results. We illustrated that the interaction behavior between different secondary users can be modeled as a game, in which the secondary users are denoted as players and the channels are denoted as resources. We proved that our distributed spectrum allocation algorithm can achieve to Nash Equilibrium, and is Pareto optimal

Quickest Change Detection In Multiple On-off Processes: Switching With Memory

Abstract—We consider the quickest detection of idle periods in multiple on-off processes. At each time, only one process can be observed, and the observations are random realizations drawn from two different distributions depending on the current state (on or off) of the chosen process. Switching back to a previously visited process is allowed, and measurements obtained during previous visits are taken into account in decision making. The objective is to catch an idle period in any of the on-off processes as quickly as possible subject to a constraint on the probability of mistaking a busy period for an idle one. Assuming geometrically distributed busy and idle times, we establish a Bayesian formulation of the problem within a decisiontheoretic framework. Basic structures of the optimal decision rules are established. Based on these basic structures, we propose a low-complexity threshold policy for switching among processes and declaring idle periods. The near optimal performance of this threshold policy is demonstrated by a comparison with a genie-aided system which defines an upper bound on the optimal performance. This problem finds applications in spectrum opportunity detection in cognitive radio networks where a secondary user searches for idle channels in the spectrum. Index Terms—Quickest change detection, on-off process, spectrum opportunity detection, cognitive radio, genie-aided system I