Skip to main content

Advertisement

EURASIP Journal on Wireless Communications and Networking
EURASIP Journal on Wireless Communications and Networking Cover Image
  • Review
  • Open Access

Ten years of research in spectrum sensing and sharing in cognitive radio

EURASIP Journal on Wireless Communications and Networking20122012:28

https://doi.org/10.1186/1687-1499-2012-28

©  Lu et al; licensee Springer. 2012

  • Received: 1 May 2011
  • Accepted: 31 January 2012
  • Published:

Abstract

Cognitive radio (CR) can successfully deal with the growing demand and scarcity of the wireless spectrum. To exploit limited spectrum efficiently, CR technology allows unlicensed users to access licensed spectrum bands. Since licensed users have priorities to use the bands, the unlicensed users need to continuously monitor the licensed users' activities to avoid interference and collisions. How to obtain reliable results of the licensed users' activities is the main task for spectrum sensing. Based on the sensing results, the unlicensed users should adapt their transmit powers and access strategies to protect the licensed communications. The requirement naturally presents challenges to the implementation of CR. In this article, we provide an overview of recent research achievements of including spectrum sensing, sharing techniques and the applications of CR systems.

Keywords

  • cognitive radio
  • cooperative communications
  • spectrum sensing
  • spectrum sharing.

1. Introduction

Due to the rapid growth of wireless communications, more and more spectrum resources are needed. Within the current spectrum framework, most of the spectrum bands are exclusively allocated to specific licensed services. However, a lot of licensed bands, such as those for TV broadcasting, are underutilized, resulting in spectrum wastage [1]. This has promoted Federal Communications Commission (FCC) to open the licensed bands to unlicensed users through the use of cognitive radio (CR) technology [2–6]. The IEEE 802.22 working group [7] has been formed to develop the air interference for opportunistic secondary access to TV bands.

In practice, the unlicensed users, also called secondary users (SUs), need to continuously monitor the activities of the licensed users, also called primary users (PUs), to find the spectrum holes (SHs), which is defined as the spectrum bands that can be used by the SUs without interfering with the PUs. This procedure is called spectrum sensing [8–10]. There are two types of SHs, namely temporal and spatial SHs [9], respectively. A temporal SH appears when there is no PU transmission during a certain time period and the SUs can use the spectrum for transmission. A spatial SH appears when the PU transmission is within an area and the SUs can use the spectrum outside that area.

To determine the presence or absence of the PU transmission, different spectrum sensing techniques have been used, such as matched filtering detection, energy detection, and feature detection [11]. However, the performance of spectrum sensing is limited by noise uncertainty, multipath fading, and shadowing, which are the fundamental characteristics of wireless channels. To address this problem, cooperative spectrum sensing (CSS) has been proposed [12] by allowing the collaboration of SUs to make decisions.

Based on the sensing results, SUs can obtain information about the channels that they can access. However, the channel conditions may change rapidly and the behavior of the PUs might change as well. To use the spectrum bands effectively after they are found available, spectrum sharing and allocation techniques are important [6, 13]. As PUs have priorities to use the spectrum when SUs co-exist with them, the interference generated by the SU transmission needs to be below a tolerable threshold of the PU system [14]. Thus, to manage the interference to the PU system and the mutual interference among SUs, power control schemes should be carefully designed. By utilizing advanced technologies such as multiple-input multiple-output (MIMO) and beamforming with smart antenna, interference-free co-exiting transmission can be achieved [15]. In the multi-hop CR system, relays can assist SUs' transmission, which generate spatial SHs and help to achieve more communication opportunities. Moreover, the resource competition among SUs needs to be addressed.

There are a lot of progresses on CR technology in the last ten years. This article provides an overview of some recent techniques, potential challenges, and future applications of CR. In Section 2, fundamental spectrum sensing techniques are provided. In Section 3, CSS techniques to boost the sensing performance are presented. Spectrum sharing and allocation schemes are discussed in Section 4. The applications of CR technology and conclusions are in Sections 5 and 6, respectively.

Table 1 lists some abbreviations that have been or will be used in this article.
Table 1

List of abbreviations

AF

Amplify-and-forward

AWGN

Additive white Gaussian noise

BS

Base station

CAF

Cyclic autocorrelation function

CR

Cognitive radio

CSD

Cyclic spectrum density

CSS

Cooperative spectrum sensing

DoD

Department of defense

DR

Detect-and-relay

ECC

Electronic Communications Committee

FCC

Federal Communications Commission

GLRT

Generalized likelihood ratio test

HDD

Hard-decision-based detection

IPC

Interference powers constraint

LRT

Likelihood ratio test

LTE-A

LTE-Advanced

MIMO

Multiple-input multiple-output

MLE

Maximum likelihood estimate

MME

Maximum-minimum eigenvalue

MMSE

Minimum mean-square-error

NE

Nash equilibrium

NP

Neyman-Pearson

Ofcom

Office of Communications

OFDMA

Orthogonal frequency division multiple access

OPC

Outage probability constraint

OSA

Opportunistic spectrum access

OSO

Opportunistic spatial orthogonalization

PDF

Probability density function

PSD

Power spectral density

PU

Primary user

QAM

Quadrature amplitude modulation

QoS

Quality of service

QCQP

Quadratically constrained quadratic problem

RF

Radio-front

RLC

Rate loss constraint

ROC

Receiver operating characteristics

SBS

Secondary base station

SDD

Soft-decision-based detection

SDR

Semidefinite relaxation

SFD

Spectral feature detector

SH

Spectrum holes

SINR

Signal-to-interference-plus-noise ratio

SNR

Signal-to-noise ratio

SPRT

Sequential probability ratio test

SU

Secondary user

TPA

Transmit power allocation

TPC

Transmit power constraint

XG

Next generation

2. Local spectrum sensing

Spectrum sensing enables SUs to identify the SHs, which is a critical element in CR design [9, 10, 16]. Figure 1 shows the principle of spectrum sensing. In the figure, the PU transmitter is sending data to the PU receiver in a licensed spectrum band while a pair of SUs intends to access the spectrum. To protect the PU transmission, the SU transmitter needs to perform spectrum sensing to detect whether there is a PU receiver in the coverage of the SU transmitter.
Figure 1
Figure 1

Spectrum sensing concept.

Instead of detecting PU receiver directly, the SU transmitter can detect the presence or absence of PU signals easily. However, as shown in Figure 1, the radius of PU transmitter and PU receiver detections are different, which lead to some shortcomings and challenges. It may happen that the PU receiver is outside the PU transmitter detection radius, where the SH may be missed. Since the PU receiver detection is difficult, most study focuses on PU transmitter detection [6, 13].

It is worth noting that, in general, it is difficult for the SUs to differentiate the PU signals from other pre-existing SU transmitter signals. Therefore, we treat them all as one received signal, s(t). The received signal at the SU, x(t), can be expressed as [17]
x ( t ) = n ( t ) ℋ 0 , s ( t ) + n ( t ) ℋ 1 ,
(1)

where n(t) is the additive white Gaussian noise (AWGN). ℋ 0 and ℋ 1 denote the hypotheses of the absence and presence of the PU signals, respectively. The objective for spectrum sensing is to decide between ℋ 0 and ℋ 1 based on the observation x(t).

The detection performance is characterized by the probabilities of detection, P d , and false-alarm, P f . P d is the probability that the decision is ℋ 1 , while ℋ 1 is true; P f denotes the probability that the decision is ℋ 1 , while ℋ 0 is true. Based on P d , the probability of miss-detection P m can be obtained by P m = 1 - P d .

2.1. Hypothesis testing criteria

There are two basic hypothesis testing criteria in spectrum sensing: the Neyman-Pearson (NP) and Bayes tests. The NP test aims at maximizing P d (or minimizing P m ) under the constraint of P f ≤ α, where α is the maximum false alarm probability. The Bayes test minimizes the average cost given by ℛ = ∑ i = 0 1 ∑ j = 0 1 C i j Pr ( ℋ i | ℋ j ) Pr ( ℋ j ) , where C ij are the cost of declaring ℋ i when ℋ j is true, Pr ( ℋ i ) is the prior probability of hypothesis ℋ i and Pr ( ℋ i | ℋ j ) is the probability of declaring ℋ i when ℋ j is true. Both of them are equivalent to the likelihood ratio test (LRT) [18] given by
Λ ( x ) = P ( x | ℋ 1 ) P ( x | ℋ 0 ) = P ( x ( 1 ) , x ( 2 ) , … , x ( M ) | ℋ 1 ) P ( x ( 1 ) , x ( 2 ) , … , x ( M ) | ℋ 0 ) ≷ ῟ 0 ῟ 1 γ ,
(2)

where P ( x ( 1 ) , x ( 2 ) , … , x ( M ) | ℋ i ) is the distribution of observations x = [x(1), x(2), ..., x(M)] T under hypothesis ℋ i , i ∈ {0, 1}, Λ(x) is the likelihood ratio, M is the number of samples, and γ is the detection threshold, which is determined by the maximum false alarm probability, α, in NP test and γ = Pr ( ℋ 0 ) ( C 10 - C 00 ) Pr ( ℋ 1 ) ( C 01 - C 11 ) in the Bayes test.

In both tests, the distributions of P ( x | ℋ i ) , i ∈ {0, 1}, are known. When there are unknown parameters in the probability density functions (PDFs), the test is called composite hypothesis testing. Generalized likelihood ratio test (GLRT) is one kind of the composite hypothesis test. In the GLRT, the unknown parameters are determined by the maximum likelihood estimates (MLE) [19–21]. GLRT detectors have been proposed for multi-antenna systems in [19] and for sensing OFDM signals in [20, 21] by taking some of the system parameters, such as channel gains, noise variance, and PU signal variance as the unknown parameters.

Sequential testing is another type of hypothesis testing, which requires a variable number of samples to make decisions. The sequential probability ratio test (SPRT) minimizes the sensing time subject to the detection performance constraints [22]. In the SPRT, samples are taken sequentially and the test statistics are compared with two threshold γ0 and γ1 (γ0 < γ1), which are determined by the detection requirements. Using the SPRT, the SU makes decisions according to the following rule: ℋ 1 if Λ(x) > γ1; ℋ 0 if Λ(x) < γ0; more samples are needed if γ0 < Λ(x) < γ1. General sequence detection algorithms for Markov sources with noise have been proposed in [23]. A weighted, soft-input sequence detection algorithm based on forward-backward procedure is shown to be optimal in minimizing the Bayesian risk when different Bayesian cost factors are assigned for missed detection and false alarm. Moreover, a new limitation, called risk floor, has been discovered for traditional physical layer sensing schemes, which is caused by finite channel dwell time, where longer observation windows are more likely to mix the PU's behavior from multiple states, leading to degraded performance.

2.2. Local spectrum sensing techniques

To identify the SHs and protect PU transmission, different local spectrum sensing techniques have been proposed for individual SUs by applying the hypothesis testing criteria discussed above.

2.2.1. Matched filtering detector

If the SUs know information about the PU signal, the optimal detection method is matched filtering [11], which correlates the known primary signal with the received signal to detect the presence of the PU signal and thus maximize the signal-to-noise ratio (SNR). The matched filtering detector requires short sensing time to achieve good detection performance. However, it needs knowledge of the transmit signal by PU that may not be known at the SUs. Thus, the matched filtering technique is not applicable when transmit signals by the PUS are unknown to the SUs.

2.2.2. Energy detector

Energy detector [11] is the most common spectrum sensing method. The decision statistics of the energy detector are defined as the average energy of the observed samples
Y = 1 N ∑ t = 1 N x ( t ) 2 .
(3)

The decision is made by comparing Y with a threshold, γ. If Y ≥ γ, the SU makes a decision that the PU signal is present ( ℋ 1 ); otherwise, it declares that the PU signal is absent ( ℋ 0 ).

The energy detector is easy to implement and requires no prior information about the PU signal. However, the uncertainty of noise power imposes fundamental limitations on the performance of the energy detector [24–26]. Below an SNR threshold, a reliable detection cannot be achieved by increasing the sensing duration. This SNR threshold for the detector is called SNR wall [24]. With the help of the PU signal information, the SNR wall can be mitigated, but it cannot be eliminated [25]. Moreover, the energy detector cannot distinguish the PU signal from the noise and other interference signals, which may lead to a high false-alarm probability.

2.2.3. Feature detector

Cyclostationary detector is one of the feature detectors that utilize the cyclostationary feature of the signals for spectrum sensing [27, 28]. It can be realized by analyzing the cyclic autocorrelation function (CAF) of the received signal x(t), expressed as
R x ( β ) ( τ ) = E [ x ( t ) x * ( t - τ ) e - j 2 π β t ] ,
(4)
where E[·] is the expectation operation, * denotes complex conjugation, and β is the cyclic frequency. CAF can also be represented by its Fourier series expansion, called cyclic spectrum density (CSD) function [29], denoted as
S ( f , β ) = ∑ τ = - ∞ + ∞ R x ( β ) ( τ ) e - j 2 π f τ .
(5)

The CSD function exhibits peaks when the cyclic frequency, β, equals the fundamental frequencies of the transmitted signal. Under hypothesis ℋ 0 , the CSD function does not have any peaks since the noise is, in general, non-cyclostationary.

Generally, feature detector can distinguish noise from the PU signals and can be used for detecting weak signals at a very low SNR region, where the energy detection and matched filtering detection are not applicable. In [30], a spectral feature detector (SFD) has been proposed to detect low SNR television broadcasting signals. The basic strategy of the SFD is to correlate the periodogram of the received signal with the selected spectral features of a particular transmission scheme. The proposed SFD is asymptotically optimal according to the NP test, but with lower computational complexity.

To capture the advantages of the energy detector and the cyclostationary detector while avoiding the disadvantages of them, a hybrid architecture, associating both of them, for spectrum sensing has been proposed in [31]. It consists of two stages: an energy detection stage that reflects the uncertainty of the noise and a cyclostationary detection stage that works when the energy detection fails. The proposed hybrid architecture can detect the signal efficiently.

2.2.4. Other techniques

There are several other spectrum sensing techniques, such as eigenvalue-based and moment-based detectors.

In a multiple-antenna system, eigenvalue-based detection can be used for spectrum sensing [32, 33]. In [32], maximum-minimum eigenvalue and energy with minimum eigenvalue detectors have been proposed, which can simultaneously achieve both high probability of detection and low probability of false-alarm without requiring information of the PU signals and noise power. In most of the existing eigenvalue-based methods, the expression for the decision threshold and the probabilities of detection and false-alarm are calculated based on the asymptotical distributions of eigenvalues. To address this issue, the exact decision threshold for the probability of false-alarm for the MME detector with finite numbers of cooperative SUs and samples has been derived in [33], which will be discussed in Section 3.

When accurate noise variance and PU signal power are unknown, blind moment-based spectrum sensing algorithms can be applied [34]. Unknown parameters are first estimated by exploiting the constellation of the PU signal. When the SU does not know the PU signal constellation, a robust approach that approximates a finite quadrature amplitude modulation (QAM) constellation by a continuous uniform distribution has been developed [34].

2.3. Sensing scheduling

When and how to sense the channel are also crucial for spectrum sensing. Usually, short quiet periods are arranged inside frames to perform a coarse intra-frame sensing as a pre-stage for fine inter-frame sensing [35]. Accordingly, intra-frame sensing is performed when the SU system is quiet and its performance depends on the sample size in the quiet periods. The frame structure for CR network is shown in Figure 2. Based on this structure, there are sensing-transmission tradeoff problems. Under the constraint of PU system protection, the optimal sensing time to maximize the throughput [36] and to minimize outage probability [37] of the SU system have been studied, respectively.
Figure 2
Figure 2

Frame structure for periodic spectrum sensing, where τ denotes the sensing period and T - τ denotes the data transmission or silent period.

However, there are some problems about the conventional structure: (1) the sample size of the quiet periods may not be enough to get good sensing performance; (2) all CR communications have to be postponed during channel sensing; (3) the placement of the quiet periods causes an additional burden of synchronization. To address these problems, novel spectrum sensing scheduling schemes have been proposed.

In [38], adaptively scheduling spectrum sensing and transmitting data schemes have been proposed to minimize the negative effect caused by the traditional structure. The spectrum sensing is carried out when the channels are in poor conditions and data are transmitted when the channels are good. In [39], sensing period has been optimized to make full use of opportunities in the licensed bands. Moreover, a channel-sequencing algorithm has been proposed to reduce the delay in searching for an idle channel. To increase the sample size, quiet-active and active sensing schemes have been proposed [40]. In the quiet-active sensing scheme, the inactive SUs sense the channel in both the quiet and active data transmission periods. To fully avoid synchronization of quiet-periods, pure active sensing has been proposed where the quiet periods are replaced by "quiet samples" in other domains, such as quiet sub-carriers in orthogonal frequency division multiple access (OFDMA) systems.

2.4. Challenges

2.4.1. Wideband sensing

Wideband sensing faces technical challenges and there is limited work on it. The main challenge stems from the high data rate radio-front (RF) end requirement to sense the whole band, with the additional constraint that deployed CR systems (like mobile phones) will be limited in data processing rates. To achieve reliable results, the sample rate should be above the Nyquist rate if conventional estimation methods are used, which is a challenging task. Alternatively, the RF end can use a sequence of narrowband bandpass filters to turn a wideband signal into narrow-band ones and sense each of them [41]. However, a large number of RF components are needed for the whole band. For more effective SU networks, a multiband sensing-time-adaptive joint detection framework has been proposed in [42, 43], which adaptively senses multiple narrowband channels jointly to maximize the achievable opportunistic throughput of the SU network while keeping the interference with the PU network bounded to a reasonably low level. Based on energy detector for narrowband sensing, the sensing time and detection thresholds for each narrowband detector are optimized jointly, which is different from the previous multiband joint detection framework in [44].

2.4.2. Synchronization

Besides the synchronization issue for quiet sensing period, spectrum synchronization before the data transmission for non-contiguous OFDM based systems is also a challenge. To address this challenge [45], received training symbols can be used to calculate a posterior probability of each subband's being active without the information of out-of-band spectrum synchronization. The proposed hard-decision-based detection (HDD) utilizes a set of adjacent subbands while the soft-decision-based detection (SDD) uses all the subbands for detection. Both HDD and SDD schemes provide satisfactory performance while the SDD performs better.

3. Cooperative spectrum sensing

The performance of spectrum sensing is limited by noise uncertainty, multipath fading, and shadowing, which are the fundamental characteristics of wireless channels. If the PU signal experiences deep fading or blocked by obstacles, the power of the received PU signal at the SU may be too weak to be detected, such as the case for SU3 as shown in Figure 3. If the SU transmitter cannot detect the presence of the PU transmitter while the PU receiver is within the transmission range of the SU, the transmission of the PU will be interfered. To address this problem, CSS has been proposed [12]. With the collaboration of several SUs for spectrum sensing, the detection performance will be improved by taking advantage of independent fading channels and multiuser diversity. Based on the decision fusion criteria, CSS can be realized in either a centralized or a distributed manner.
Figure 3
Figure 3

Cooperative spectrum sensing model, where SU 1 is shadowed over the reporting channel to the secondary base station (SBS) and SU 3 is shadowed over the sensing channel.

3.1. Centralized CSS

A centralized CSS system consists of a secondary base station (SBS) and a number of SUs. In this system, the SUs first send back the sensing information to the SBS. After that, the SBS will make a decision on the presence or absence of the PU signal based on its received information and informs the SUs about the decision.

3.1.1. Data fusion schemes

Different data fusion schemes for CSS have been studied. Reporting data from the SUs may be of different forms, types, and sizes. In general, the sensing information combination at the SBS can be categorized as soft combination and hard combination techniques.

Soft Combination

In soft combination, the SUs can send their original or processed sensing data to the SBS [4]. To reduce the feedback overhead and computational complexity, various soft combination schemes based on energy detection have been investigated [46]. In these schemes, each SU sends its quantized observed energy of the received signal to the SBS. By utilizing LRT at the SBS, the obtained optimal soft combination decision is based on a weighted summation of those energies.

At the SBS, linear combination of the test statistics from the SUs is the most common fusion rule. The global test statistic of linear combination is
Y c = ∑ j = 1 N w j Y j ,
(6)

where Y j is the local test statistics (e.g. received energy in energy detection or in matched filtering [47, 48]) from SU j , and w j is the weight. Y c is compared with a threshold, γ c , to make decisions. The optimization of linear CSS for the general model is non-convex and challenging. According to a taxonomy based on the probabilities of false alarm and detection, three kinds of CR systems have been developed, namely conservative, aggressive, and hostile [47]. Since the last kind is too complex and of limited interest in applications, only the first two have been studied in [47]. Recently, a general model for all the modes has been investigated in [48]. The problem of determining the weights to maximize the detection probability under a given targeted false-alarm probability has been studied. Based on the solution of a polynomial equation, the global optimum is found by an explicit algorithm.

The linear CSS design does not only focus on the detection probability optimization but also the tradeoff in sensing time setting. In a multi-channel system based on linear CSS, the optimal value of the decision threshold, γ c , and sensing time, τ, are obtained by maximizing the throughput of the SU system for a given detection probability [49]. The original non-convex problems can be successfully converted into convex subproblems. To avoid the convex approximation, an alternative optimization technique based on genetic algorithms [50] has been proposed to directly search for the optimal solution.

Although soft combination schemes can provide good detection performance, the overhead for feedback information is high. It makes the CSS impractical under a large number of cooperative SUs. A soften-hard combination with two-bit overhead [46] has been proposed to provide comparable performance with less complexity and overhead.

Hard combination

For hard combination, the SUs feed back their own binary decision results to the SBS. Let u i denotes the local decision of SU i , where u i = 1 and 0 indicate the presence ( ℋ 1 ) and the absence ( ℋ 0 ) of the PU signal, respectively. u denotes the decision of the SBS. The most common fusion rules are OR-rule, AND-rule, and majority rule. Under the OR-rule, u = 1 if there exists u i = 1. The AND-rule refers to the SBS determines u = 1 if u i = 1, for all i. For the majority rule, if more than half of the SUs report u i = 1, the SBS decides u = 1. These fusion rules can be generalized to a K-out-of-N rule, where u = 1 if K out of N SUs report the presence of the PU signal. When K = 1 and K = N, the K-out-of-N rule becomes the OR-rule and the AND-rule, respectively.

When the OR-rule or the AND-rule is used, the threshold of detector should be adjusted according to N to get better performance than a non-cooperative system [51]. For the K-out-of-N rule, the optimal value of K and sensing time are obtained in [52] by maximizing the average achievable throughput of the SU system subject to a detection performance requirement. When all the SUs employ identical constant detection threshold, an optimal K has been derived to improve both false-alarm and miss-detection probabilities in [53].

When the SUs have different detection SNRs, it is not efficient to use the K-out-of-N fusion rule since it ignores the difference between decisions from a SU with high detection SNR and a SU with low detection SNR. Weighted decision fusion schemes have been proposed to take into account the difference in the reliability of the decisions made by different SUs [54], which are reflected in the weights of the decisions at the SBS. The optimal fusion rules in three different scenarios have been derived during the optimization of the sensing-throughput tradeoff problem. To ensure reliable detection, the correlation among different SUs should also be taken into consideration. A linear-quadratic fusion strategy has been proposed in [55] to exploit the correlation, which significantly enhances the detection performance.

3.1.2. User selection

User selection in CSS is crucial. Since SUs are located differently and strengths of received PU signals are different, it is shown in [51] that cooperation of all the SUs is not optimal. The optimal detection/false-alarm probabilities are achieved by selectively cooperating among SUs with high detection SNRs of the PU signal. The user selection is hard for the detection of small-scale PU signals that have small-footprint due to their weak power and unpredictability of spatial and temporal spectrum usage patterns [56]. Data-fusion range is identified as a key factor that enables effective CSS. The SUs in the data-fusion range cooperate to sense PU signals while others do not [56].

In multi-channel CR networks, it is impractical to make SUs to sense all the channels. The multi-channel coordination issues, such as, how to assign SUs to sense channels and to maximize the expected transmission time, have been studied in [57]. It has been shown that multi-channel coordination can improve CSS performance. Similar issues can be also found in sensor networks [58].

If the SUs cannot distinguish the signals from the PU and other SUs, it may lose the opportunity to access the spectrum [59]. The presence/absence of possible interference from other SU transmitters is a major component of the uncertainty limiting the detection performance. Coordinating the nearby SUs can reduce the uncertainty [59].

3.1.3. Sequential CSS

In CSS, SPRT can opportunistically reduce the sample size required to meet the reliability target. In [60], sequential detection scheme has been designed to minimize the detection time. In the scheme, each SU calculates the log-likelihood ratio of its measurement and the SBS accumulates these statistics to determine whether or not to stop making measurements. A robust design is developed for the scenarios with unknown system parameters, such as noise variance and signal power. Moreover, a tradeoff between sensing time and average data rate of the SUs based on sequential sensing for multi-channel system has been studied in [61]. A stopping policy and an access policy are given to maximize the total achievable rate of the SU system under a mis-detection probability constraint for each channel.

3.1.4. Compressive sensing

Compressive sensing can be applied as an alternative to reduce the sensing and feedback overhead. In [62], each SU senses linear combinations of multiple narrow bands by selective filters. The results are reported to the SBS, where matrix completion and joint sparsity recovery algorithms are applied to decode the occupied channels. Both algorithms allow exact recovery from incomplete reports and reduce feedback from the SUs to the SBS. Compressive sensing can also be used with other techniques [63].

3.2. Distributed CSS

In the centralized CSS, the cooperative SUs need to feed back information to the SBS, which may incur high communication overhead and make the whole network vulnerable to node failure. To address these problems, distributed CSS can be applied.

In the CR networks, an SU can act as a relay for others to improve sensing performance [64–66]. For the scheme in [64], one SU works as a amplify-and-forward (AF) relay for another SU to get the agility gain when the relay user detects the high PU signal power and the link between two SUs is good. The scheme is extended into multi-user networks [65]. To ensure asymptotic agility gain with probability one, a pairing protocol is developed. Besides AF relay scheme, a detect-and-relay (DR) scheme has been proposed [66], where only the relay SUs that detect the present of the PU signals forward the received signals to the SU transmitter. The results show that DR mode outperforms AF mode.

By using both temporal redundant information in two adjacent sensing periods and the spatial redundant information between two adjacent SUs, a space-time Bayesian compressive CSS for wideband networks has been developed to combat noise [67]. For the multi-hop CR networks, a scheme [68] has been proposed to compress the signal in the time domain rather than the power spectral density (PSD) domain by letting each SU estimate PU transmitter and its own signal iteratively, and exchanging information with its neighboring SUs to get the global decision about the availability of the spectrum.

3.3. Location awareness

CR networks may be equipped location and environmental awareness features [69] to further improve the performance. A conceptual framework for the location-awareness engine has been developed in [70]. Then, a CR positioning system has been introduced in [71] to facilitate cognitive location sensing. The location information of PUs and SUs can be used for determining spatial SHs [72]. Moreover, it is very important in public safety CR systems to detect and locate victims [73]. The above is only initial research in the area and more study is desired in the future.

3.4. Challenges

3.4.1. Common control channel

Common control channel between the SUs and the SBS is assumed in most of existing work, which requires extra channel resources and introduces additional complexity. Moreover, in the CR networks, it is difficult to establish a control channel at the beginning of the sensing stage and the change of the PUs' activities may affect the established control channel. In [74], a selective-relay based CSS scheme without common reporting control channels has been proposed. To limit interference to the PUs, only the relays (SUs) that detect the absence of the PU signal feedback to the SBS. The SBS then uses the received signals that experience fading to make a decision. Compared with the traditional scheme with common reporting control, the proposed scheme does not sacrifice the performance of the receiver operating characteristics (ROC). How to set up and maintain common control channel is still a challenge and an open issue for CR networks.

3.4.2. Synchronization

Most study is based on synchronous local observations. However, SUs locate at different places in practical CR systems, resulting in a synchronization problem for data fusion. To enable combination of both synchronous and asynchronous sensing information from different SUs, a probability-based combination method has been proposed in [75] by taking the time offsets among local sensing observations into account.

3.4.3. Non-ideal information

Most of the study analyzes the performance of CSS based on the perfect knowledge of the average received SNR of the PU transmitter signal. However, in practice, this is not always the case. The effect of average SNR estimation errors on the performance of CSS has been examined in [76]. In the noiseless-sample-based case, the probability of false alarm decreases as the average SNR estimation error decreases for both independent and correlated shadowings. In the noise-sample-based case, there exists a surprising threshold for the noise level. Below the threshold, the probability of false alarm increases as the noise level increases, where the probability decreases as the noise increases above the threshold.

4. Spectrum allocation and sharing

In the previous sections, we have discussed the spectrum sensing techniques for CR networks. Based on the sensing results, the SUs have information about the channels that they can access. However, the channel conditions may change rapidly and the behavior of the PUs might change as well. In order to achieve better system performance, SUs should decide which channel can be used for transmission together with when and how to access the channel. To protect the PU system, the interference generated by the SUs should also be taken into account. Moreover, one SU needs to consider the behavior of other co-existing SUs. In the section, we will discuss the spectrum allocation and sharing schemes to address these problems.

Depending on spectrum bands that the SUs use, the schemes can be divided into two types, namely open spectrum sharing and licensed spectrum sharing [6, 13]. In the open spectrum sharing system, all the users have the equal right to access the channels. The spectrum sharing among SUs for the unlicensed bands belongs to this type. The licensed spectrum sharing can also be called hierarchical spectrum access model. In such systems, the licensed PUs have higher priorities than the unlicensed SUs. Usually, there are no conflicts among PUs since they all have their own licensed bands. For the SUs, they need to adjust their parameters, such as transmit power and transmission strategy, to avoid the interruption to the PUs. According to the access strategies of the SUs, the hierarchical spectrum access model can be further divided into spectrum underlay and spectrum overlay [13]. In the spectrum underlay system, the SUs are allowed to transmit while the PUs are transmitting. The interference generated from the SUs need to be constrained to protect the PUs. The power control problem is one of the key issues in the systems. In the spectrum overlay systems, the SUs can only transmit when PUs are not or the SUs create interference-free transmission to the PUs by using some advanced techniques. Spectrum overlay is also called opportunistic spectrum access (OSA).

Another classification depends on whether there exists a central node to manage spectrum allocation and access procedure [6]. The whole procedure may be controlled by a central node. Due to the cost of the central node and information feedback, the centralized approaches may be impractical in some cases. In this case, the SUs may make their own decisions based on the observations of the local spectrum dynamics. This is called distributed spectrum sharing. Of course, several SUs in a system may cooperate with each other, which is called cooperative spectrum sharing [6].

In the following, we will discuss some important techniques on spectrum allocation and sharing.

4.1. Resource allocation and power control

In order to limit interference to the PUs created by the SUs, various resource allocation and power control schemes have been proposed for the CR networks.

4.1.1. Single-carrier and single-antenna systems

For a point-to-point system with single antenna, the spectrum sharing model can be shown as in Figure 4, where the SU transmitter can transmit as long as interference caused to the PU receiver is below a threshold. The channel gains from the SU transmitter to the SU receiver and the PU receiver are denoted g1 and g0, respectively. We denote the instantaneous transmit power at the SU transmitter as P(g0, g1). In such a system, the most common constraints to protect the PUs are peak or average interference powers constraints (IPCs). Under peak IPCs, the overall instantaneous interference power generated by the SUs must be below a threshold, Q pk , that is
Figure 4
Figure 4

Spectrum sharing model.

g 0 P ( g 0 , g 1 ) ≤ Q p k , ∀ ( g 0 , g 1 ) .
(7)
Similarly, the constraint on the average interference power can be expressed as
E [ g 0 P ( g 0 , g 1 ) ] ≤ Q a v ,
(8)
where Q av is a threshold. Moreover, the transmit power constraints (TPCs) of the SUs should be taken into account. The peak TPC can be expressed as
P ( g 0 , g 1 ) ≤ P p k ,
(9)
where P pk is the peak transmit power limit. The average TPC can be expressed as
E [ P ( g 0 , g 1 ) ] ≤ P a v ,
(10)

where P av is the average transmit power limit.

The power control for systems with single PU pair and single SU pair have been investigated in [77–80]. In [77], different kinds of capacity for the SU system, such as the ergodic, outage, and minimum-rate, are determined for Rayleigh fading environments under both peak and average IPCs. The analysis has been extended to the case with TPCs in [78]. It is shown that the average IPCs can provide higher capacities than the peak average IPCs. If the statistics of any sensing metric conditioned on the PU being ON/OFF are known a priori to the SU transmitter, optimal power control schemes [79] and adaptive rate and power control schemes [80] have been proposed to maximize SU system capacity subject to average IPCs and peak TPCs. The system throughput can be improved using soft information.

More general models with multiple PUs and SUs have been studied in [81]. The power allocation problems for sum-rate maximization on Gaussian cognitive MAC under mutual interferences between the PU and the SU communications are formulated as a standard non-convex quadratically constrained quadratic problem (QCQP) where semidefinite relaxation (SDR) has been applied to find a simple solution.

All the above study focuses on performance analysis for SU systems while the performance of PU systems under average and peak IPCs has been studied in [82]. It has been shown that the average IPCs can be advantageous over the peak IPCs in most cases. Moreover, the existing results demonstrated that the SU system can get better performance under average IPCs. Thus, average IPCs should be used in practice to protect both PU and SU systems.

Besides using IPCs, PU outage probability constraint (OPC) can be used to protect PU transmission [83, 84], where the outage probability of the PU transmission should not be below a given threshold. Under the OPC and average/peak TPCs, optimal power allocation strategies have been developed to maximize the ergodic and outage capacities of SU systems in [83]. It has better performance than IPCs. By utilizing the outage information from the PU receiver on the PU feedback channel as an inference signal for coordination, a discounted distributed power control algorithm has been proposed in [84] to maximize the utilities of the SUs under OPC and peak TPCs.

4.1.2. Multi-carrier and multi-channel systems

In a multi-carrier or multi-channel system, interference generated by the SU to the PU can be considered either in the whole bands/channels or each sub-band (sub-channel) separately. Similar to the case of single-carrier and single-antenna systems, the IPCs for the PUs can be divided into two types: peak and average IPCs.

Power control schemes under different constraints for both PU and SU systems have been extensively studied. In [85], capacity maximization for the SU system under TPCs as well as either peak or average IPCs is investigated. It is shown that the average IPC provides better performance for the SU system than the peak IPC. Instead of using IPC directly, optimal power allocation under OPC has been investigated [86]. With the CSIs of the PU link, the SU link, and the SU-to-PU link at the SU, a rate loss constraint (RLC) has been proposed, where the rate loss of the PUs due to the SU transmission should be below a threshold. Under RLC, the transmission efficiency of the SU system increases [87]. From practical point of view, a hybrid scheme by using both IPC and RLC is analyzed as well. Since the spectrum sensing results are not reliable, the probabilistic information of channel availability has been used to assist resource allocation in a multi-channel environment [88]. Compared with the conventional hard decision based IPCs, the proposed approach can utilize the spectrum more efficiently while protect the PUs from unacceptable interference. By considering the SINR requirements for the SUs, downlink channel assignment and power control schemes have been studied under the IPCs to the PUs [89] to maximize the number of active SUs.

Besides the above co-existence scenario, another scenario is in the multi-band system where PU and SU are co-located in the same area with side-by-side bands. For this scenario, power allocation schemes have been proposed in [90]. A risk-return model, which includes these two co-existence scenarios together, has been introduced in [91], and takes into account the reliability of the available sub-bands, their power constraints, and IPCs to the PUs. Besides the optimal power allocation, three suboptimal schemes, namely, the step-ladder, nulling, and scaling schemes have been developed.

4.1.3. Multi-antenna systems

For multi-antenna systems, most study jointly optimizes power allocation and beamforming [92–95]. Under IPCs and peak TPCs, the power allocation and beamforming design for sum-rate maximization and signal-to-interference-plus-noise ratios (SINRs) balancing problems have been studied for SIMO systems in [92]. For SINR balancing, all the SUs can achieve their targeted SINRs fairly. When linear minimum mean-square-error (MMSE) receivers are utilized, multiple constraints can be decoupled into several subproblems with a single constraint. The study of SINR-balancing has been extended into MIMO systems in [93], where a robust beamforming design is developed to limit the interference leakage to PU below a specific threshold with a certain probability. Beamforming for MIMO systems has been proposed to maximize the SINR of SUs under IPCs in [94]. A unified homogeneous quadratically constrained quadratic program is used to solve the optimization problems. In practice, it may be impossible that the SINR requirements of all the SUs are satisfied. For this situation, a joint beamforming and admission control scheme has been proposed to minimize the total transmit power of the SU system under IPCs [95].

4.1.4. Multi-hop systems

In a relay-assisted system, interference from all relay nodes to the PU receiver should be considered. In [96], transmit power allocation (TPA) schemes among relays have been studied, where overall transmit power is minimized under IPCs as well as the SINR requirement of the targeting SU receiver. A fully distributed TPA has been proposed and provides an almost optimal solution as centralized solution. To reduce the energy consumption of the fully distributed TPA, a distributed feedback assisted TPA has been proposed by feeding back the estimated real-valued transmit power. Besides power allocation, channel allocation has been studied in [97]. In a three-node CR network, end-to-end transmission is categorized into three modes, namely direct, dual-hop, and relay channels. The optimal end-to-end channel and power allocation scheme can be realized by analyzing optimal power allocation for each mode and choosing the mode that can provide the highest system throughput. Joint rate, power control, and channel allocation problem to maximize the throughput of the relay-assisted SU system has been studied in [98], where an optimal solution can be obtained by dividing the original problem into a base station (BS) master problem and the relay station subproblems.

4.2. Spectrum sharing game

Game theory is a well-developed mathematical tool to model strategic situations, where any individual's success in making choices depends on the choices of others. In the CR networks, the SUs compete for spectrum resources to maximize their own utilities where game theory models can be used [99]. Moreover, the game theory can be also utilized to analyze both the PU and SU systems' behaviors, where they try to maximize their own profits.

From the game-theoretical perspective, power control can be formulated as a distributed game among all the SUs [100], where SUs maximize their own utilities by adjusting transmission powers. The total CR network capacity is maximized when the game reaches a Nash equilibrium (NE). In a uplink multiuser CR system, a non-cooperative power control game among SUs can be applied to maximize energy efficiency with a fairness constraint [101]. To jointly design waveform and resource allocation, a general framework has been developed [102], which can be applied to many radio platforms, such as frequency, time, or code division multiplexing, and even agile framework with different expansion functions.

The above study considers SU system only. To take the activities of PUs into account, a dynamic spectrum leasing paradigm based on a game-theoretical framework has been proposed [103, 104], which provides an incentive for the PUs to actively allow SUs' transmission.

Besides for the resource allocation, game theory can also have other applications in CR networks, such as stimulating the cooperation between SUs [105] and combating PU emulation attacks [106, 107].

However, there are still unaddressed issues in this area. Only spectrum sharing constraints are imposed on the games in most of existing study. Deviations from the ideal games due to non-cooperating SUs or channel constraints still need further study.

4.3. Spectrum decision

If there are multiple available bands, the CR networks should be able to decide the best one for each SU. This procedure is called spectrum decision [108, 109]. Compared to traditional spectrum sharing that is designed as a short-term operation to adapt to the fast time-varying channels, spectrum decision considers long-term channel characteristics. Generally, spectrum decision consists of two main steps: channel characterizing and spectrum assigning. Channel characteristics such as path loss, link errors, and link delay are first obtained based on both current observations of SUs and statistics information of PUs. The best spectrum band is then assigned to each SU. In [109], a spectrum decision framework for CR networks has been discussed. A minimum variance-based and a maximum capacity-based spectrum decision schemes have been developed for real-time applications and best-effort applications, respectively. Moreover, learning mechanisms can be equipped to assist the decision making procedure [110–112]. In [110], the use of reinforcement learning algorithm for spectrum assignment in WCDMA systems has been evaluated to show the satisfactory results under different load conditions. Based on the learning mechanisms, the spectrum decision making problem can also be modeled as a multi-armed bandit problem, which can be solved by upper confidence bound algorithm [111, 112]. Even though there exists some study about spectrum decision, it is still an open topic.

4.4. Spectrum handoff

During the transmission of SUs, the PUs may appear to claim their assigned channels. When this occurs, SUs need to stop transmission, vacate the channels in contention, and find other available channels to continue transmission, which is called spectrum handoff [6]. When a SU changes its spectrum, its transmission suspends, which invariably leads to latency increase. To ensure smooth and fast transition with minimum performance degradation, a good spectrum handoff mechanism is required [113–117]. One way to alleviate latency is to reserve a certain number of spectrum bands for spectrum handoff [113]. SUs immediately use the reserved spectrum bands when it is necessary. However, the number of the reserved bands should be chosen carefully to balance the spectrum efficiency and handoff performance. Another way is proactive spectrum handoff [114], where SUs vacate channels before PUs utilize them to avoid collision. This is obviously too idealistic in many settings unless the SU is capable of predicting PU behavior as in opportunistic spectrum access. Its performance gain over the reactive spectrum handoff has been demonstrated. To evaluate the latency performance of spectrum handoff, an analytical framework has been proposed in [115]. The effects of general service time distribution, various operating channels, and queueing behaviors of multiple SU connections are also considered.

To achieve reliable continuous transmission, SUs can choose spectrum bands owned by different PUs [116, 117]. Even if a PU reappears, SUs can continue transmission on others. The spectrum diversity also helps to increase the transmission reliability.

4.5. Transmission design for CR systems

In CR networks, the transmission protocols of the SUs can be designed to achieve satisfactory system performance together with fulfilling the IPCs for the PUs.

Relays are the most common choices for increasing SU system performance, as shown in Figure 5. Unlike the traditional cooperation transmission system, the performance of the cooperative SU system decreases by introducing the IPCs. For example, the outage probability may increase [118]. With the increase of the number of relays, the outage performance gap decreases. The relays in the CR networks can assist the transmission between the SU transmitter and receiver to reduce the required transmit power and decrease the interference generated to the PU system [119]. The transmission opportunities created through this way are called as spatial SHs. The relay selection for outage performance optimization of the SU system under either IPCs [120] or OPC [121] for the PU system have been studied. Power allocation and relay selection can be designed jointly to maximize SU system throughput [122]. Moreover, spectrum sensing and relay selection can be designed jointly [74, 123]. Without a dedicated relay channel, the best relay is selected for transmission based on the sensing information from the relays that detect the PU signals.
Figure 5
Figure 5

Relay-aided transmission in SU system.

The SU itself can work as a relay to assist PU transmission while transmitting its own data at the same time [124, 125]. A two-phase transmission protocol in a single antenna system has been considered in [124], where the PU transmits in the first phase and the SU transmitter assigns fractions of the available power to the PU data and its own data for the second phase transmission, respectively. This protocol guarantees the performance of the PU system. With the help of a multi-antenna SU transmitter, both PU and SU systems can achieve better performance by beamforming at the AF SU transmitter [125].

To reduce interference in a MIMO system, the spatial freedom created by antennas can be used. An opportunistic spatial orthogonalization (OSO) scheme [126] has been proposed. With OSO, the SU system can get significant performance improvement without sacrificing of PU system's performance much. Taking the time dimension into account, the interference-free co-existing PU and SU transmission can be achieved based on orthogonal space-time coding [15].

4.6. Challenges

4.6.1. Joint sensing and access

In most existing work, the sensing and access techniques are designed separately. However, these two parts are interactive. With different objectives of SU systems, different protection levels for PU systems are needed. It is beneficial to consider these two parts jointly [127]. A joint sensing time and power allocation scheme has been studied in [127] under the average IPCs and TPCs to maximize the ergodic throughput of SU systems. More study is desired in this topic.

4.6.2. Channel estimation

The link condition between PU and SU is an important parameter for most of techniques in CR networks. However, the SU-to-PU channel gain is difficult to be obtained by the SU in practice. To estimate the link condition, the SU can observe PU's behavior by sending out a disturbing probing signal [128] or eavesdrop PU's automatic repeat request feedback information [129]. To avoid estimation of the actual channels between SU transmitter and PUs, a novel practical cognitive beamforming [130] has been proposed based on the effective interference channel, which combines information of the actual channels and the beamforming vectors used by the PUs.

5. Applications of CR

The development of spectrum sensing and spectrum sharing techniques enable the applications of CR in many areas. In this section, we introduce some of them.

5.1. TV white spaces

The main regulatory agencies for the unlicensed use of TV white spaces are the FCC in the United States, the Office of Communications (Ofcom) in the United Kingdom, and the Electronic Communications Committee (ECC) of the conference of European Post and Telecommunications in Europe. After many years of effort in this area, FCC released the final rules for using the TV white space in September 2010 [131], which led to the culmination of this field. Meanwhile, other agencies have also been getting progress [132]. This is based on the idea of having an accessible database (centralize-fashion) of free TV bands, otherwise called TV white space, or to sense and obtain SHs (distributed-fashion) within TV bands to utilize for SUs communication.

5.2. Cellular networks

The applications of CR in cellular networks are emerging in recent years. To overcome the indoor coverage problem and adapt to traffic growth, the concept of small cells, such as femtocells, has been proposed in 3GPP LTE-Advanced (LTE-A) [133] and IEEE 802.16m [134], and companies like PicoChip driving femtocell revolution. The femtocell unit has the function of the typical BS (eNodeB in LTE). However, the self-deployment property of the femtocells makes the centralized interference management impractical. Figure 6 illustrates the femtocell interference scenario, where distributed spectrum planning schemes are needed. With CR, the femtocells can search and estimate the available spectrum bands in order to maintain the coverage and avoid the interference to other femtocells and macrocells.
Figure 6
Figure 6

Illustration of femtocell interference.

5.3. Military usage

CR is a must-have technique for military usage. With CR, the users can recognize the enemies' communications and protect their own's. Moreover, the users can search for more transmission opportunities. The US department of defense (DoD) has already established programs such as SPEAKeasy radio system and next Generation (XG) to exploit the benefits of CR techniques [6].

5.4. Emergency networks

Under severe conditions or extreme situations, e.g., natural disasters and accidents, first re-sponders need to detect and locate survivors and maintain reliable communications between responders and public safety agencies. The infrastructure of the current wireless communication systems is inadequate to meet the future demands of emergency response. The opportunistic spectrum usage provided by CR techniques could be used to realize efficient and reliable emergency network transmission. The FCC has designated a 700 MHz (698-806 MHz) frequency band for emergency use [135, 136]. The public safety broadband licensee will have priority to access these portions of the commercial spectrum during emergency. Still, there remain some challenges for emergency networks. Possible applications for CR include accurately locating survivors in extreme environments and improving reliability and efficiency of communications. Energy efficiency is particularly important because battery life limits successful operations.

6. Conclusions

CR technology has been studied to increase the spectrum utilization efficiency. With spectrum sensing techniques, the SUs are able to monitor the activities of the PUs. To address the limitations of the spectrum sensing techniques by a single SU, CSS schemes have been discussed. Based on the spectrum sensing results, the SUs can access the spectrum bands under the interference limit to the PUs. Different spectrum sharing and allocation schemes have been considered to increase the spectrum efficiency. Even though many critical issues in CR have been addressed in the past decade, there are still some challenges. Nevertheless, we believe the CR technology will be applied to many real systems in the near future.

Due to the space limitation, we have left out some topics, such as security, policy issues, and CR implementation architecture. The readers can refer to some other publications in recent special issues, e.g., [137–140], which may cover these topics.

Declarations

Acknowledgements

This study was supported in part by the research project from Sandia National Laboratories.

Authors’ Affiliations

(1)
School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA 30332-0250, USA

References

  1. Spectrum Policy Task Force Report. 2002. FCC ET Docket 02-155Google Scholar
  2. Mitola J: Software radios: survey, critical evaluation and future directions. IEEE Aerosp Electron Syst Mag 1993, 8(4):25-31.Google Scholar
  3. Mitola J, Maguire GQ: Cognitive radio: making software radios more personal. IEEE Personal Commun 1999, 6(4):13.Google Scholar
  4. Haykin S: Cognitive radio: Brain-empowered wireless communication. IEEE J Sel Areas Commun 2005, 23: 201-220.Google Scholar
  5. Jondral FK: Software-defined radio-basics and evolution to cognitive radio. EURASIP J Wirel Commun Netw 2005, 2005: 275-283.Google Scholar
  6. Akyildiz IF, Lee W-Y, Mohanty S: Next generation/dynamic spectrum access/cognitive radio wireless networks: A survey. Comput Netw 2006, 50: 2127-2159.Google Scholar
  7. Stevenson C, Chouinard G, Lei Z-D, Hu W-D, Shellhammer S, Caldwell W: IEEE 802.22: The first cognitive radio wireless regional area network standard. IEEE Commun Mag 2009, 47(1):130.Google Scholar
  8. Ghasemi A, Sousa ES: Spectrum sensing in cognitive radio networks: Requirements, challenges and design trade-offs. IEEE Commun Mag 2008, 46(4):32-39.Google Scholar
  9. Ma J, Li GY, Juang BH: Signal processing in cognitive radio. Proc IEEE 2010, 97(5):805-823.Google Scholar
  10. Haykin S, Thomson DJ, Reed JH: Spectrum sensing for cognitive radio. Proc IEEE 2010, 97(5):849-877.Google Scholar
  11. Sahai A, Hoven N, Tandra R: Some fundamental limits in cognitive radio, in. Proc Allerton Conf Commun Control Comput 2004.Google Scholar
  12. Cabric D, Mishra SM, Brodersen RW: Implementation issues in spectrum sensing for cognitive radios, in. Proc Asilomar Conf Signals, Syst Comput 2004.Google Scholar
  13. Zhao Q, Sadler B: A survey of dynamic spectrum access. IEEE Signal Process Mag 2007, 24(3):79-89.Google Scholar
  14. Clancy T: Achievable capacity under the interference temperature model, in. Proc 26th IEEE Int Conf Comput Commun (INFOCOM) 2007.Google Scholar
  15. Bohara VA, Ting SH, Han Y, Pandharipande A: Interference-free overlay cognitive radio network based on cooperative space time coding, in. Proc 5th Int Conf on Cognitive Radio Oriented Wireless Netw and Commun 2010.Google Scholar
  16. Ghozzi M, Dohler M, Marx F, Palicot J: Cognitive radio: methods for the detection of free bands. Comptes Rendus Physique 2006, 7(7):74-81.Google Scholar
  17. Ghasemi A, Sousa ES: Impact of user collaboration on the performance of opportunistic spectrum schemes, in. Proc IEEE Veh Technol Conf 2006.Google Scholar
  18. HLV Trees In Detection, Estimation and Modulation Theory: Part I. John Wiley & Sons Inc., New York; 2001.Google Scholar
  19. Taherpour A, Nasiri-Kenari M, Gazor S: Multiple antenna spectrum sensing in cognitive radios. IEEE Trans Wirel Commun 2010, 9: 814-823.Google Scholar
  20. Lei Z-D, Chin FPS: Sensing OFDM systems under frequency-selective fading channels. IEEE Trans Veh Technol 2010, 6(4):1960-1968.Google Scholar
  21. Axell E, Larsson EG: Optimal and sub-optimal spectrum sensing of OFDM signals in known and unknown noise variance. IEEE J Sel Areas Commun 2011, 29: 290-304.Google Scholar
  22. Wald A: Sequential Analysis. John Wiley & Sons Inc., New York; 1947.Google Scholar
  23. Sun Z-W, Bradfor GJ, Laneman JN: Sequence detection algorithms for PHY-layer sensing in dynamic spectrum access networks. IEEE J Sel Topics Signal Process 2011, 5(1):97-109.Google Scholar
  24. Sonnenschein A, Fishman PM: Radiometric detection of spread-spectrum signals in noise of uncertain power. IEEE J Sel Topics Signal Process 2008, 2(1):4-17.Google Scholar
  25. Tandra R, Sahai A: SNR walls for signal detection. IEEE J Sel Topics Signal Process 2008, 2(1):4-17.Google Scholar
  26. Jouini W: Energy detection limits under log-normal approximated noise uncertainty. IEEE Signal Process Lett 2011, 18(7):423-426.Google Scholar
  27. Ghozzi M, Marx F, Dohler M, Palicot J: Cyclostatilonarilty-based test for detection of vacant frequency bands, in. Proc 2nd Int Conf on Cognitive Radio Oriented Wireless Netw and Commun 2006.Google Scholar
  28. Sutton PD, Nolan KE, Doyle LE: Cyclostationary signature in practial cognitive radio applications. IEEE J Sel Areas Commun 2008, 26: 13-24.Google Scholar
  29. Gardner W: Signal interception: A unifying theoretical framework for feature detection. IEEE Trans Commun 1988, 8: 897-906.Google Scholar
  30. Quan Z, Zhang WY, Shellhammer SJ, Sayed AH: Optimal spectral feature detection for spectrum sensing at very low SNR. IEEE Trans Commun 2011, 51: 201-212.Google Scholar
  31. Khalaf Z, Nafkha A, Palicot J, Ghozzi M: Hybrid spectrum sensing architecutre for cognitive radio equipment, in. Proc 6th Advanced Int Conf on Telecommun 2010.Google Scholar
  32. Zeng YH, Liang YC: Eigenvalue-based spectrum sensing algorithms for cognitive radio. IEEE Trans Commun 2009, 57: 1784-1793.Google Scholar
  33. Kortun A, Ratnarajah T, Sellathurai CM, Zhong , Papadias CB: On the performance of eigenvalue-based cooperative spectrum sensing for cognitive radio. IEEE J Sel Topics Signal Process 2011, 5(1):49-55.Google Scholar
  34. Cui T, Tang J, Gao F, Tellambura C: Moment-based parameter estimation and blind spectrum sensing for quadrature amplitude modulation. IEEE Trans Commun 2011, 59: 613-623.Google Scholar
  35. Cordeiro C, Ghosh M, Cavalcanti D, Challapali K: Spectrum sensing for dynamic spectrum access of TV bands, in. Proc 2nd Int Conf on Cognitive Radio Oriented Wireless Netw and Commun 2007.Google Scholar
  36. Liang YC, Zeng YH, Peh ECY, Hoang AT: Sensing-throughput tradeoff for cognitive radio networks. IEEE Trans Wireless Commun 2008, 7: 1326-1337.Google Scholar
  37. Zou Y-L, Yao Y-D, Zheng BY: Outage probability analysis of cognitive transmissions: Impact of spectrum sensing overhead. IEEE Trans Wirel Commun 2010, 9: 2676-2688.Google Scholar
  38. Hoang AT, Liang YC, Zeng YH: Adaptive joint scheduling of spectrum sensing and data transmission in cognitive radio networks. IEEE Trans Commun 2010, 58: 235-246.Google Scholar
  39. Kim H, Shin KG: Efficient discovery of spectrum opportunities with mac-layer sensing in cognitive radio networks. IEEE Trans Mobile Comput 2008, 7(5):533-545.MathSciNetGoogle Scholar
  40. Song SH, Hamdi K, Letaief KB: Spectrum sensing with active cognitive systems. IEEE Trans Wirel Commun 2010, 9: 1849-1854.Google Scholar
  41. Sahai A, Cabric D: A tutorial on spectrum sensing: Fundamental limits and practical challenges, in. Proc IEEE Int Symp on New Frontier in Dynamic Spectrum Access Networks (DySPAN) 2005.Google Scholar
  42. Hoseini PP, Beaulieu NC: An optimal algorithm for wideband spectrum sensing in cognitive radio systems, in. Proc IEEE Int Conf Commun (ICC) 2010.Google Scholar
  43. Paysarvi-Hoseini P, Beaulieu NC: Optimal wideband spectrum sensing framework for cognitive radio systems. IEEE Trans Signal Process 2011, 59: 1170-1182.MathSciNetGoogle Scholar
  44. Quan Z, Cui S, Sayed AH, Poor HV: Optimal multiband joint detection for spectrum sensing in cognitive radio networks. IEEE Trans Signal Process 2009, 57: 1128-1140.MathSciNetGoogle Scholar
  45. Qu D-M, Ding J, Jiang T, Sun X-J: Detection of non-contiguous OFDM symbols for cognitive radio systems without out-of-band spectrum synchronization. IEEE Trans Wirel Commun 2011, 10: 693-701.Google Scholar
  46. Ma J, Zhao GD, Li YG: Soft combination and detection for cooperative spectrum sensing in cognitive radio networks. IEEE Trans Wirel Commun 2008, 7: 4502-4506.Google Scholar
  47. Quan Z, Cui S, Sayed AH: Optimal linear cooperation for spectrum sensing in cognitive radio networks. IEEE J Sel Topics Signal Process 2008, 2(1):28-40.Google Scholar
  48. Taricco G: Optimization of linear cooperative spectrum sensing for cognitive radio networks. IEEE J Sel Topics Signal Process 2011, 5(1):77-86.Google Scholar
  49. Fan R, Jiang H: Optimal multi-channel cooperative sensing in cognitive radio networks. IEEE Trans Wirel Commun 2010, 9: 1128-1138.Google Scholar
  50. Sanna M, Murroni M: Optimization of non-convex multiband cooperative sensing with genetic algorithms. IEEE J Sel Topics Signal Process 2011, 5(1):87-96.Google Scholar
  51. Peh ECY, Liang YC: Optimization for cooperative sensing in cognitive radio networks. Proc IEEE Wireless Commun and Networking Conf (WCNC) 2007.Google Scholar
  52. Peh ECY, Liang YC, Guan YL, Zeng YH: Optimization of cooperative sensing in cognitive radio networks: a sensing-throughput tradeoff view. IEEE Trans Veh Technol 2010, 58: 5294-5299.Google Scholar
  53. Han W, Li J, Tian Z, Zhang Y: Efficient cooperative spectrum sensing with minimum overhead in cognitive radio. IEEE Trans Wirel Commun 2010, 9(3):3006-3010.Google Scholar
  54. Peh ECY, Liang YC, Guan YL, Zeng YH: Cooperative spectrum sensing in cognitive radio networks with weighted decision fusion schemes. IEEE Trans Wire Commun 2010, 9: 3838-3847.Google Scholar
  55. Unnikrishnan J, Veeravalli VV: Cooperative sensing for primary detection in cognitive radio. IEEE J Sel Topics Signal Process 2008, 2(1):18-27.Google Scholar
  56. Min AW, Zhang X, Shin KG: Detection of small-scale primary users in cognitive radio networks. IEEE J Sel Areas Commun 2011, 29: 349-361.Google Scholar
  57. Song C, Zhang Q: Cooperative spectrum sensing with multi-channel coordination in cognitive radio networks, in. Proc IEEE Int Conf Commun (ICC) 2010.Google Scholar
  58. Kaligineedi P, Bhargava VK: Sensor allocation and quantization schemes for multi-band cognitive radio cooperative sensing system. IEEE Trans Wirel Commun 2011, 10: 284-293.Google Scholar
  59. Sahai A, Tandra R, Mishra S, Hoven N: Fundamental design tradeoffs in cognitive radio systems, in. Proc 1st Int Workshop Technol Policy for Accessing Spectrum 2006.Google Scholar
  60. Zou Q-Y, Zheng SF, Sayed AH: Cooperative sensing via sequential detection. IEEE Trans Signal Process 2010, 58: 6266-6283.MathSciNetGoogle Scholar
  61. Kim S-J, Giannakis GB: Sequential and cooperative sensing for multi-channel cognitive radios. IEEE Trans Signal Process 2010, 58: 4239-4253.MathSciNetGoogle Scholar
  62. Meng J, Yin J, Li W, Hossain H, Zhu EH: Collaborative spectrum sensing from sparse observations in cognitive radio networks. IEEE J Sel Areas Commun 2011, 29: 327-337.Google Scholar
  63. Kim S-J, Anese ED, Giannakis GB: Cooperative spectrum sensing for cognitive radios using kriged kalman filtering. IEEE J Sel Topics Signal Process 2011, 5(1):24-36.Google Scholar
  64. Ganesan G, Li YG: Cooperative spectrum sensing in cognitive radio part I: Two user networks. IEEE Trans Wireless Commun 2007, 6(6):2204-2213.Google Scholar
  65. Ganesan G, Li YG: Cooperative spectrum sensing in cognitive radio part II: Multiuser networks. IEEE Trans Wirel Commun 2007, 6: 2214-2222.Google Scholar
  66. Chen Q, Motani M, Wong W-CL: A Nallanathan, Cooperative spectrum sensing strategies for cognitive radio mesh networks. IEEE J Sel Topics Signal Process 2011, 5(1):56-67.Google Scholar
  67. Zhang ZH, Li H-S, Yang DP, Pei C-X: Space-time bayesian compressed spectrum sensing for wideband cognitive radio networks, in. Proc IEEE Int Symp on New Frontier in Dynamic Spectrum Access Networks (DySPAN) 2010.Google Scholar
  68. Zeng F, Li C, Tian Z: Distributed compressive spectrum sensing in cooperative multihop cognitive networks. IEEE J Sel Topics Signal Process 2011, 5(1):37-48.Google Scholar
  69. Celebi H, Guvenc I, Gezici S, Arslan H: Cognitive-radio systems for spectrum, location, environmental awareness. IEEE Antennas propag Mag 2010, 52(4):41-61.Google Scholar
  70. Celebi H, Arslan H: Utilization of location information in cognitive wireless networks. IEEE Commun Mag 2007, 14(4):6-13.Google Scholar
  71. Celebi H, Arslan H: Adaptive positioning systems for cognitive radios, in. Proc IEEE Int Symp on New Frontier in Dynamic Spectrum Access Networks (DySPAN) 2007.Google Scholar
  72. Wang L, Chen A: Effects of location awareness on concurrent transmissions for cognitive ad hoc networks overlaying infratructure-based systems. IEEE Trans Mobile Comput 2009, 8(5):577-589.Google Scholar
  73. Gorcin A: Rss-based location awareness for public safety cognitive radio, in. Proc IEEE Wireless VITAE 2009.Google Scholar
  74. Zou Y-L, Yao Y-D, Zheng BY: A selective-relay based cooperative spectrum sensing scheme without dedicated reporting channels in cognitive radio networks. IEEE Trans Wirel Commun 2011, 10(4):1188-1198.Google Scholar
  75. Zhou XW, Ma J, YG Li, Kwon Y, Soong A: Probability-based combination for cooperative spectrum sensing. IEEE Trans Commun 2010, 58: 463-466.Google Scholar
  76. Chen YF, Beaulieu NC: Performance of collaborative spectrum sensing for cognitive radio in the presence of gaussian channel estimation errors. IEEE Trans Commun 2009, 57: 1944-1947.Google Scholar
  77. Musavian L, Aissa S: Capacity and power allocation for spectrum-sharing communications in fading channels. IEEE Trans Wirel Commun 2009, 8: 148-156.Google Scholar
  78. Kang X, Liang YC, Nallanathan A, Garg HK, Zhang R: Optimal power allocation for fading channels in cognitive radio networks: Ergodic capacity and outage capacity. IEEE Trans Wirel Commun 2009, 8: 940-950.Google Scholar
  79. Srinivasa S, Jafar SA: Soft sensing and optimal power control for cognitive radio. IEEE Trans Wirel Commun 2010, 9: 3638-3649.Google Scholar
  80. Asghari V, Aissa S: Adaptive rate and power transmission in spectrum-sharing systems. IEEE Trans Wirel Commun 2010, 9: 3272-3280.Google Scholar
  81. Han S-W, Kim H, Han Y, Cioffi JM: Efficient power allocation schemes for nonconvex sum-rate maximization on gaussian cognitive MAC. IEEE Trans Commun 2010, 58: 753-757.Google Scholar
  82. Zhang R: On peak versus average interference power constraints for protecting primary users in cognitive radio networks. IEEE Trans Wirel Commun 2009, 8: 2112-2120.Google Scholar
  83. Kang X, Zhang R, Liang YC, Garg HK: Optimal power allocation strategies for fading cognitive radio channels with primary user outage constraint. IEEE J Sel Areas Commun 2011, 29: 374-383.Google Scholar
  84. Huang S, Liu X, Ding Z: Decentralized cognitive radio control based on inference from primary link control information. IEEE J Sel Areas Commun 2011, 29: 394-406.Google Scholar
  85. Son K, Jung BC, Chong S, Sung DK: Opportunistic underlay transmission in multi-carrier cognitive radio systems, in. Proc IEEE Wireless Commun and Networking Conf (WCNC) 2009.Google Scholar
  86. Son K, Jung BC, Chong S, Sung DK: Power allocation for OFDM-based cognitive radio systems under outage constraints, in. Proc IEEE Int Conf Commun (ICC) 2010.Google Scholar
  87. Kang X, Garg HK, Liang YC, Zhang R: Optimal power allocation for OFDM-based cognitive radio with new primary transmission protection criteria. IEEE Trans Wirel Commun 2010, 9: 2066-2075.Google Scholar
  88. Zhou X, Li GY, Li D, Wang D, Soong ACK: Probabilistic resource allocation for opportunistic spectrum access. IEEE Trans Wireless Commun 2010, 9: 2870-2879.Google Scholar
  89. Hoang AT, Liang YC: Downlink channel assignment and power control for cognitive radio networks. IEEE Trans Wirel Commun 2008, 7: 3106-3117.Google Scholar
  90. Bansal G, Hossain MJ, Bhargava VK: Optimal and suboptimal power allocation schemes for OFDM-based cognitive radio systems. IEEE Trans Wirel Commun 2008, 7: 4710-4718.Google Scholar
  91. Hasan Z, Bansal G, Hossain E, Bhargava VK: Energy-efficient power allocation in OFDM-based cognitive radio systems: a risk-return model. IEEE Trans Wirel Commun 2009, 8: 6078-6088.Google Scholar
  92. Zhang L, Liang YC, Xin Y: Joint beamforming and power allocation for multiple access channels in cognitive radio networks. IEEE J Sel Areas Commun 2008, 26: 38-51.Google Scholar
  93. Xiong ZL, Cumanan K, Lambotharan S: Robust SINR balancing technique for a cognitive radio network using probability based interference constraints, in. Proc IEEE Int Symp on New Frontier in Dynamic Spectrum Access Networks (DySPAN) 2010.Google Scholar
  94. Zhang Y-JA, So AM-C: Optimal spectrum sharing in MIMO cognitive radio networks via semidefinite programming. IEEE J Sel Areas Commun 2011, 29: 362-373.Google Scholar
  95. Islam MH, Liang YC, Hoang AT: Joint power control and beamforming for cognitive radio networks. IEEE Trans Wirel Commun 2008, 7: 2415-2419.Google Scholar
  96. Mietzner J, Lampe L, Schober R: Distributed transmit power allocation for multihop cognitive radio systems. IEEE Trans Wirel Commun 2009, 8: 5187-5201.Google Scholar
  97. Zhao GD, Yang CY, Li GY, Li D-D, Soong A: Power and channel allocation for cooperative relay in cognitive radio networks. IEEE J Sel Topics Signal Process 2011, 15(1):151-159.Google Scholar
  98. Wang R, Lau VKN, Cui Y: Decentralized fair scheduling in two-hop relay-assisted cognitive OFDMA systems. IEEE J Sel Topics Signal Process 2011, 15(1):171-181.MathSciNetGoogle Scholar
  99. Ji Z, Liu KJR: Dynamic spectrum sharing: A game theoretical overview. IEEE Commun Mag 2007, 45: 88-94.MathSciNetGoogle Scholar
  100. Lin Y-E, Liu K-H, Hsieh HY: Design of power control protocols for spectrum sharing in cognitive radio networks: A game-theoretic perspective, in. Proc IEEE Int Conf Commun (ICC) 2010.Google Scholar
  101. Buzzi S, Saturnino D: A game-theoretic approach to energy-efficient power control and receiver design in cognitive CDMA wireless networks. IEEE J Sel Topics Signal Process 2011, 5(1):137-150.Google Scholar
  102. Tian Z, Leus G, Lottici V: Joint dynamic resource allocation and waveform adaptation for cognitive networks. IEEE J Sel Areas Commun 2011, 29: 443-454.Google Scholar
  103. Jayaweera SK, Vazquez-Vilar G, Mosquera C: Dynamic spectrum leasing: A new paradigm for spectrum sharing in cognitive radio networks. IEEE Trans Veh Technol 2010, 59(5):2328-2339.Google Scholar
  104. El-Howayek G, Jayaweera SK: Distributed dynamic spectrum leasing (d-dsl) for spectrum sharing over multiple primary channels. IEEE Trans Wirel Commun 2011, 10: 55-60.Google Scholar
  105. Wu Y-L, Wang BB, Liu KJR, Clancy TC: Repeated open spectrum sharing game with cheat-proof strategies. IEEE Trans Wirel Commun 2009, 8: 1922-1933.Google Scholar
  106. Li H-S, Han Z: Dogfight in spectrum combating primary user emulation attacks in cognitive radio systems, part i known channel statistics. IEEE Trans Wirel Commun 2010, 9: 3566-3577.Google Scholar
  107. Li H-S, Han Z: Dogfight in spectrum: Combating primary user emulation attacks in cognitive radio systems-part ii: Unknown channel statistics. IEEE Trans Wirel Commun 2011, 10: 274-283.MathSciNetGoogle Scholar
  108. Akyildiz IF, Lee W-Y, Vuran MC, Mohanty S: A survey on spectrum management in cognitive radio networks. IEEE Commun Mag 2008, 46(4):40-48.Google Scholar
  109. Lee W-Y, Akyildiz IF: A spectrum decision framework for cognitive radio networks. IEEE Trans Mobile Comput 2011, 10(2):161-174.Google Scholar
  110. Vucevic N, Perez-Romero J, Sallent O, Agusti R: Reinforcement learning for dynamic spectrum management in WCDMA. Telfor J 2009, 1(1):6-9.Google Scholar
  111. Jouini W, Ernst D, Moy C, Palicot J: Upper confidence bound based decision making strategies and dynamic spectrum access, in. Proc IEEE Int Conf Commun (ICC) 2010.Google Scholar
  112. Jouini W, Moy C, Palicot J: Upper confidence bound algorithm for opportunistic spectrum access with sensing errors, in. Proc 6th Int Conf on Cognitive Radio Oriented Wireless Netw and Commun 2011.Google Scholar
  113. Zhu X, Shen L, Yum T: Analysis of cognitive radio spectrum access with optimal channel reservation. IEEE Commun Lett 2007, 11(4):304-306.Google Scholar
  114. Song Y, Xie JL: Prospect: A proactive spectrum handoff framework for cognitive radio ad hoc networks without common control channel. IEEE Trans Mobile Comput (to appear, 2011)Google Scholar
  115. Wang L, Wang C, Chang C: Modeling and analysis for spectrum handoffs in cognitive radio networks. IEEE Trans Mobile Comput (to appear, 2011)Google Scholar
  116. Kushwaha H, Xing Y, Chandramouli R, Heffes H: Reliable multimedia transmission over cogntiive radio networks using fountain codes. Proc IEEE 2008, 96(1):155-165.Google Scholar
  117. Willkomm D, Gross J, Wolisz A: Reliable link maintenance in cognitive radio systems, in. Proc IEEE Int Symp on New Frontier in Dynamic Spectrum Access Networks (DySPAN) 2005.Google Scholar
  118. Lee J, Wang H, Andrews JG, Hong D: Outage probability of cognitive relay networks with interference constraints. IEEE Trans Wirel Commun 2011, 10: 390-395.Google Scholar
  119. Zhao GD, Ma J, Li GY, Wu T, Kwon Y, Soong A, Yang CY: Spatial spectrum holes for cognitive radio with relay-assisted directional transmission. IEEE Trans Wirel Commun 2009, 8: 5270-5279.Google Scholar
  120. Han Y, Ting SH, Pandharipande A: Cooperative spectrum sharing protocol with secondary user selection. IEEE Trans Wirel Commun 2009, 9: 2912-2923.Google Scholar
  121. Zou Y-L, Zhu J, Zheng BY, Yao Y-D: An adaptive cooperation diversity scheme with best-relay selection in cognitive radio networks. IEEE Trans Signal Process 2010, 58: 5438-5445.MathSciNetGoogle Scholar
  122. Li L-Y, Zhou XW, Xu H-B, Li GY, Wang DD, Soong A: Simplified relay selection and power allocation in cooperative cognitive radio systems. IEEE Trans Wirel Commun 2011, 10: 33-36.Google Scholar
  123. Zou Y-L, Yao Y-D, Zheng BY: Cognitive transmissions with multiple relays in cognitive radio networks. IEEE Trans Wirel Commun 2011, 10: 648-659.Google Scholar
  124. Han Y, Pandharipande A, Ting SH: Cooperative decode-and-forward relaying for secondary spectrum access. IEEE Trans Wirel Commun 2009, 8: 4945-4950.Google Scholar
  125. Manna R, Louie R, Li Y, Vucetic B: Cooperative amplify-and-forward relaying in cognitive radio networks, in. Proc 5th Int Conf on Cognitive Radio Oriented Wireless Netw and Commun 2010.Google Scholar
  126. Shen C, Fitz MP: Opportunistic spatial orthogonalization and its application in fading cognitive radio networks. IEEE J Sel Topics Signal Process 2011, 5(1):182-188.Google Scholar
  127. Stotas S, Nallanathan A: Optimal sensing time and power allocation in multiband cognitive radio networks. IEEE Trans Commun 2011, 51: 226-235.Google Scholar
  128. Zhang R: On active learning and supervised transmission of spectrum sharing based cognitive radios by exploiting hidden primary radio feedback. IEEE Trans Commun 2010, 58: 2960-2970.Google Scholar
  129. Eswaran K, Gastpar M, Ramchandran K: Cognitive radio through primary control feedback. IEEE J Sel Areas Commun 2011, 29: 384-393.Google Scholar
  130. Zhang R, Gao F-F, Liang YC: Cognitive beamforming made practical: Effective interference channel and learning-throughput tradeoff. IEEE Trans Commun 2010, 58: 706-718.Google Scholar
  131. Unlicensed Operations in the TV Broadcast Bands, Second Memorandum Opinion and Order. 2010. FCC 10-174Google Scholar
  132. Wang J, Shosh M, Challapali K: Emerging cognitive radio applications: a survey. IEEE Commun Mag 2011, 49(3):74-81.Google Scholar
  133. Technical Specification Group Radio Access Network; Evolved Universal Terrestrial Radio Access; Medium Access Control Protocol Specification, (Release 8). 2010. 3GPP Standard TS 36.321Google Scholar
  134. System Description Document. 2009. IEEE Standard 802.16mGoogle Scholar
  135. Gorcin A, Arslan H: Public safety and emergency case communications: opportunities from the aspect of cognitive radio, in. Proc IEEE Int Symp on New Frontier in Dynamic Spectrum Access Networks (DySPAN) 2008.Google Scholar
  136. Pawelczak P, Prasad RV, Xia L, Niemegeers I: Cognitive radio emergency networks--requirements and design, in. Proc IEEE Int Symp on New Frontier in Dynamic Spectrum Access Networks (DySPAN) 2005.Google Scholar
  137. Jondral FK: Cognitive radio: A communications engineering view. IEEE Wirel Commun 2007, 14(4):28-33.Google Scholar
  138. Wang BB, Liu KJR: Advances in cognitive radio networks: a survey. IEEE J Sel Topics Signal Process 2011, 5(1):5-23.Google Scholar
  139. Sum C-S, Harada H, Kojima F, Lan Z, Funada R: Smart utility networks in TV white space. IEEE Commun Mag 2011, 49(7):132-139.Google Scholar
  140. Mitola J, Attar A, Zhang H, Holland O, Harada H, Aghvami H: Special issue on achievements and the road ahead: the first decade of cognitive radio. IEEE Trans Veh Technol 2010., 59(4):Google Scholar

Copyright

© Lu et al; licensee Springer. 2012

This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Advertisement