• Title/Summary/Keyword: cognitive relay system

Search Result 35, Processing Time 0.02 seconds

WLAN CR Coexistence Beacon Protocol for Cognitive Radio-Based WLAN Network (무선인지 기술을 이용한 차세대 WLAN 네트워크에서의 WLAN CR 공존 비콘 프로토콜)

  • Kim, Hyun-Ju;Yoo, Sang-Jo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.12B
    • /
    • pp.790-799
    • /
    • 2007
  • In this paper, we propose WLAN CR coexistence beacon protocol for thenext WLAN network. This method can provide WLAN with high-speed data rate in new WLAN architecture and network platform based on cognitive radio technology. WLAN CR devices that enter the CR network can know UHF channels by listening CR beacon including the coexistence parameter set and start using CR channel fast. During handover of WLAN device in UHF spectrums, WLAN device that lost their channel can change available channel by obtaining the current CR channel information from the CR beacon. In advance relaying coexistence parameter set to entire CR system, WLAN CR system can prepare own candidate channel set that is different with other CR system. In CR beacon and relay delay, we show the results that WLAN CR coexistence beacon protocol supports spectrum handover efficiently and decreases the probability of collision in candidate channel set.

Interference Cancellation Scheme for Three-hop Cooperative Relay Networks

  • Zhang, Yinghua;Wang, Lei;Liu, Jian;Peng, Yunfeng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.9
    • /
    • pp.4446-4462
    • /
    • 2019
  • In this paper, we focus on interference cancellation for three-hop cognitive radio networks (CRNs) over Rayleigh fading channels. In CRNs, secondary users (SUs) are allowed to opportunistically utilize the licensed spectrum during the idle time of primary users (PUs) to achieve spectrum sharing. However, the SUs maybe power constrained to avoid interference and cover a very short transmission range. We here propose an interference cancellation scheme (ICS) for three-hop CRNs to prolong the transmission range of SUs and improve their transmission efficiency. In the proposed scheme, a flexible transmission protocol is adopted to cancel the interference at both secondary relays and destinations at the same time. And a closed-form expression for the secondary outage probability over Rayleigh fading channels is derived to measure the system performance. Simulation results show that the proposed scheme can significantly reduce the secondary outage probability and increase the secondary diversity in comparison with the traditional cases.

An Analysis of Combining Methods in Cooperative Spectrum Sensing over Rayleigh Fading Channel

  • Truc, Tran Thanh;Kong, Hyung-Yun
    • Journal of electromagnetic engineering and science
    • /
    • v.10 no.3
    • /
    • pp.190-198
    • /
    • 2010
  • This paper evaluates the performance of two methods of spectrum sensing: the linear combining method and the selection combining method which is based on maximum SNR of sensing channel. We proposed a rule for global detection for the purpose of combating hidden terminal problems in spectrum sensing. Our analysis considers a situation when sensing channels experience the non-identically, independently distributed(n.i.d) Rayleigh fading. The average probabilities of global detection in these methods are derived and compared. In the scope of this paper, the reporting channels are assumed to be the AWGN channel with invariant and identical gain during the system's operation.

Hybrid Spectrum Sharing with Cooperative Secondary User Selection in Cognitive Radio Networks

  • Kader, Md. Fazlul;Asaduzzaman, Asaduzzaman;Hoque, Md. Moshiul
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.9
    • /
    • pp.2081-2100
    • /
    • 2013
  • In this paper, we propose a cooperative hybrid spectrum sharing protocol by jointly considering interweave (opportunistic) and underlay schemes. In the proposed protocol, secondary users can access the licensed spectrum along with the primary system. Our network scenario comprises a single primary transmitter-receiver (PTx-PRx) pair and a group of M secondary transmitter-receiver (STx-SRx) pairs within the transmission range of the primary system. Secondary transmitters are divided into two groups: active and inactive. A secondary transmitter that gets an opportunity to access the secondary spectrum is called "active". One of the idle or inactive secondary transmitters that achieves the primary request target rate $R_{PT}$ will be selected as a best decode-and-forward (DF) relay (Re) to forward the primary information when the data rate of the direct link between PTx and PRx falls below $R_{PT}$. We investigate the ergodic capacity and outage probability of the primary system with cooperative relaying and outage probability of the secondary system. Our theoretical and simulation results show that both the primary and secondary systems are able to achieve performance improvement in terms of outage probability. It is also shown that ergodic capacity and outage probability improve when the active secondary transmitter is located farther away from the PRx.

Distributed Matching Algorithms for Spectrum Access: A Comparative Study and Further Enhancements

  • Ali, Bakhtiar;Zamir, Nida;Ng, Soon Xin;Butt, Muhammad Fasih Uddin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.4
    • /
    • pp.1594-1617
    • /
    • 2018
  • In this paper, we consider a spectrum access scenario which consists of two groups of users, namely Primary Users (PUs) and Secondary Users (SUs) in Cooperative Cognitive Radio Networks (CCRNs). SUs cooperatively relay PUs messages based on Amplify-and-Forward (AF) and Decode-and-Forward (DF) cooperative techniques, in exchange for accessing some of the spectrum for their secondary communications. From the literatures, we found that the Conventional Distributed Algorithm (CDA) and Pragmatic Distributed Algorithm (PDA) aim to maximize the PU sum-rate resulting in a lower sum-rate for the SU. In this contribution, we have investigated a suit of distributed matching algorithms. More specifically, we investigated SU-based CDA (CDA-SU) and SU-based PDA (PDA-SU) that maximize the SU sum-rate. We have also proposed the All User-based PDA (PDA-ALL), for maximizing the sum-rates of both PU and SU groups. A comparative study of CDA, PDA, CDA-SU, PDA-SU and PDA-ALL is conducted, and the strength of each scheme is highlighted. Different schemes may be suitable for different applications. All schemes are investigated under the idealistic scenario involving perfect coding and perfect modulation, as well as under practical scenario involving actual coding and actual modulation. Explicitly, our practical scenario considers the adaptive coded modulation based DF schemes for transmission flexibility and efficiency. More specifically, we have considered the Self-Concatenated Convolutional Code (SECCC), which exhibits low complexity, since it invokes only a single encoder and a single decoder. Furthermore, puncturing has been employed for enhancing the bandwidth efficiency of SECCC. As another enhancement, physical layer security has been applied to our system by introducing a unique Advanced Encryption Standard (AES) based puncturing to our SECCC scheme.