A Weighted Linear Combining Scheme for Cooperative Spectrum Sensing

AbstractCooperative spectrum sensing exploits spatial diversity of secondary-users (SUs), to reliably detect the availability of a spectrum. Soft energy combining schemes have optimal detection performance at the cost of high cooperation overhead, since actual sensed data is required at the fusion center. To reduce cooperation overhead, in hard combining only local decisions are shared; however the detection performance is suboptimal due to the loss of information. In this paper, a weighted linear combining scheme is proposed in which a SU performs a local sensing test based on two threshold levels. If local test result lies between the two thresholds then the SU report neither its local decision nor sequentially estimated unknown SNR parameter values, to the fusion center. Thereby, uncertain decisions about the presence/absence of the primary-user signal are suppressed. Simulation results suggest that the detection performance of the proposed scheme is close to optimal soft combining schemes yet its overhead is similar to hard combining techniques

Cluster-based cooperative subcarrier sensing using antenna diversity-based weighted data fusion

Cooperative spectrum sensing (CSS) is used in cognitive radio (CR) networks to improve the spectrum sensing performance in shadow fading environments. Moreover, clustering in CR networks is used to reduce reporting time and bandwidth overhead during CSS. Thus, cluster-based cooperative spectrum sensing (CBCSS) has manifested satisfactory spectrum sensing results in harsh environments under processing constraints. On the other hand, the antenna diversity of multiple input multiple output CR systems can be exploited to further improve the spectrum sensing performance. This paper presents the CBCSS performance in a CR network which is comprised of single- as well as multiple-antenna CR systems. We give theoretical analysis of CBCSS for orthogonal frequency division multiplexing signal sensing and propose a novel fusion scheme at the fusion center which takes into account the receiver antenna diversity of the CRs present in the network. We introduce the concept of weighted data fusion in which the sensing results of different CRs are weighted proportional to the number of receiving antennas they are equipped with. Thus, the receiver diversity is used to the advantage of improving spectrum sensing performance in a CR cluster. Simulation results show that the proposed scheme outperforms the conventional CBCSS scheme

Collaborative spectrum sensing optimisation algorithms for cognitive radio networks

The main challenge for a cognitive radio is to detect the existence of primary users reliably in order to minimise the interference to licensed communications. Hence, spectrum sensing is a most important requirement of a cognitive radio. However, due to the channel uncertainties, local observations are not reliable and collaboration among users is required. Selection of fusion rule at a common receiver has a direct impact on the overall spectrum sensing performance. In this paper, optimisation of collaborative spectrum sensing in terms of optimum decision fusion is studied for hard and soft decision combining. It is concluded that for optimum fusion, the fusion centre must incorporate signal-to-noise ratio values of cognitive users and the channel conditions. A genetic algorithm-based weighted optimisation strategy is presented for the case of soft decision combining. Numerical results show that the proposed optimised collaborative spectrum sensing schemes give better spectrum sensing performance

Distributed Diffusion-Based LMS for Node-Specific Adaptive Parameter Estimation

A distributed adaptive algorithm is proposed to solve a node-specific parameter estimation problem where nodes are interested in estimating parameters of local interest, parameters of common interest to a subset of nodes and parameters of global interest to the whole network. To address the different node-specific parameter estimation problems, this novel algorithm relies on a diffusion-based implementation of different Least Mean Squares (LMS) algorithms, each associated with the estimation of a specific set of local, common or global parameters. Coupled with the estimation of the different sets of parameters, the implementation of each LMS algorithm is only undertaken by the nodes of the network interested in a specific set of local, common or global parameters. The study of convergence in the mean sense reveals that the proposed algorithm is asymptotically unbiased. Moreover, a spatial-temporal energy conservation relation is provided to evaluate the steady-state performance at each node in the mean-square sense. Finally, the theoretical results and the effectiveness of the proposed technique are validated through computer simulations in the context of cooperative spectrum sensing in Cognitive Radio networks.Comment: 13 pages, 6 figure

Supplementary Material to “Distributed Consensus-based Weight Design for Cooperative Spectrum Sensing”

Abstract—This material is a supplement to the paper “Distributed Consensus-based Weight Design for Cooperative Spectrum Sensing”. Section 1 offers related literature review on cooperative spectrum sensing and consensus algorithms. Section 2 presents related notations and models of the consensus-based graph theory. Section 3 offers further analysis of the proposed spectrum sensing scheme including detection threshold settings and convergence properties in terms of detection performance. Section 4 presents the proofs for the convergence of the proposed consensus algorithm, and discusses the convergence of the proposed algorithm under random link failure network models. Section 5 shows additional simulation results