• Title/Summary/Keyword: Cognitive Radio Networks

Search Result 393, Processing Time 0.025 seconds

An Efficient Routing Protocol Considering Path Reliability in Cognitive Radio Ad-hoc Networks (인지 무선 애드혹 네트워크에서 경로 신뢰성을 고려한 효율적인 라우팅 기법)

  • Choi, Jun-Ho;Yoo, Sang-Jo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39B no.11
    • /
    • pp.730-742
    • /
    • 2014
  • In the case of On-demand routing protocol in cognitive radio ad-hoc networks, broadcasting of control packets may occur common control channel overload and packet collisions during the routing procedure. This situation is to increase the overhead of path finding and also limited to find the accurate and reliable path. Since reliable channel and path finding is restricted, path life time is shorten and path reliability is reduced. In this paper, we propose a new routing algorithm that reduces control channel overhead and increases path life time by considering the probability of appearance of primary user and channel status of neighbor nodes. Each node performs periodic local sensing to detect primary user signal and to derive primary user activity patterns. The probability of primary appearance on the current channel and the channel status can be obtained based on the periodic sensing. In addition, each node identifies the quality of the channel by message exchange through a common channel with neighbor nodes, then determines Link_Levels with neighbor nodes. In the proposed method, the Link Level condition reduces the number of control messages that are generated during the route discovery process. The proposed method can improve path life time by choosing a path through Path_Reliability in which stability and quality are weighted depending on the location. Through simulation, we show that our proposed algorithm reduces packet collisions and increases path life time in comparison with the traditional algorithm.

Performance Analysis of Cognitive Relay Networks with Multiple Primary Users (다수의 주 사용자가 존재하는 무선인지 네트워크의 중계 전송 성능 평가)

  • Lee, Je-Min;Wang, Han-O;Noh, Go-San;Hong, Dae-Sik
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.47 no.5
    • /
    • pp.25-32
    • /
    • 2010
  • This paper evaluates the outage probability of cognitive relay networks with cooperation between secondary users based on the underlay approach, when multiple primary receivers coexist with secondary users. Using an appropriate relay selection criterion in cognitive radio networks, we derive the outage probability of secondary user. It is shown that the outage probability increases as the number of primary receivers increases and we quantify the increase. Through the simulation results, we verify that the performance of relaying transmission is varied more sensitively compared to that of direct transmission as the number of primary receivers increases. In addition, the relaying transmission can be less efficient than the direct transmission when multiple primary receiver exist but it can be more efficient than the direct transmission by increasing the relay selection diversity.

Analysis of Joint Multiband Sensing-Time M-QAM Signal Detection in Cognitive Radios

  • Tariq, Sana;Ghafoor, Abdul;Farooq, Salma Zainab
    • ETRI Journal
    • /
    • v.34 no.6
    • /
    • pp.892-899
    • /
    • 2012
  • We analyze a wideband spectrum in a cognitive radio (CR) network by employing the optimal adaptive multiband sensing-time joint detection framework. This framework detects a wideband M-ary quadrature amplitude modulation (M-QAM) primary signal over multiple nonoverlapping narrowband Gaussian channels, using the energy detection technique so as to maximize the throughput in CR networks while limiting interference with the primary network. The signal detection problem is formulated as an optimization problem to maximize the aggregate achievable secondary throughput capacity by jointly optimizing the sensing duration and individual detection thresholds under the overall interference imposed on the primary network. It is shown that the detection problems can be solved as convex optimization problems if certain practical constraints are applied. Simulation results show that the framework under consideration achieves much better performance for M-QAM than for binary phase-shift keying or any real modulation scheme.

Outage Performance of Cooperative Cognitive Wireless Relay Networks with Delayed CSI (CSI 지연이 있는 상황 인지 무선 협동 릴레이 네트워크의 오수신율)

  • Kim, Nam-Soo
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.6
    • /
    • pp.19-25
    • /
    • 2009
  • The performance of a cognitive radio system with cooperative diversity which includes the direct and indirect path is analysed. The selection relay cooperation which selects the best relay, the relay with the best received signal-to-noise ratio(SNR) in destination node, is considered and derived the performance degradation caused by the CSI(Channel State Information) delay analytically. Numerical examples show that the cooperative diversity which have the direct and the indirect paths effectively improves the system performance in Rayleigh fading; the performance improves 4.4 dB with 1/10 of SNR of the indirect path. And the system performance is more degraded with the less frequency acquisition probability and with the high CSI delay.

Channel Statistical MAC Protocol for Cognitive Radio

  • Xiang, Gao;Zhu, Wenmin;Park, Hyung-Kun
    • Journal of information and communication convergence engineering
    • /
    • v.8 no.1
    • /
    • pp.40-44
    • /
    • 2010
  • opportunistic spectrum access (OSA) allows unlicensed users to share licensed spectrum in space and time with no or little interference to primary users, with bring new research challenges in MAC design. We propose a cognitive MAC protocol using statistical channel information and selecting appropriate idle channel for transmission. The protocol based on the CSMA/CA, exploits statistics of spectrum usage for decision making on channel access. Idle channel availability, spectrum hole sufficiency and available channel condition will be included in algorithm statistical information. The model include the control channel and data channel, the transmitter negotiates with receiver on transmission parameters through control channel, statistical decision results (successful rate of transmission) from exchanged transmission parameters of control channel should pass the threshold and decide the data transmission with spectrum hole on data channel. A dynamical sensing range as a important parameter introduced to maintain the our protocol performance. The proposed protocol's simulation will show that proposed protocol does improve the throughput performance via traditional opportunistic spectrum access MAC protocol.

Fast Cooperative Sensing with Low Overhead in Cognitive Radios

  • Dai, Zeyang;Liu, Jian;Li, Yunji;Long, Keping
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.1
    • /
    • pp.58-73
    • /
    • 2014
  • As is well known, cooperative sensing can significantly improve the sensing accuracy as compared to local sensing in cognitive radio networks (CRNs). However, a large number of cooperative secondary users (SUs) reporting their local detection results to the fusion center (FC) would cause much overhead, such as sensing delay and energy consumption. In this paper, we propose a fast cooperative sensing scheme, called double threshold fusion (DTF), to reduce the sensing overhead while satisfying a given sensing accuracy requirement. In DTF, FC respectively compares the number of successfully received local decisions and that of failed receptions with two different thresholds to make a final decision in each reporting sub-slot during a sensing process, where cooperative SUs sequentially report their local decisions in a selective fashion to reduce the reporting overhead. By jointly considering sequential detection and selective reporting techniques in DTF, the overhead of cooperative sensing can be significantly reduced. Besides, we study the performance optimization problems with different objectives for DTF and develop three optimum fusion rules accordingly. Simulation results reveal that DTF shows evident performance gains over an existing scheme.

An Efficient Multi-Channel MAC Protocol for Cognitive Ad-hoc Networks with Idle Nodes Assistance (무선 인지 애드 혹 네트워크를 위한 휴지 노드를 활용하는 효율적인 다중 채널 MAC 프로토콜)

  • Gautam, Dinesh;Koo, In-Soo
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.11 no.4
    • /
    • pp.39-45
    • /
    • 2011
  • In this paper, we propose an efficient multichannel MAC protocol with idle nodes assistance to avoid the multi-channel hidden terminal problem in cognitive radio ad hoc network and further to improve the performance of the network. The proposed MAC protocol can be applied to the cognitive radio adhoc network where every node is equipped with the single transceiver and one common control channel exists for control message negotiation. In the proposed protocol, the idle nodes available in the neighbour of communication nodes are utilized because the idle nodes have the information about the channels being utilized in their transmission range. Whenever the nodes are negotiating for the channel, idle nodes can help the transmitting and receiving nodes to select the free data channel for data transfer. With the proposed scheme, we can minimize the hidden terminal problem and decrease the collision between the secondary users when selecting the channel for data transfer. As a result, the performance of the network is increased.

Novel Incremental Spectrum Sensing in Cooperative Cognitive Radio Networks (협력 인지 통신 네트워크에서 새로운 증분형 스펙트럼 검출)

  • Ha, Nguyen Vu;Kong, Hyung-Yun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.9A
    • /
    • pp.859-867
    • /
    • 2010
  • In this paper, we consider a novel spectrum sensing system in which firstly, the fusion center (FC) senses and makes the own decision then if its sensing result is not useful for achieving the final decision, the local observations from the cognitive users (CUs) will be required. Moreover, in case that FC needs the results from CUs, we will choose only CU having the highest collected energy to send its local decision to FC. Based on this selecting method, the number of sensing bits can be reduced; hence, we can save the power and the bandwidth for reporting stage in the cognitive radio network (CRN). The mathematical analysis of the key metrics of the sensing schemes (probability of detection, false alarm, e.g.) will be investigated and confirmed by the Monte-Carlo simulation results to show the performance enhancement of the proposed schemes.

Price-based Resource Allocation for Virtualized Cognitive Radio Networks

  • Li, Qun;Xu, Ding
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.10
    • /
    • pp.4748-4765
    • /
    • 2016
  • We consider a virtualized cognitive radio (CR) network, where multiple virtual network operators (VNOs) who own different virtual cognitive base stations (VCBSs) share the same physical CBS (PCBS) which is owned by an infrastructure provider (InP), sharing the spectrum with the primary user (PU). The uplink scenario is considered where the secondary users (SUs) transmit to the VCBSs. The PU is protected by constraining the interference power from the SUs. Such constraint is applied by the InP through pricing the interference. A Stackelberg game is formulated to jointly maximize the revenue of the InP and the individual utilities of the VNOs, and then the Stackelberg equilibrium is investigated. Specifically, the optimal interference price and channel allocation for the VNOs to maximize the revenue of the InP and the optimal power allocation for the SUs to maximize the individual utilities of the VNOs are derived. In addition, a low‐complexity ±‐optimal solution is also proposed for obtaining the interference price and channel allocation for the VNOs. Simulations are provided to verify the proposed strategies. It is shown that the proposed strategies are effective in resource allocation and the ±‐optimal strategy achieves practically the same performance as the optimal strategy can achieve. It is also shown that the InP will not benefit from a large interference power limit, and selecting VNOs with higher unit rate utility gain to share the resources of the InP is beneficial to both the InP and the VNOs.

Performance Analysis of Operation Strategy of Dual Virtual Cell-based System under The Overlay Convergent Networks of Cognitive Networking (인지 네트워킹 기반 중첩 융합 네트워크에서 이중 가상 셀 운영방안의 성능분석)

  • Choi, Yu-Mi;Kim, Jeong-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.6B
    • /
    • pp.483-488
    • /
    • 2012
  • With the fast growing data traffic, the performance of the convergent overlay network environment under the cognitive networking environment is crucial for the implementation of the efficient network structure. In order to achieve high capacity and reliable link quality in wireless communication of the overlay convergent networks with the cognitive networking based on the advanced capability of the mobile terminal, a Distributed Wireless Communication System (DWCS) can provide the capability of ambient-aware dual cell system's operation. This paper has considered virtual cell: the Dual Virtual Cell (DVC), and also proposes DVC employment strategy based on DWCS network. One is the Active Virtual Cell which exists for user's actual data traffic and the other is the Candidate Virtual Cell which contains a set of candidate antennas to protect user's link quality from performance degradation or interruption. The considered system constructs DVC by using cognitive ability of finding useful virtual signals. Also, for multi-user high-rate data transmission, the DWCS system exploits Space-Time Trellis Codes. The effects of changing environments on the system performance has been investigated thereafter.