• Title/Summary/Keyword: Cognitive radio networks (CRNs)

Search Result 43, Processing Time 0.016 seconds

Cooperative Relaying with Interference Cancellation for Secondary Spectrum Access

  • Dai, Zeyang;Liu, Jian;Long, Keping
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.10
    • /
    • pp.2455-2472
    • /
    • 2012
  • Although underlay spectrum sharing has been shown as a promising technique to promote the spectrum utilization in cognitive radio networks (CRNs), it may suffer bad secondary performance due to the strict power constraints imposed at secondary systems and the interference from primary systems. In this paper, we propose a two-phase based cooperative transmission protocol with the interference cancellation (IC) and best-relay selection to improve the secondary performance in underlay models under stringent power constraints while ensuring the primary quality-of-service (QoS). In the proposed protocol, IC is employed at both the secondary relays and the secondary destination, where the IC-based best-relay selection and cooperative relaying schemes are well developed to reduce the interference from primary systems. The closed-form expression of secondary outage probability is derived for the proposed protocol over Rayleigh fading channels. Simulation results show that, with a guaranteed primary outage probability, the proposed protocol can achieve not only lower secondary outage probability but also higher secondary diversity order than the traditional underlay case.

Computation of an Equilibrium in Spectrum Markets for Cognitive Radio Networks (인지무선네트워크를 위한 스펙트럼 마켓에서 평형상태 계산)

  • Byun, Sang-Seon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2016.10a
    • /
    • pp.197-199
    • /
    • 2016
  • In this paper, we investigate a market equilibrium in multi-channel sharing cognitive radio networks (CRNs): it is assumed that every subchannel is orthogonally licensed to a single primary user (PU), and can be shared with multiple secondary users (SUs). We model this sharing as a spectrum market where PUs offer SUs their subchannels with limiting the interference from SUs; the SUs purchase the right to transmit over the subchannels while observing the interference limits set by the PUs and their budget constraints. The utility function of SU is defined as least achievable transmission rate, and that of PU is given by the net profit. We define a market equilibrium in the context of extended Fisher model, and show that the equilibrium is yielded by solving an optimization problem, Eisenberg-Gale convex program.

  • PDF

A Novel Grasshopper Optimization-based Particle Swarm Algorithm for Effective Spectrum Sensing in Cognitive Radio Networks

  • Ashok, J;Sowmia, KR;Jayashree, K;Priya, Vijay
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.2
    • /
    • pp.520-541
    • /
    • 2023
  • In CRNs, SS is of utmost significance. Every CR user generates a sensing report during the training phase beneath various circumstances, and depending on a collective process, either communicates or remains silent. In the training stage, the fusion centre combines the local judgments made by CR users by a majority vote, and then returns a final conclusion to every CR user. Enough data regarding the environment, including the activity of PU and every CR's response to that activity, is acquired and sensing classes are created during the training stage. Every CR user compares their most recent sensing report to the previous sensing classes during the classification stage, and distance vectors are generated. The posterior probability of every sensing class is derived on the basis of quantitative data, and the sensing report is then classified as either signifying the presence or absence of PU. The ISVM technique is utilized to compute the quantitative variables necessary to compute the posterior probability. Here, the iterations of SVM are tuned by novel GO-PSA by combining GOA and PSO. Novel GO-PSA is developed since it overcomes the problem of computational complexity, returns minimum error, and also saves time when compared with various state-of-the-art algorithms. The dependability of every CR user is taken into consideration as these local choices are then integrated at the fusion centre utilizing an innovative decision combination technique. Depending on the collective choice, the CR users will then communicate or remain silent.