Cooperative subcarrier sensing using antenna diversity based weighted virtual sub clustering

The idea of cooperation and the clustering amongst cognitive radios (CRs) has recently been focus of attention of research community, owing to its potential to improve performance of spectrum sensing (SS) schemes. This focus has led to the paradigm of cluster based cooperative spectrum sensing (CBCSS). In perspective of high date rate 4th generation wireless systems, which are characterized by orthogonal frequency division multiplexing (OFDM) and spatial diversity, there is a need to devise effective SS strategies. A novel CBCSS scheme is proposed for OFDM subcarrier detection in order to enable the non-contiguous OFDM (NC-OFDM) at the physical layer of CRs for efficient utilization of spectrum holes. Proposed scheme is based on the energy detection in MIMO CR network, using equal gain combiner as diversity combining technique, hard combining (AND, OR and Majority) rule as data fusion technique and antenna diversity based weighted clustering as virtual sub clustering algorithm. Results of proposed CBCSS are compared with conventional CBCSS scheme for AND, OR and Majority data fusion rules. Moreover the effects of antenna diversity, cooperation and cooperating clusters are also discussed

Cooperative sensing of spectrum opportunities

Reliability and availability of sensing information gathered from local spectrum sensing (LSS) by a single Cognitive Radio is strongly affected by the propagation conditions, period of sensing, and geographical position of the device. For this reason, cooperative spectrum sensing (CSS) was largely proposed in order to improve LSS performance by using cooperation between Secondary Users (SUs). The goal of this chapter is to provide a general analysis on CSS for cognitive radio networks (CRNs). Firstly, the theoretical system model for centralized CSS is introduced, together with a preliminary discussion on several fusion rules and operative modes. Moreover, three main aspects of CSS that substantially differentiate the theoretical model from realistic application scenarios are analyzed: (i) the presence of spatiotemporal correlation between decisions by different SUs; (ii) the possible mobility of SUs; and (iii) the nonideality of the control channel between the SUs and the Fusion Center (FC). For each aspect, a possible practical solution for network organization is presented, showing that, in particular for the first two aspects, cluster-based CSS, in which sensing SUs are properly chosen, could mitigate the impact of such realistic assumptions

Coalition Formation Games for Collaborative Spectrum Sensing

Collaborative Spectrum Sensing (CSS) between secondary users (SUs) in cognitive networks exhibits an inherent tradeoff between minimizing the probability of missing the detection of the primary user (PU) and maintaining a reasonable false alarm probability (e.g., for maintaining a good spectrum utilization). In this paper, we study the impact of this tradeoff on the network structure and the cooperative incentives of the SUs that seek to cooperate for improving their detection performance. We model the CSS problem as a non-transferable coalitional game, and we propose distributed algorithms for coalition formation. First, we construct a distributed coalition formation (CF) algorithm that allows the SUs to self-organize into disjoint coalitions while accounting for the CSS tradeoff. Then, the CF algorithm is complemented with a coalitional voting game for enabling distributed coalition formation with detection probability guarantees (CF-PD) when required by the PU. The CF-PD algorithm allows the SUs to form minimal winning coalitions (MWCs), i.e., coalitions that achieve the target detection probability with minimal costs. For both algorithms, we study and prove various properties pertaining to network structure, adaptation to mobility and stability. Simulation results show that CF reduces the average probability of miss per SU up to 88.45% relative to the non-cooperative case, while maintaining a desired false alarm. For CF-PD, the results show that up to 87.25% of the SUs achieve the required detection probability through MWCComment: IEEE Transactions on Vehicular Technology, to appea

Performance Analysis of Arbitrarily-Shaped Underlay Cognitive Networks: Effects of Secondary User Activity Protocols

This paper analyzes the performance of the primary and secondary users (SUs) in an arbitrarily-shaped underlay cognitive network. In order to meet the interference threshold requirement for a primary receiver (PU-Rx) at an arbitrary location, we consider different SU activity protocols which limit the number of active SUs. We propose a framework, based on the moment generating function (MGF) of the interference due to a random SU, to analytically compute the outage probability in the primary network, as well as the average number of active SUs in the secondary network. We also propose a cooperation-based SU activity protocol in the underlay cognitive network which includes the existing threshold-based protocol as a special case. We study the average number of active SUs for the different SU activity protocols, subject to a given outage probability constraint at the PU and we employ it as an analytical approach to compare the effect of different SU activity protocols on the performance of the primary and secondary networks.Comment: submitted to possible IEEE Transactions publicatio