• Title/Summary/Keyword: Cognitive relay networks

Search Result 45, Processing Time 0.027 seconds

Optimal sensing period in cooperative relay cognitive radio networks

  • Zhang, Shibing;Guo, Xin;Zhang, Xiaoge;Qiu, Gongan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.12
    • /
    • pp.5249-5267
    • /
    • 2016
  • Cognitive radio is an efficient technique to improve spectrum efficiency and relieve the pressure of spectrum resources. In this paper, we investigate the spectrum sensing period in cooperative relay cognitive radio networks; analyze the relationship between the available capacity and the signal-to-noise ratio of the received signal of second users, the target probability of detection and the active probability of primary users. Finally, we derive the closed form expression of the optimal spectrum sensing period in terms of maximum throughput. We simulate the probability of false alarm and available capacity of cognitive radio networks and compare optimal spectrum sensing period scheme with fixed sensing period one in these performance. Simulation results show that the optimal sensing period makes the cognitive networks achieve the higher throughput and better spectrum sensing performance than the fixed sensing period does. Cooperative relay cognitive radio networks with optimal spectrum sensing period can achieve the high capacity and steady probability of false alarm in different target probability of detection. It provides a valuable reference for choosing the optimal spectrum sensing period in cooperative relay cognitive radio networks.

Optimal Power Allocation and Relay Selection for Cognitive Relay Networks using Non-orthogonal Cooperative Protocol

  • Lan, Peng;Chen, Lizhen;Zhang, Guowei;Sun, Fenggang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.5
    • /
    • pp.2047-2066
    • /
    • 2016
  • In this paper, we investigate joint power allocation and relay selection (PARS) schemes in non-orthogonal cooperative protocol (NOCP) based cognitive relay networks. Generally, NOCP outperforms the orthogonal cooperative protocol (OCP), since it can provide more transmit diversity. However, most existing PARS schemes in cognitive relay networks focus on OCP, which are not suitable for NOCP. In the context of NOCP, we first derive the joint constraints of transmit power limit for secondary user (SU) and interference constraint for primary user (PU). Then we formulate optimization problems under the aforementioned constraints to maximize the capacity of SU in amplify-and-forward (AF) and decode-and-forward (DF) modes, respectively. Correspondingly, we derive the closed form solutions with respect to different parameters. Numerical results are provided to verify the performance improvement of the proposed PARS schemes.

Optimization Algorithm for Spectrum Sensing Delay Time in Cognitive Radio Networks Using Decoding Forward Relay

  • Xia, Kaili;Jiang, Xianyang;Yao, Yingbiao;Tang, Xianghong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.3
    • /
    • pp.1301-1312
    • /
    • 2020
  • Using decode-and-forward relaying in the cognitive radio networks, the spectrum efficiency can improve furthermore. The optimization algorithm of the spectrum sensing estimation time is presented for the cognitive relay networks in this paper. The longer sensing time will bring two aspects of the consequences. On the one hand, the channel parameters are estimated more accurate so as to reduce the interferences to the authorized users and to improve the throughput of the cognitive users. On the other hand, it shortens the transmission time so as to decease the system throughput. In this time, it exists an optimal sensing time to maximize the throughput. The channel state information of the sub-bands is considered as the exponentially distributed, so a stochastic programming method is proposed to optimize the sensing time for the cognitive relay networks. The computer simulation results using the Matlab software show that the algorithm is effective, which has a certain engineering application value.

Spectrum Sharing-Based Multi-Hop Decode-and-Forward Relay Networks under Interference Constraints: Performance Analysis and Relay Position Optimization

  • Bao, Vo Nguyen Quoc;Thanh, Tran Thien;Nguyen, Tuan Duc;Vu, Thanh Dinh
    • Journal of Communications and Networks
    • /
    • v.15 no.3
    • /
    • pp.266-275
    • /
    • 2013
  • The exact closed-form expressions for outage probability and bit error rate of spectrum sharing-based multi-hop decode-and-forward (DF) relay networks in non-identical Rayleigh fading channels are derived. We also provide the approximate closed-form expression for the system ergodic capacity. Utilizing these tractable analytical formulas, we can study the impact of key network parameters on the performance of cognitive multi-hop relay networks under interference constraints. Using a linear network model, we derive an optimum relay position scheme by numerically solving an optimization problem of balancing average signal-to-noise ratio (SNR) of each hop. The numerical results show that the optimal scheme leads to SNR performance gains of more than 1 dB. All the analytical expressions are verified by Monte-Carlo simulations confirming the advantage of multihop DF relaying networks in cognitive environments.

Bit Error Rate of Underlay Decode-and-Forward Cognitive Networks with Best Relay Selection

  • Ho-Van, Khuong;Sofotasios, Paschalis C.;Alexandropoulos, George C.;Freear, Steven
    • Journal of Communications and Networks
    • /
    • v.17 no.2
    • /
    • pp.162-171
    • /
    • 2015
  • This paper provides an analytic performance evaluation of the bit error rate (BER) of underlay decode-and-forward cognitive networks with best relay selection over Rayleigh multipath fading channels. A generalized BER expression valid for arbitrary operational parameters is firstly presented in the form of a single integral, which is then employed for determining the diversity order and coding gain for different best relay selection scenarios. Furthermore, a novel and highly accurate closed-form approximate BER expression is derived for the specific case where relays are located relatively close to each other. The presented results are rather convenient to handle both analytically and numerically, while they are shown to be in good agreement with results from respective computer simulations. In addition, it is shown that as in the case of conventional relaying networks, the behaviour of underlay relaying cognitive networks with best relay selection depends significantly on the number of involved relays.

Energy-Efficient Base Station Sleep Scheduling in Relay-Assisted Cellular Networks

  • Chen, Hongbin;Zhang, Qiong;Zhao, Feng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.3
    • /
    • pp.1074-1086
    • /
    • 2015
  • We Relay-assisted cellular network architecture has been developed to cover cell-edge users and to improve capacity. However, the deployment of relay stations (RSs) in cellular networks may increase the total energy consumption. Though energy efficiency has become a major concern in cellular networks, little work has studied the energy efficiency of relay-assisted cellular networks by sleep scheduling. In this paper, a distributed base stations (BSs) sleep scheduling scheme in relay-assisted cellular networks is proposed. The goal is to maximize the energy efficiency under the spectral efficiency constraint. Firstly, whether the BSs should be sleeping or active is determined by the traffic profile. Then, the transmission powers of the active BSs are optimized within the game-theoretic framework, by using an interior-point method, so as to maximize the energy efficiency. Simulation results demonstrate that the effectiveness of the proposed scheme is superior to that turning on all the BSs without sleep scheduling.

Exact Outage Probability Analysis of Proactive Relay Selection in Cognitive Radio Networks with MRC Receivers

  • Ho-Van, Khuong
    • Journal of Communications and Networks
    • /
    • v.18 no.3
    • /
    • pp.288-298
    • /
    • 2016
  • Proactive relay selection in cognitive radio networks has recently received considerable attention. However, its outage probability analysis is limited to partially-identical fading distributions, uncorrelation among received signal-to-noise ratios (SNRs), and no direct channel. This paper completes this literature deficiency by generalizing the existing analysis for non-identical fading distributions, correlation among received SNRs, and with direct channel. Numerous results demonstrate that relay selection with a direct channel achieves a higher diversity order and superior performance than that without a direct channel at virtually no cost of power and bandwidth. Further, proactive relay selection suffers an error floor at either a large maximum transmit power or large maximum interference power; however, the error floor level can be significantly remedied with an increase in the number of relays.

Secrecy Performances of Multicast Underlay Cognitive Protocols with Partial Relay Selection and without Eavesdropper's Information

  • Duy, Tran Trung;Son, Pham Ngoc
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.11
    • /
    • pp.4623-4643
    • /
    • 2015
  • This paper considers physical-layer security protocols in multicast cognitive radio (CR) networks. In particular, we propose dual-hop cooperative decode-and-forward (DF) and randomize-and-forward (RF) schemes using partial relay selection method to enhance secrecy performance for secondary networks. In the DF protocol, the secondary relay would use same codebook with the secondary source to forward the source's signals to the secondary destination. Hence, the secondary eavesdropper can employ either maximal-ratio combining (MRC) or selection combining (SC) to combine signals received from the source and the selected relay. In RF protocol, different codebooks are used by the source and the relay to forward the source message secretly. For each scheme, we derive exact and asymptotic closed-form expressions of secrecy outage probability (SOP), non-zero secrecy capacity probability (NzSCP) in both independent and identically distributed (i.i.d.) and independent but non-identically distributed (i.n.i.d.) networks. Moreover, we also give a unified formula in an integral form for average secrecy capacity (ASC). Finally, our derivations are then validated by Monte-Carlo simulations.

Cognitive Relay Networks with Underlay Spectrum Sharing and Channel Estimation Error: Interference Probability and BER Analysis

  • Ho-Van, Khuong
    • Journal of Communications and Networks
    • /
    • v.16 no.3
    • /
    • pp.301-304
    • /
    • 2014
  • This paper proposes accurate interference probability and bit error rate formulas for cognitive relay networks with underlay spectrum sharing and channel estimation error (CEE). Numerous results reveal that the CEE not only degrades the performance of secondary systems (SSs) but also increases interference power caused by SSs to primary systems (PSs), eventually unfavorable to both systems. A solution to further protect PSs from this effect through reducing the power of secondary transmitters is investigated and analyzed.

Adaptive Cooperation for Bidirectional Communication in Cognitive Radio Networks

  • Gao, Yuan;Zhu, Changping;Deng, Zhixiang;Tang, Yibin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.3
    • /
    • pp.1279-1300
    • /
    • 2017
  • In the interweave cognitive networks, the interference from the primary user degrades the performance of the cognitive user transmissions. In this paper, we propose an adaptive cooperation scheme in the interweave cognitive networks to improve the performance of the cognitive user transmissions. In the proposed scheme for the bidirectional communication of two end-source cognitive users, the bidirectional communication is completed through the non-relay direct transmission, the one-way relaying cooperation transmission, and the two-way relaying cooperation transmission depending on the limited feedback from the end-sources. For the performance analysis of the proposed scheme, we derive the outage probability and the finite-SNR diversity multiplexing tradeoff (f-DMT) in a closed form, considering the imperfect spectrum sensing, the interference from the primary user, and the power allocation between the relay and the end-sources. The results show that compared with the direct transmissions (DT), the pure one-way relaying transmissions (POWRT), and the pure two-way relaying transmissions (PTWRT), the proposed scheme has better outage performance. In terms of the f-DMT, the proposed scheme outperforms the full cooperation transmissions of the POWRT and PTWRT.