Optimization of Sensing Time for Efficient Spectrum Utilization in NOMA Based Cognitive Radio Networks

2021 ◽  
pp. 471-481
Author(s):  
Deepika Rajpoot ◽  
Pankaj Verma
Author(s):  
Haiyan Ye ◽  
Jiabao Jiang

AbstractThe lack of spectrum resources restricts the development of wireless communication applications. In order to solve the problems of low spectrum utilization and channel congestion caused by the static division of spectrum resource, this paper proposes an optimal linear weighted cooperative spectrum sensing for clustered-based cognitive radio networks. In this scheme, different weight values will be assigned for cooperative nodes according to the SNR of cognitive users and the historical sensing accuracy. In addition, the cognitive users can be clustered, and the users with the better channel characteristics will be selected as cluster heads for gathering the local sensing information. Simulation results show that the proposed scheme can obtain better sensing performance, improve the detection probability and reduce the error probability.


2021 ◽  
Vol 11 (7) ◽  
pp. 3083
Author(s):  
Youheng Tan ◽  
Xiaojun Jing

Spectrum sensing (SS) has attracted much attention due to its important role in the improvement of spectrum efficiency. However, the limited sensing time leads to an insufficient sampling point due to the tradeoff between sensing time and communication time. Although the sensing performance of cooperative spectrum sensing (CSS) is greatly improved by mutual cooperation between cognitive nodes, it is at the expense of computational complexity. In this paper, efficient approximations of the N-out-of-K rule-based CSS scheme under heterogeneous cognitive radio networks are provided to obtain the closed-form expression of the sensing threshold at the fusion center (FC), where the false alarm probability and its corresponding detection probability are approximated by the Poisson distribution. The computational complexity required to obtain the optimal sensing threshold at the FC has greatly decreased and theoretical derivations state that the approximation error is negligible. The simulations validate the effectiveness of the proposed scheme.


2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Changhua Yao ◽  
Qihui Wu ◽  
Linfang Zhou

We propose a more practical spectrum sensing optimization problem in cognitive radio networks (CRN), by considering the data traffic of second user (SU). Compared with most existing work, we do not assume that SU always has packets to transmit; instead, we use the actual data transmitted per second rather than the channel capacity as the achievable throughput, to reformulate the Sensing-Throughput Tradeoff problem. We mathematically analyze the problem of optimal sensing time to maximize the achievable throughput, based on the data traffic of SU. Our model is more general because the traditional Sensing-Throughput Tradeoff model can be seen as a special case of our model. We also prove that the throughput is a concave function of sensing time and there is only one optimal sensing time value which is determined by the data traffic. Simulation results show that the proposed approach outperforms existing methods.


Sensors ◽  
2020 ◽  
Vol 20 (13) ◽  
pp. 3800
Author(s):  
Xiang Xiao ◽  
Fanzi Zeng ◽  
Zhenzhen Hu ◽  
Lei Jiao

Cognitive radio networks (CRNs), which allow secondary users (SUs) to dynamically access a network without affecting the primary users (PUs), have been widely regarded as an effective approach to mitigate the shortage of spectrum resources and the inefficiency of spectrum utilization. However, the SUs suffer from frequent spectrum handoffs and transmission limitations. In this paper, considering the quality of service (QoS) requirements of PUs and SUs, we propose a novel dynamic flow-adaptive spectrum leasing with channel aggregation. Specifically, we design an adaptive leasing algorithm, which adaptively adjusts the portion of leased channels based on the number of ongoing and buffered PU flows. Furthermore, in the leased spectrum band, the SU flows with access priority employ dynamic spectrum access of channel aggregation, which enables one flow to occupy multiple channels for transmission in a dynamically changing environment. For performance evaluation, the continuous time Markov chain (CTMC) is developed to model our proposed strategy and conduct theoretical analyses. Numerical results demonstrate that the proposed strategy effectively improves the spectrum utilization and network capacity, while significantly reducing the forced termination probability and blocking probability of SU flows.


Sign in / Sign up

Export Citation Format

Share Document