• Title/Summary/Keyword: Cognitive networks

Search Result 533, Processing Time 0.02 seconds

Opportunistic Relaying Based Spectrum Leasing for Cognitive Radio Networks

  • Asaduzzaman, Asaduzzaman;Kong, Hyung-Yun;Koo, In-Soo
    • Journal of Communications and Networks
    • /
    • v.13 no.1
    • /
    • pp.50-55
    • /
    • 2011
  • Spectrum leasing for cognitive radio (CR) networks is an effective way to improve the spectrum utilization. This paper presents an opportunistic relaying based spectrum leasing for CR networks where the primary users lease their frequency band to the cognitive users. The cognitive users act as relays for the primary users to improve the channel capacity, and this improved capacity is used for the transmission of secondary users' data. We show that the cognitive users can use a significant portion of the communication resource of primary networks while maintaining a fixed target data rate for the primary users. Moreover, the primary network is also benefited by the cooperating cognitive users in terms of outage probability. Information theoretic analysis and simulation results are presented to evaluate the performances of both primary and cognitive networks.

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.

Game-Theoretic Optimization of Common Control Channel Establishment for Spectrum Efficiency in Cognitive Small Cell Network

  • Jiao Yan
    • International journal of advanced smart convergence
    • /
    • v.13 no.1
    • /
    • pp.1-11
    • /
    • 2024
  • Cognitive small cell networks, consisting of macro-cells and small cells, are foreseen as a promising candidate solution to address 5G spectrum scarcity. Recently, many technological issues (such as spectrum sensing, spectrum sharing) related to cognitive small cell networks have been studied, but the common control channel (CCC) establishment problem has been ignored. CCC is an indispensable medium for control message exchange that could have a huge significant on transmitter-receiver handshake, channel access negotiation, topology change, and routing information updates, etc. Therefore, establishing CCC in cognitive small cell networks is a challenging problem. In this paper, we propose a potential game theory-based approach for CCC establishment in cognitive radio networks. We design a utility function and demonstrate that it is an exact potential game with a pure Nash equilibrium. To maintain the common control channel list (CCL), we develop a CCC update algorithm. The simulation results demonstrate that the proposed approach has good convergence. On the other hand, it exhibits good delay and overhead of all networks.

Cognitive Routing for Multi-hop Mobile Cognitive Radio Ad Hoc Networks

  • Lee, Jae-Joon;Lim, Jaesung
    • Journal of Communications and Networks
    • /
    • v.16 no.2
    • /
    • pp.155-161
    • /
    • 2014
  • Mobility can lead to continual loss of data and service interruptions during communications in multi-hop cognitive radio networks. Mobility of primary users (PUs) or cognitive users (CUs) requires adjustment of multi-hop communications among CUs to avoid any interference to PUs. To provide durable and reliable data routing that ensures continuous network service, we propose mobility-aware cognitive routing (MCR) for multi-hop cognitive radio networks. MCR examines the risk level of each node against interference regions and selects the most reliable path for data delivery using a Markov predictor. Through simulation, we verify that the proposed scheme can avoid route destruction preemptively and achieve reliable data delivery.

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.

Analysis of Channel Access Delay in CR-MAC Protocol for Ad Hoc Cognitive Radio Wireless Sensor Networks without a Common Control Channel

  • Joshi, Gyanendra Prasad;Nam, Seung Yeob;Acharya, Srijana;Kim, Sung Won
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.3
    • /
    • pp.911-923
    • /
    • 2014
  • Ad hoc cognitive radio wireless sensor networks allow secondary wireless sensor nodes to recognize spectrum opportunities and transmit data. Most existing protocols proposed for ad hoc cognitive radio wireless sensor networks require a dedicated common control channel. Allocating one channel just for control packet exchange is a waste of resources for channel-constrained networks. There are very few protocols that do not rely on a common control channel and that exchange channel-negotiation control packets during a pre-allocated time on the data channels. This, however, can require a substantial amount of time to access the channel when an incumbent is present on the channel, where the nodes are intended to negotiate for the data channel. This study examined channel access delay on cognitive radio wireless sensor networks that have no dedicated common control channel.

An Efficient Throughput Improvement through Bandwidth Awareness in Cognitive Radio Networks

  • Le, Tung Thanh;Kim, Dong-Seong
    • Journal of Communications and Networks
    • /
    • v.16 no.2
    • /
    • pp.146-154
    • /
    • 2014
  • This paper proposes a bandwidth-aware localized-routing algorithm that is capable of sensing the available spectrum bands within a two-hop neighboring for choosing the highly opportunistic routes. A mixed-integer linear programming (MILP) is utilized to formulate the optimization problem. Then, the proposed algorithm is used to determine the maximum bandwidth possible of link pairs via a bandwidth approximation process of relaxed variables. Thereby, the proposed algorithm can allow selected routes corresponding to maximum bandwidth possible between cognitive radio (CR) users through link pairs in cognitive radio networks. By comparing the solution values to previous works, simulation results demonstrate that the proposed algorithm can offer a closed-optimal solution for routing performance in cognitive radio networks. The contribution of this paper is achieved through approximately 50% throughput utilized in the network.

Biform Game Based Cognitive Radio Scheme for Smart Grid Communications

  • Kim, Sungwook
    • Journal of Communications and Networks
    • /
    • v.14 no.6
    • /
    • pp.614-618
    • /
    • 2012
  • Smart grid is widely considered to be a next generation power grid, which will be integrated with information feedback communications.However, smart grid communication technologies are subject to inefficient spectrum allocation problems. Cognitive radio networks can solve the problemof spectrumscarcity by opening the under-utilized licensed bands to secondary users. In this paper, adaptive cognitive radio spectrum sensing and sharing algorithms are developed for smart grid environments. Simulation results are presented to demonstrate the effectiveness of the proposed scheme in comparison with other existing schemes.

Throughput and Delay Optimal Scheduling in Cognitive Radio Networks under Interference Temperature Constraints

  • Gozupek, Didem;Alagoz, Fatih
    • Journal of Communications and Networks
    • /
    • v.11 no.2
    • /
    • pp.148-156
    • /
    • 2009
  • The fixed spectrum assignment policy in today's wireless networks leads to inefficient spectrum usage. Cognitive radio network is a new communication paradigm that enables the unlicensed users to opportunistically use the spatio-temporally unoccupied portions of the spectrum, and hence realizing a dynamic spectrum access (DSA) methodology. Interference temperature model proposed by Federal Communications Commission (FCC) permits the unlicensed users to utilize the licensed frequencies simultaneously with the primary users provided that they adhere to the interference temperature constraints. In this paper, we formulate two NP-hard optimal scheduling methods that meet the interference temperature constraints for cognitive radio networks. The first one maximizes the network throughput, whereas the second one minimizes the scheduling delay. Furthermore, we also propose suboptimal schedulers with linear complexity, referred to as maximum frequency selection (MFS) and probabilistic frequency selection (PFS). We simulate the throughput and delay performance of the optimal as well as the suboptimal schedulers for varying number of cognitive nodes, number of primary neighbors for each cognitive node, and interference temperature limits for the frequencies. We also evaluate the performance of our proposed schedulers under both additive white gaussian noise (AWGN) channels and Gilbert-Elliot fading channels.

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.