• Title/Summary/Keyword: spectrum leasing

Search Result 6, Processing Time 0.015 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.

Performance Analysis of Coordinated Cognitive Radio Networks under Fixed-Rate Traffic with Hard Delay Constraints

  • Castellanos-Lopez, S. Lirio;Cruz-Perez, Felipe A.;Rivero-Angeles, Mario E.;Hernandez-Valdez, Genaro
    • Journal of Communications and Networks
    • /
    • v.16 no.2
    • /
    • pp.130-139
    • /
    • 2014
  • Due to the unpredictable nature of channel availability, carrying delay-sensitive traffic in cognitive radio networks (CRNs) is very challenging. Spectrum leasing of radio resources has been proposed in the so called coordinated CRNs to improve the quality of service (QoS) experienced by secondary users (SUs). In this paper, the performance of coordinated CRNs under fixed-rate with hard-delay-constraints traffic is analyzed. For the adequate and fair performance comparison, call admission control strategies with fractional channel reservation to prioritize ongoing secondary calls over new ones are considered. Maximum Erlang capacity is obtained by optimizing the number of reserved channels. Numerical results reveal that system performance strongly depends on the value of the mean secondary service time relative to the mean primary service time. Additionally, numerical results show that, in CRNs without spectrum leasing, there exists a critical utilization factor of the primary resources from which it is not longer possible to guarantee the required QoS of SUs and, therefore, services with hard delay constraints cannot be even supported in CRNs. Thus, spectrum leasing can be essential for CRN operators to provide the QoS demanded by fixed-rate applications with hard delay constraints. Finally, the cost per capacity Erlang as function of both the utilization factor of the primary resources and the maximum allowed number of simultaneously rented channels is evaluated.

Short Term Spectrum Trading in Future LTE Based Cognitive Radio Systems

  • Singh, Hiran Kumar;Kumar, Dhananjay;Srilakshmi, R.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.1
    • /
    • pp.34-49
    • /
    • 2015
  • Market means of spectrum trading have been utilized as a vital method of spectrum sharing and access in future cognitive radio system. In this paper, we consider the spectrum trading with multiple primary carrier providers (PCP) leasing the spectrum to multiple secondary carrier providers (SCP) for a short period of time. Several factors including the price of the resource, duration of leasing, and the spectrum quality guides the proposed model. We formulate three trading policies based on the game theory for dynamic spectrum access in a LTE based cognitive radio system (CRS). In the first, we consider utility function based resource sharing (UFRS) without any knowledge of past transaction. In the second policy, each SCP deals with PCP using a non-cooperative resource sharing (NCRS) method which employs optimal strategy based on reinforcement learning. In variation of second policy, third policy adopts a Nash bargaining while incorporating a recommendation entity in resource sharing (RERS). The simulation results suggest overall increase in throughput while maintaining higher spectrum efficiency and fairness.

Spectrum Leasing and Cooperative Resource Allocation in Cognitive OFDMA Networks

  • Tao, Meixia;Liu, Yuan
    • Journal of Communications and Networks
    • /
    • v.15 no.1
    • /
    • pp.102-110
    • /
    • 2013
  • This paper considers a cooperative orthogonal frequency division multiple access (OFDMA)-based cognitive radio network where the primary system leases some of its subchannels to the secondary system for a fraction of time in exchange for the secondary users (SUs) assisting the transmission of primary users (PUs) as relays. Our aim is to determine the cooperation strategies among the primary and secondary systems so as to maximize the sum-rate of SUs while maintaining quality-of-service (QoS) requirements of PUs. We formulate a joint optimization problem of PU transmission mode selection, SU (or relay) selection, subcarrier assignment, power control, and time allocation. By applying dual method, this mixed integer programming problem is decomposed into parallel per-subcarrier subproblems, with each determining the cooperation strategy between one PU and one SU. We show that, on each leased subcarrier, the optimal strategy is to let a SU exclusively act as a relay or transmit for itself. This result is fundamentally different from the conventional spectrum leasing in single-channel systems where a SU must transmit a fraction of time for itself if it helps the PU's transmission. We then propose a subgradient-based algorithm to find the asymptotically optimal solution to the primal problem in polynomial time. Simulation results demonstrate that the proposed algorithm can significantly enhance the network performance.

Selective Subspace Interference Alignment for Cognitive Radio Systems (선택적 부분공간 간섭 정렬을 이용한 상황인식 시스템)

  • Cho, Hyung-Weon;Park, Jong-Hun;Hong, Suk-Jin;Seo, Jong-Pil;Chung, Jae-Hak;Chung, Jong-Moon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.6A
    • /
    • pp.592-600
    • /
    • 2011
  • This paper presents a selective interference alignment for cognitive radio system with spectrum leasing. The proposed method selects users who cause severe interference to other basestations that have required SINR. Since few users are selected to apply subspace interference alignment, the total complexity of the system is not high compared with that of the system who utilizes subspace interference alignment to all users. In addition, all users can transmit without considering interference. The computer simulation shows the proposed method exhibits 350% throughput enhancement at a two cell case, and 400% increase at a three cell case.

Cooperative spectrum leasing using parallel communication of secondary users

  • Xie, Ping;Li, Lihua;Zhu, Junlong;Jin, Jin;Liu, Yijing
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.8
    • /
    • pp.1770-1785
    • /
    • 2013
  • In this paper, a multi-hop transmission protocol based on parallel communication of secondary users (SUs) is proposed. The primary multi-hop network coexists with a set of SUs by cooperative spectrum sharing. The main optimization target of our protocol is the overall performance of the secondary system with the guarantee of the primary outage performance. The energy consumption of the primary system is reduced by the cooperation of SUs. The aim of the primary source is to communicate with the primary destination via a number of primary relays. SUs may serve as extra decode-and-forward relays for the primary network. When an SU acts as a relay for a primary user (PU), some other SUs that satisfy the condition for parallel communication are selected to simultaneously access the primary spectrum for secondary transmissions. For the proposed protocol, two opportunistic routing strategies are proposed, and a search algorithm to select the SUs for parallel communication is described. The throughput of the SUs and the PU is illustrated. Numerical results demonstrate that the average throughput of the SUs is greatly improved, and the end-to-end throughput of the PU is slightly increased in the proposed protocol when there are more than seven SUs.