Maximizing Throughput with Wireless Spectrum Sensing Network Assisted Cognitive Radios

Cooperative spectrum sensing plays an important role in cognitive radio networks since it improves the detection performance by exploiting spatial diversity. However, the cooperation among terminals also brings additional communication overhead. In this paper, overhead-throughput tradeoff issues are investigated in four scenarios namely (1) identical sensing channel and perfect reporting channel, (2) identical sensing channel and imperfect reporting channel, (3) different sensing channel and perfect reporting channel, (4) different sensing channel and imperfect reporting channel of each secondary user (SU). Taking the reporting overhead into consideration, a novel frame structure consisting of an initial subframe and M consecutive subframes, is proposed to maximize the achievable throughput of the secondary network. And for each scenario, the overhead-throughput tradeoff is formulated as an optimization problem with respect to the number of reporting SUs. A brute-force approach is then used to resolve such optimization problem. Given the optimal number of reporting SUs, a set of candidate SUs is then selected according to the probability of detection, the probability of false alarm and the probability of reporting error. Numerical results show that an optimal overhead-throughput tradeoff is achieved given the optimal number of reporting SUs. In addition, the probability of false alarm is shown to be the most important factor affecting the performance of achievable throughput within the secondary network because the lower probability of false alarm corresponds to the case that the secondary network can use the channel with a higher chance.

In cognitive radio networks, the secondary users can use the frequency bands when the primary users are not present. Hence secondary users need to constantly sense the presence of the primary users. When the primary users are detected, the secondary users have to vacate that channel. This makes the probability of detection important to the primary users as it indicates their protection level from secondary users. When the secondary users detect the presence of a primary user which is in fact not there, it is referred to as false alarm. The probability of false alarm is important to the secondary users as it determines their usage of an unoccupied channel. Depending on whose interest is of priority, either a targeted probability of detection or false alarm shall be set. After setting one of the probabilities, the other can be optimized through cooperative sensing. In this paper, we show that cooperating all secondary users in the network does not necessary achieve the optimum performance, but instead, it is achieved by cooperating a certain number of users with the highest primary user's signal to noise ratio. Computer simulations have shown that the P <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">d</sub> can increase from 92.03% to 99.88% and P <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">f</sub> can decrease from 6.02% to 0.06% in a network with 200 users.

In cognitive radio networks, secondary users need to access the licensed spectrum while neither disturbing the transmissions of the primary users nor introducing much interference to other secondary users. Hence, proper power controlling is of paramount importance to ensure efficient system operation. The previous work on power control in cognitive networks mainly focuses on the interactions among a set of secondary users. The primary users' influence is rarely considered. In this paper, a new power control game model is formulated, by including the primary users into the player set of the game. The primary users are rewarded for sharing their licensed spectrum with secondary users by setting a reasonable interference cap for the secondary transmissions. However, we ensure a minimum required Quality of Service (QoS) for primary users by severely penalizing their utility if their required transmission quality is not met. Simultaneously, the secondary users achieve energy efficient transmissions while not introducing much interference to both the primary and other secondary users. We prove that the proposed cognitive power control game has a unique Nash equilibrium (NE). The numerical examples show that the proposed game theoretical power control algorithm can provide the secondary users with energy efficient transmissions and the primary users with reasonable monetary rewards, while not compromising their required QoS.

This study deals with the scaling laws of ad hoc cognitive networks. In the network, m primary users and n secondary users ( m n ) are randomly located in the same geographic area and share one common frequency spectrum. By loosening some of the restrictions for the network, the authors obtained the throughput upper bounds for both primary and secondary users. To obtain the lower bounds (achievable throughputs), we proposed a cooperative transmission scheme between the primary and secondary users by using the percolation theory, and the results showed that the achievable throughputs can meet the upper bounds, thus, the authors obtained the throughputs. On the basis of our results, per primary user can transmit with a throughput of min(Θ(1), Θ(Θ n/m )), which is higher than the throughput of Θ(Θ1/ m ) in the cognitive network without cooperative relay. This may serve as a strong incentive for primary users to cooperative with secondary users. Meanwhile, secondary users can achieve the same scale as if there is no primary network exists.

Cognitive Radio Network is a form of communication where licensed frequency band of the Primary users (PUs) are made available to the Secondary user (SU) with constraint interference to the PUs. In this work, we have investigated a novel model considering interweave approach for spectrum access, with multiple primary users and single secondary user (SU). Multiple antennas have been considered at both the primary users as well as the secondary users. The activity of primary users are modeled as Poisson process. In addition, we also propose a new approach of sensing for a MIMO cognitive radio network using energy detection. The proposed method provides a closed form expression for probability of detection (P d ) and probability of false alarm (P f ) in a Multiple Input Multiple Output (MIMO) channel. Further, the throughput of secondary user as well as interference on primary users caused due to secondary user transmissions, has been computed for the proposed model.

Spectrum sensing is performed by secondary users (SUs) to detect primary users (PUs) in cognitive radio networks. The limited time duration allocated for spectrum sensing may result in high false alarm probability, which always leads to low spectrum utilization and degrades the SU throughput. To overcome this problem, we propose a novel joint sensingtime adaption and data transmission (JSTA-DT) scheme. In our proposed JSTA-DT scheme, two adjacent sensing periods are bundled to form a sensing block. In each sensing block, the SU performs partial time spectrum sensing in the first sensing period. If the sensing result indicates that the PU is absent, the SU transmits its data; otherwise, the SU performs full time spectrum sensing adaptively. Both theoretical analyses and simulation results show that compared to the conventional partial time spectrum sensing and data transmission scheme, the spectrum utilization and achievable SU throughput are improved significantly by using our proposed JSTA-DT scheme.

We consider a cooperation scenario between primary users and untrusted secondary users in cognitive radio networks. The secondary users are willing to help the primary users to relay the primary users' messages in reward for being allowed to share the primary users' spectrum bands. However, the primary users might be reluctant to accept this help, since the secondary users are untrustworthy and may try unauthorized decoding of the primary users' messages. This paper will answer the question: when is this cooperation mutually beneficial for primary and secondary users? Taking an approach of information-theoretic secrecy, such as coding techniques for wiretap channels, the primary users can allow the secondary users to sense and relay the message, while ensuring that the secondary users are ignorant of the primary users' messages. We characterize an achievable secrecy rate of primary users with a rate of the secondary users' communication. From the derived rate pairs, an optimization problem is formulated such that the secondary transmitter distributes its transmit power to maximize its data rate while providing a higher secrecy rate to the primary users. We demonstrate that this cooperation can provide a positive secrecy rate, even when a non-cooperative scheme achieves a zero secrecy rate.

Spectrum sensing ranks amongst cognitive radio's most critical and demanding activities. For radio resource networks to use idle licensed bandwidth, secondary users need to identify the primary user's signal precisely. Cognitive radio networks (CRNs) have been proposed to improve the efficiency of spectrum use to meet the increasing demand for wireless bandwidth; they allow channel communication between secondary (unlicensed) and primary (licensed) users without interruption. A secondary user in a CRN must at all times track the presence of a primary user's signal to prevent the primary user (PU) from attempting to intervene whether the statistical variance of the PU data traffic would boost the prediction outcome provided by multiple current teaching algorithms in estimating the PU's average OFF time and the need for the best adaptive learning to predict accurate PU activities. The objective of the work has been modeled to identify the PUs signal. First, the data has been created via quadrature phase shift keying modulation and quadrature amplitude modulation by convolutional neural network (CNN). A dataset with different orthogonal frequency‐division (OFDM) multiple access signals is generated. Then cyclo‐stationary functions are extracted using the accumulation process fast Fourier Transform. This research aims to use glow worm swarm optimization (GWSO) to automatically check for the optimal design of CNNs without any manual work being required. Also, k‐Nearest Neighbors (kNN) replaces Softmax, as it outperforms conventional CNN architectures with noisy signals. A comparison of the proposed classifier with another machine learning classifier, namely support vector machine, Decision tree (DT), clearly shows that SVM and DT are outperformed by the improved convolution neural network‐glow worm swarm optimization (ICNN‐GWSO) classification. Results of simulation show that the improved scheme outperforms conventional spectrum sensing systems, both in fading and non‐fading settings, where efficiency is measured using measures such as chance, the total likelihood of error, and the ability to optimize data transfer possibilities.

With the rapid development of wireless services and applications, the currently radio spectrum is becoming more crowded. How to accommodate more wireless services and applications within the limited radio spectrum becomes a big challenge faced by modern society. Cognitive radio (CR) is proposed as a promising technology to tackle this challenge by introducing secondary users (SUs) to opportunistically or concurrently access the spectrum allocated to primary users (PUs). Currently, there are two prevalent CR models: the spectrum sharing model and the opportunistic spectrum access model. In the spectrum sharing model, the SUs are allowed to coexist with the PUs as long as the interferences from SUs do not degrade the quality of service (QoS) of PUs to an unacceptable level. In the opportunistic spectrum access model, SUs are allowed to access the spectrum only if the PUs are detected to be inactive. These two models known as underlay and overlay schemes, respectively. This thesis studies a number of topics in CR networks under the framework of these two schemes. First, studied cognitive radio transmissions under QoS delay constraints. Initially, we focused on the concept: effective capacity for cognitive radio channels in order to identify the performance in the presence of QoS constraints. Both underlay and overlay schemes are studied taking into consideration the activity of primary users, and assuming the general case of channel fading as Gamma distribution. For this setting, we further proposed a selection criterion by which the cognitive radio network can choose the adequate mode of operation. Then, we studied the cognitive radio transmissions focusing on Rayleigh fading channel and assumed that no prior channel knowledge is available at the transmitter and the receiver. We investigated the performance of pilot-assisted transmission strategies. In particular, we analyzed the channel estimation using minimum mean-square-error (MMSE) estimation, and analyzed efficient resource allocation strategies. In both cases, power allocations and effective capacity optimization were obtained. Effective capacity and interference constraint were analyzed in both single-band and multi-band spectrum sensing settings. Finally, we studied optimal access probabilities for cognitive radio network using Markov model to achieve maximum throughput for both CR schemes.

We investigate opportunistic cooperation between secondary (unlicensed) users and primary (licensed) users in cognitive radio networks. We consider two models for such cooperation. In the first model, called the Cooperative Relay Model, a secondary user cannot transmit its own data concurrently with a primary user. However, it can employ cooperative relaying in order to improve the effective transmission rate of the primary user. In the second model, called the Interference Model, a secondary user is allowed to transmit its data concurrently with a primary user. However, the secondary user can “cooperate” by deferring its transmissions when the primary user is busy. In both models, the secondary users must make intelligent cooperation decisions as they seek to maximize their own throughput subject to average power constraints. The decision options are different during idle and busy periods of the primary user, and the decisions in turn influence the durations of these periods according to a controllable infinite state Markov chain. Such problems can be formulated as constrained Markov decision problems, and conventional solution techniques require either extensive knowledge of the system dynamics or learning based approaches that suffer from large convergence times. However, using a generalized Lyapunov optimization technique, we design a novel greedy and online control algorithm that overcomes these challenges. Remarkably, this algorithm does not require any knowledge of the network arrival rates and is provably optimal.

Cognitive Radio Networks (CRNs) is a formidable evolution in wireless technology owing to its potentiality to resolve spectrum scarcity crisis. In CRNs, cognitive radio user’s sense idle spectrum as well as opportunistically entrée sensed spectrum devoid of approved users. The best spectrum is said to be selected opportunistically, shared with other users with no severity to licensed users. Many CRN devices that are fueled by battery possessing constrained energy capacity. Prevailing battery mechanisms yet couldn’t contribute CRN devices works for a long time. Therefore, conservation of energy is mandatory as far as routing in CRN is concerned. In this work a machine learning based method called, Regression Cooperative Spectrum Sensing and Gradient Flying Fox Route Optimization (RCSS-GFFRO) for energy and bandwidth aware data routing with spectrum utilization in CRNs is proposed. Protection of primary users (PUs) as well as optimization of secondary user (SU) transmission included in proposed method. In the proposed method a cooperative spectrum sensing using machine learning (ML) model called, Median Regression function is applied. The Median Regression Cooperative Spectrum Sensing in our work with the bandwidth and energy efficiency ensures acceptable probability of interference to primary users due to secondary user’s access by measuring the relationship between bandwidth and energy efficiency simultaneously. Next, optimal route identification is performed using Gradient Flying Fox Route Optimization algorithm. By applying gradient optimization function minimizes the interference with primary users and increases secondary user performance via sensing time and transmission time parameters with higher routing performance. Simulation estimated with parameters.

Cognitive radio is a promising technology for sharing the underutilized frequency bands that have been licensed to primary users. However, due to the uncertainty in detecting the existence of the primary user, the secondary user may interfere with the primary users when both primary and secondary users are active simultaneously. Therefore, understanding the interference and its consequences on the cognitive network is critical. Unlike the statistical models previously reported in the literature that aim at approximation of the interference, based on the solid mathematical analysis, we propose an accurate model for describing the co-channel interference with probability density function, cumulative distribution function, mean, and variance of the interference suffered by the primary users. The proposed model not only takes into account a number of factors, such as the spectrum-sensing scheme, the spatial distribution of secondary users, and the channel conditions, including shadowing and Nakagami fading, but also gives an exact mathematical expression of the influences from these factors. The developed framework supports practical applications such as evaluating the cognitive network of any spatial shape and density of the secondary users and the methods of power control and spectrum sensing used by the secondary users. Simulation results are provided to verify the effectiveness of the analytical model.

Spectrum sensing is an essential operation in cognitive radio networks. In this paper, we consider a dynamic spectrum sensing system consisting of both non-cooperative mobile cognitive radio(CR) secondary users and mobile non-cognitive radio primary users. Key performance metrics such as detection capability and sensing capacity are evaluated. Two mobility models are adopted for both secondary and primary users. The relative distance distribution associating the independent mobile users is analyzed and given in both 1- and 2-dimensions. Expressions for both performance metrics are derived, and simulations are performed to validate the theoretical analyses.

The cooperation among the secondary users or among the secondary users and the primary users have proven to bring many benefits to both primary and secondary users in cognitive radio networks. In this paper, cooperative relaying in cognitive radio networks is studied for rateless coding error-control mechanism. For a pair of primary transmitter and receiver, we find the region in which any secondary or cognitive user can cooperate with the primary user in a constructive way. A queueing theoretical model is employed to describe the underlying system parameters and to create a mathematical framework for the analysis. The throughput performance of the secondary users is maximized based on the input traffic of the primary users. Using the unique properties of rateless codes, a low-complexity relay selection mechanism is also introduced. Through the experimental analysis, we show that the proposed rateless-coding-based cooperative mechanism can perform similar to the more complicated and more costly selective-repeat automatic repeat request algorithm. The numerical analysis using the Rapid Analysis of Queueing Systems (RAQS) software package is provided to support the findings.

In a cognitive radio network, when primary user's (PU's) spectrum is periodically sensed, secondary user (SU) needs to wait during sensing interval, which causes interruption in SUs' transmission and significant reduction in achievable throughput. If continuous spectrum sensing is implemented, then a portion of a band is always unavailable for SUs' transmission, which also limits the throughput. In this paper, we propose two methods. With the first one, we achieve an increase in throughput, while SUs' transmission is uninterrupted, and in the second method, we let our algorithm dynamically choose time-band portion of a frame for spectrum sensing, causing minimal interference to PU than the one in first method and offering uninterrupted service to cognitive radio (CR) users. Simulation results show that achievable throughput is improved significantly in both methods. It also showed that the methods offer normalized throughput between 4.7 and 5.3 bits/s/Hz over a wider range of sensing band from 0.75 to 6 MHz, when PU's active phase probability is 0.2, whereas delay-oriented continuous spectrum sensing (DOCSS) scheme achieves this range within a narrower sensing band--especially at the optimal value. Results also showed that for an arbitrary sensing band, normalized throughput achieved by our methods is larger than the one achieved by DOCSS scheme.