3,318 research outputs found

    Cooperative Wideband Spectrum Sensing Based on Joint Sparsity

    Get PDF
    COOPERATIVE WIDEBAND SPECTRUM SENSING BASED ON JOINT SPARSITY By Ghazaleh Jowkar, Master of Science A thesis submitted in partial fulfillment of the requirements for the degree of Master of Science at Virginia Commonwealth University Virginia Commonwealth University 2017 Major Director: Dr. Ruixin Niu, Associate Professor of Department of Electrical and Computer Engineering In this thesis, the problem of wideband spectrum sensing in cognitive radio (CR) networks using sub-Nyquist sampling and sparse signal processing techniques is investigated. To mitigate multi-path fading, it is assumed that a group of spatially dispersed SUs collaborate for wideband spectrum sensing, to determine whether or not a channel is occupied by a primary user (PU). Due to the underutilization of the spectrum by the PUs, the spectrum matrix has only a small number of non-zero rows. In existing state-of-the-art approaches, the spectrum sensing problem was solved using the low-rank matrix completion technique involving matrix nuclear-norm minimization. Motivated by the fact that the spectrum matrix is not only low-rank, but also sparse, a spectrum sensing approach is proposed based on minimizing a mixed-norm of the spectrum matrix instead of low-rank matrix completion to promote the joint sparsity among the column vectors of the spectrum matrix. Simulation results are obtained, which demonstrate that the proposed mixed-norm minimization approach outperforms the low-rank matrix completion based approach, in terms of the PU detection performance. Further we used mixed-norm minimization model in multi time frame detection. Simulation results shows that increasing the number of time frames will increase the detection performance, however, by increasing the number of time frames after a number of times the performance decrease dramatically

    Coalition Formation Games for Collaborative Spectrum Sensing

    Full text link
    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

    Comprehensive survey on quality of service provisioning approaches in cognitive radio networks : part one

    Get PDF
    Much interest in Cognitive Radio Networks (CRNs) has been raised recently by enabling unlicensed (secondary) users to utilize the unused portions of the licensed spectrum. CRN utilization of residual spectrum bands of Primary (licensed) Networks (PNs) must avoid harmful interference to the users of PNs and other overlapping CRNs. The coexisting of CRNs depends on four components: Spectrum Sensing, Spectrum Decision, Spectrum Sharing, and Spectrum Mobility. Various approaches have been proposed to improve Quality of Service (QoS) provisioning in CRNs within fluctuating spectrum availability. However, CRN implementation poses many technical challenges due to a sporadic usage of licensed spectrum bands, which will be increased after deploying CRNs. Unlike traditional surveys of CRNs, this paper addresses QoS provisioning approaches of CRN components and provides an up-to-date comprehensive survey of the recent improvement in these approaches. Major features of the open research challenges of each approach are investigated. Due to the extensive nature of the topic, this paper is the first part of the survey which investigates QoS approaches on spectrum sensing and decision components respectively. The remaining approaches of spectrum sharing and mobility components will be investigated in the next part

    DYNAMIC SMART GRID COMMUNICATION PARAMETERS BASED COGNITIVE RADIO NETWORK

    Get PDF
    The demand for more spectrums in a smart grid communication network is a significant challenge in originally scarce spectrum resources. Cognitive radio (CR) is a powerful technique for solving the spectrum scarcity problem by adapting the transmission parameters according to predefined objectives in an active wireless communication network. This paper presents a cognitive radio decision engine that dynamically selects optimal radio transmission parameters for wireless home area networks (HAN) of smart grid applications via the multi-objective differential evolution (MODE) optimization method. The proposed system helps to drive optimal communication parameters to realize power saving, maximum throughput and minimum bit error rate communication modes. A differential evolution algorithm is used to select the optimal transmission parameters for given communication modes based on a fitness function that combines multiple objectives based on appropriate weights. Simulation results highlight the superiority of the proposed system in terms of accuracy and convergence as compared with other evolution algorithms (genetic optimization, particle swarm optimization, and ant colony optimization) for different communication modes (power saving mode, high throughput mode, emergency communication mode, and balanced mode)

    Survey on Optimization Methods For Spectrum Sensing in Cognitive Radio Network

    Full text link
    A cognitive radio is a capable Technology, which has provided a great innovation in wireless communication system as to improve the efficiency of the electromagnetic spectrum utilization in wireless network. The technology allows unlicensed user or secondary user to use the vacant spectrum of licensed user through dynamic channel assignment strategies to improve the spectral utilization and hence cognitive radio avoids spectrum shortage. Cooperative sensing is one of the fastest growing areas of research and it is likely to be a key enabling technology, for efficiently spectrum sensing in future. For this several spectrum sensing are available, which can detect the white spaces or spectrum holes and share them to the secondary user without interfering with the movement of licensed user. In order to reliably and swiftly detect spectrum holes in cognitive radios, optimization must be used. In this paper we study different optimization for spectrum searching and sharing and also compare this optimization on the basis of probability of total error on fading channel
    corecore