• Title/Summary/Keyword: Cognitive Radio Networks

Search Result 393, Processing Time 0.023 seconds

Simultaneous Information and Power Transfer for Multi-antenna Primary-Secondary Cooperation in Cognitive Radio Networks

  • Liu, Zhi Hui;Xu, Wen Jun;Li, Sheng Yu;Long, Cheng Zhi;Lin, Jia Ru
    • ETRI Journal
    • /
    • v.38 no.5
    • /
    • pp.941-951
    • /
    • 2016
  • In this paper, cognitive radio and simultaneous wireless information and power transfer (SWIPT) are effectively combined to design a spectrum-efficient and energy-efficient transmission paradigm. Specifically, a novel SWIPT-based primary-secondary cooperation model is proposed to increase the transmission rate of energy/spectrum constrained users. In the proposed model, a multi-antenna secondary user conducts simultaneous energy harvesting and information forwarding by means of power splitting (PS), and tries to maximize its own transmission rate under the premise of successfully assisting the data delivery of the primary user. After the problem formulation, joint power splitting and beamforming optimization algorithms for decode-and-forward and amplify-and-forward modes are presented, in which we obtain the optimal PS factor and beamforming vectors using a golden search method and dual methods. Simulation results show that the proposed SWIPTbased primary-secondary cooperation schemes can obtain a much higher level of performance than that of non-SWIPT cooperation and non-cooperation schemes.

Adaptive Cooperative Spectrum Sharing Based on Fairness and Total Profit in Cognitive Radio Networks

  • Chen, Jian;Zhang, Xiao;Kuo, Yonghong
    • ETRI Journal
    • /
    • v.32 no.4
    • /
    • pp.512-519
    • /
    • 2010
  • A cooperative model is presented to enable sharing of the spectrum with secondary users. Compared with the optimal model and competitive model, the cooperative model could reach the maximum total profit for secondary users with better fairness. The cooperative model is built based on the Nash equilibrium. Then a conceding factor is introduced so that the total spectrum required from secondary users will decrease. It also results in a decrease in cost which the primary user charges to the secondary users. The optimum solution, which is the maximum total profit for the secondary users, is called the collusion state. It is possible that secondary users may leave the collusion state to pursue the maximum of individual profit. The stability of the algorithm is discussed by introducing a vindictive factor to inhabit the motive of deviation. In practice, the number of secondary users may change. Adaptive methods have been used to deal with the changing number of secondary users. Both the total profit and fairness are considered in the spectrum allocating. The shared spectrum is 11.3893 with a total profit of 65.2378 in the competitive model. In the cooperative model, the shared spectrum is 8.5856 with the total profit of 73.4963. The numerical results reveal the effectiveness of the cooperative model.

Adaptive Cooperative Spectrum Sensing Based on SNR Estimation in Cognitive Radio Networks

  • Ni, Shuiping;Chang, Huigang;Xu, Yuping
    • Journal of Information Processing Systems
    • /
    • v.15 no.3
    • /
    • pp.604-615
    • /
    • 2019
  • Single-user spectrum sensing is susceptible to multipath effects, shadow effects, hidden terminals and other unfavorable factors, leading to misjudgment of perceived results. In order to increase the detection accuracy and reduce spectrum sensing cost, we propose an adaptive cooperative sensing strategy based on an estimated signal-to-noise ratio (SNR). Which can adaptive select different sensing strategy during the local sensing phase. When the estimated SNR is higher than the selection threshold, adaptive double threshold energy detector (ED) is implemented, otherwise cyclostationary feature detector is performed. Due to the fact that only a better sensing strategy is implemented in a period, the detection accuracy is improved under the condition of low SNR with low complexity. The local sensing node transmits the perceived results through the control channel to the fusion center (FC), and uses voting rule to make the hard decision. Thus the transmission bandwidth is effectively saved. Simulation results show that the proposed scheme can effectively improve the system detection probability, shorten the average sensing time, and has better robustness without largely increasing the costs of sensing system.

Throughput and Interference for Cooperative Spectrum Sensing: A Malicious Perspective

  • Gan, Jipeng;Wu, Jun;Zhang, Jia;Chen, Zehao;Chen, Ze
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.11
    • /
    • pp.4224-4243
    • /
    • 2021
  • Cognitive radio (CR) is a feasible intelligent technology and can be used as an effective solution to spectrum scarcity and underutilization. As the key function of CR, cooperative spectrum sensing (CSS) is able to effectively prevent the harmful interference with primary users (PUs) and identify the available spectrum resources by exploiting the spatial diversity of multiple secondary users (SUs). However, the open nature of the cognitive radio networks (CRNs) framework makes CSS face many security threats, such as, the malicious user (MU) launches Byzantine attack to undermine CRNs. For this aim, we make an in-depth analysis of the motive and purpose from the MU's perspective in the interweave CR system, aiming to provide the future guideline for defense strategies. First, we formulate a dynamic Byzantine attack model by analyzing Byzantine behaviors in the process of CSS. On the basis of this, we further make an investigation on the condition of making the fusion center (FC) blind when the fusion rule is unknown for the MU. Moreover, the throughput and interference to the primary network are taken into consideration to evaluate the impact of Byzantine attack on the interweave CR system, and then analyze the optimal strategy of Byzantine attack when the fusion rule is known. Finally, theoretical proofs and simulation results verify the correctness and effectiveness of analyses about the impact of Byzantine attack strategy on the throughput and interference.

Optimal Utilization of a Cognitive Shared Channel with a Rechargeable Primary Source Node

  • Pappas, Nikolaos;Jeon, Jeong-Ho;Ephremides, Anthony;Traganitis, Apostolos
    • Journal of Communications and Networks
    • /
    • v.14 no.2
    • /
    • pp.162-168
    • /
    • 2012
  • This paper considers the scenario in which a set of nodes share a common channel. Some nodes have a rechargeable battery and the others are plugged to a reliable power supply and, thus, have no energy limitations. We consider two source-destination pairs and apply the concept of cognitive radio communication in sharing the common channel. Specifically, we give high-priority to the energy-constrained source-destination pair, i.e., primary pair, and low-priority to the pair which is free from such constraint, i.e., secondary pair. In contrast to the traditional notion of cognitive radio, in which the secondary transmitter is required to relinquish the channel as soon as the primary is detected, the secondary transmitter not only utilizes the idle slots of primary pair but also transmits along with the primary transmitter with probability p. This is possible because we consider the general multi-packet reception model. Given the requirement on the primary pair's throughput, the probability p is chosen to maximize the secondary pair's throughput. To this end, we obtain two-dimensional maximum stable throughput region which describes the theoretical limit on rates that we can push into the network while maintaining the queues in the network to be stable. The result is obtained for both cases in which the capacity of the battery at the primary node is infinite and also finite.

Performance Evaluation of User Mobility Management Scheme based-on Dwell Time Optimization for Effective Inter-working with Heterogeneous Networks under Cognitive Networking Environments (인지 네트워킹 환경 하에서 체류시간 관리 최적화를 통한 사용자 이동성 모델 기반 이동성 관리방법의 성능평가)

  • Choi, Yu-Mi;Kim, Jeong-Ho
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.49 no.5
    • /
    • pp.77-83
    • /
    • 2012
  • The importance of mobility management is becoming to be one of the upcomming issues to be addressed to provide the converged services and the convergence of the heterogeneous network environments. In this paper, the new user mobility management scheme which can be utilized to model the user's mobility behaviors for interworking with heterogeneous overlay convergent networks under the time-varying radio propagation environment has been proposed. Thus user mobility management scheme based on user mobility model is considered in order to optimize the dwell time of users in the overlay convergent networks. This Mobile IP user mobility management will be very useful to model the user mobility behaviors and can be used to estimate the signaling traffic and frequency spectrum demands for massive data transfer for the heterogeneous overlay convergent networks.

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.

ECMA-392 Cooperative MAC Protocol for QoS Guarantee in Multi-Hop Wireless Bridge in Ship Area (선박 내 멀티 홉 무선 브릿지에서 QoS 보장을 위한 ECMA-392 협력 MAC 프로토콜)

  • Lee, Seung Beom;Jeong, Hwan-Jong;Jeong, Min-A;Lee, Yeonwoo;Lee, Seong Ro
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39C no.12
    • /
    • pp.1289-1297
    • /
    • 2014
  • In this paper, we use the ECMA-392 standard, the first cognitive radio networks to meet the demand for IT services in the ship. We propose a ECMA-392 cooperative MAC protocol to ensure QoS to support multimedia services in the ship area in a multi-hop wireless bridge using ECMA-392 networks. Because the proposed protocol transmits directly or relay transmission by selecting efficient routes based on the information of the ECMA-392 devices, it provides communication to ensure QoS of the device. The simulation results show that the proposed cooperative MAC protocol improves a throughput of devices compared to the existing method.

Channel Resource Allocation Scheme Provided for Fair QoS in ECMA-392-Based Ship Area Networks (ECMA-392 기반 선박 내 네트워크에서 Fair QoS 제공을 위한 채널 자원 할당 방안)

  • Lee, Seung Beom;Back, Jong Sang;Park, Soonyoung;Lee, Seong Ro
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39C no.12
    • /
    • pp.1280-1288
    • /
    • 2014
  • In this paper, we use the ECMA-392 standard, the first cognitive radio networks to meet the demand for IT services in the ship. First, we learn about ECMA-392-based network and examine the consideration and the problems for assigning channels to the device. And, we propose a fair channel resource allocation to ensure efficiently channel required by device groups in ECMA-392 MAC protocol. This is a method to reallocate the channels fairly with considering the channel assignment parameters to a new device group and existing device groups. The simulation results show that the proposed scheme improves throughputs compared to the existing one.

Performance of Detection Probability with Adaptive Threshold Algorithm for CR Based on Ad-Hoc Network (인지 무선 기반 애드 혹 네트워크에서 적응적 임계치 알고리즘을 이용한 센싱 성능)

  • Lee, Kyung-Sun;Kim, Yoon-Hyun;Kim, Jin-Young
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.23 no.5
    • /
    • pp.632-639
    • /
    • 2012
  • Ad-hoc networks can be used various environment, which it is difficult to construct infrastructures, such as shadowing areas, disaster areas, war area, and so on. In order to support to considerable and various wireless services, more spectrum resources are needed. However, efficient utilization of the frequency resource is difficult because of spectrum scarcity and the conventional frequency regulation. Ad-hoc networks employing cognitive radio(CR) system that guarantee high spectrum utilization provide effective way to increase the network capacity. In conventional CR based ad-hoc network, it uses constant threshold value to detect primary user signal, so the results become not reliable. In this paper, to solve this problem, we apply adaptive threshold value to the CR based ad-hoc network, and adaptive threshold is immediately changed by SNR(Signal to Noise Ratio). From the simulation results, we confirmed that proposed algorithm has the greatly better detection probabilities than conventional CR based ad-hoc network.