 Research
 Open Access
 Published:
Energy efficiency of compressed spectrum sensing in wideband cognitive radio networks
EURASIP Journal on Wireless Communications and Networking volume 2016, Article number: 83 (2016)
Abstract
In cognitive radio networks, wideband spectrum sensing (WSS) has been advocated as an effective approach to increase the spectrum access opportunity of the secondary users. On the other hand, because of the increase of sampling rate and sensing time duration cost by the analogtodigital converter (ADC), energy saving has been a significant problem for WSS. In this paper, taking advantage of the frequencydomain sparsity of the wideband spectrum, a WSS scheme combining compressed sensing and multiband joint detection technique is proposed to reduce the energy consumption. Based on extensive analysis and simulation, we identify the sparsity order of the wideband spectrum, the received signaltonoise ratio (SNR) of the primary signal, and the compression rate employed in sampling as three key factors that affect the sensing performance. In particular, we derive a closedform analytical model of the scheme. Based on these observations, the energy efficiency, defined as the ratio of the spectrum access opportunity to the energy consumption, is maximized through the optimization process of the compression rate under the sensing performance constraints. We also indicate the uniqueness of the optimal compression rate for maximizing the energy efficiency. Numerical and simulation results show that our proposed scheme is more energy efficient if the wideband spectrum is sparser in the frequency domain.
Introduction
In cognitive radio networks (CRNs), the secondary users (SUs) can opportunistically access the spectrum bands unoccupied by the primary users (PUs). As a key technology in CRNs, spectrum sensing is widely used by SUs to periodically detect the spectrum bands. It is well known that the greater the bandwidth of the spectrum being detected, the more opportunity for SUs to access. Therefore, wideband spectrum sensing (WSS) [1, 2] is attracting attention as an effective approach for detecting continuous multiple bands simultaneously. Since WSS can be easily performed in local sensing, i.e., it can be implemented by any SU independently, the communication overhead for network coordination can be greatly reduced. Hence, WSS is suitable for largescale CRNs with quite a lot of SUs.
On the other hand, the increasing energy consumption has been a significant problem for WSS [1, 3]. The energy consumption in the spectrum sensing is mainly caused by the analogtodigital converter (ADC), which is proportional to the sensing time duration and the sampling rate [1]. However, because of the wide range of the spectrum bandwidth for WSS, long sensing time duration and high sampling rate are always needed by the ADC. There are two kinds of the traditional WSS schemes, the sequential sensing scheme [1, 3] and the parallel multiband detection scheme [4]. Originally, constrained by the low sampling rate of ADCs, SU divides the wideband spectrum into multiple subbands and then detects them successively, namely the sequential sensing scheme. As the highspeed sampling technique develops, SU can directly sample the wideband spectrum using a highspeed ADC and then detect all the subbands simultaneously, namely the parallel multiband detection scheme. Compared with the sequential sensing scheme, the structure of the parallel multiband detection scheme is more convenient for WSS. Furthermore, the parallel multiband detection scheme is more energy efficient by improving the sampling rate to shorten the sensing time duration.
In practice, the wideband spectrum is divided into several nonoverlapping narrowband channels assigned to different PUs, and the emergence of different PUs’ signal is entirely independent. Therefore, only a minority of channels are occupied by PUs at the same time, namely that the wideband spectrum is sparser in the frequency range. Taking advantage of such sparsity of wideband spectrum, compressed sensing (CS) has recently been proposed to reduce the sampling rate below the Nyquist rate [5–11]. For this reason, the CSbased spectrum sensing methods have been proposed as an efficient approach for energy saving in WSS.
Tian and Giannakis introduced two kinds of compressed sensing methods (called multistep and onestep) to recover the signal by wavelet approach [5] and then developed the signal recovery idea and performed the distributed compressive spectrum sensing in the cooperative multihop CRNs [6]. However, for spectrum sensing and detection, accurately reconstructing the original signal is unnecessary. Following this idea, Polo et al. presented a compressive wideband spectrum sensing scheme by sampling the analog signal using analogtoinformation convert and then focused on the performance of edge spectrum and power spectrum density recovery [7]. The authors in [8, 9] also suggested to only reconstruct the signal’s power spectrum, in order to optimize the sensing performance at the expected probabilities of detection and false alarm. As well known, the final purpose of spectrum sensing is to find the spectrum access opportunities for SUs [1, 5]. Based on this point, all the aforementioned methods, aiming at the signal reconstruction performance in [5, 6] or the sensing performance in [7–9], give no considerations to the optimization problem of the spectrum access opportunity. In this paper, we have a further study on this problem, combining the challenge of energy consumption in WSS. We propose a reconstruction structure aiming at optimizing the energy efficiency, which is defined as the ratio of SU’s spectrum access opportunity to the energy consumption.
The proposed design includes (i) a sensing scheme combining the compressed sensing and the multiband joint detection, (ii) the establishment of an analytical model of the scheme, and (iii) the optimization of the compression rate for energy efficiency maximization under the sensing performance constraints. The contributions of this paper can be generalized as follows.
In comparison with the traditional WSS schemes, the proposed scheme reduces the sampling rate at the subNyquist rate and takes a shorter sensing time duration, both of which are greatly favorable to energy saving. Numerical and simulation results show that the performance of energy saving is better if the wideband spectrum is sparser in the frequency domain.
Although the compressed sensing has been suggested to reduce the sampling rate in WSS, the energy efficiency and the optimization of compression rate have never been considered. However, our study indicates the uniqueness of the optimal compression rate for maximizing the energy efficiency.
Furthermore, lots of relevant studies are developed under the ideal conditions. As in [10, 11], the authors deduced the minimum required number of measurements for sparsity estimation and signal reconstruction, respectively, but in the noisefree case. Based on extensive analysis and simulation, we identify the sparsity order, the received signaltonoise ratio (SNR), and the compression rate as three key factors when performing our proposed scheme and then quantify these contributions by mathematical approximation to support the theoretical derivation.
In addition, a joint SNR and sparsity order estimation, and the conditions for implementing the compressed sensing, are suggested to give consideration to the practical application of the proposed scheme.
The remainder of this paper is organized as follows. Section 2 describes the signal and network model. Section 3 presents the composition of the proposed scheme, formulates the energy efficiency maximization problem, and derives the optimal compression rate. Section 4 shows the performance analysis and simulations. Finally, Section 5 concludes the paper.
Network mode
Consider a wideband spectrum that is divided into K nonoverlapping subbands. During a constant sensing time duration, we model the detection problem on the subband k as one choosing between a hypothesis \( {H}_{0,\;k} \), which represents the absence of the primary signals, and an alternative hypothesis \( {H}_{1,\;k} \), which represents the presence of the primary signals, k ∈ {1, 2, …, K}. Moreover, we have \( \Pr \left({H}_{0,\;k}\right)+ \Pr \left({H}_{1,\;k}\right)=1 \), where Pr(⋅) is the probability of occurrence. Without loss of generality, we assume that \( \Pr \left({H}_{0,\;k}\right)= \Pr \left({H}_0\right) \), and \( \Pr \left({H}_{1,\;k}\right)= \Pr \left({H}_1\right) \), ∀ k. Let S _{ k }(t) and H _{ k }(t) be the primary signal and the coefficient of the subband k at any given time t, respectively. Then, define X(t) = {X _{1}(t), X _{2}(t), ⋯, X _{ K }(t)}, where X _{ k }(t) = H _{ k }(t)S _{ k }(t). Thus, the received signals at SUs can be represented as R(t) = X(t) ⋅ 1(k, t) + V(t), where V(t) is the additive white Gaussian noise and 1(k, t) is a K × 1 column vector in which the kth element is equal to 1 in the hypothesis \( {H}_{1,\;k} \) and is equal to 0 in the hypothesis \( {H}_{0,\;k} \). In addition, we define the received SNR on the subband k as γ _{ k } = p _{ k }/p _{0}, where p _{ k } is the received power of the primary signals and p _{0} the noise power.
Proposed wideband spectrum sensing scheme
Scheme description
Figure 1 illustrates our proposed scheme, which is tailored to the WSS. The scheme includes five modules: the compressed sensing module (A _{ 1 }), the multiband joint detection module (A _{ 2 }), the energy efficiency maximization module (A _{ 3 }), the sparsity order and SNR estimation module (B _{ 1 }), and the compressed sampling decision module (C _{ 1 }). The work flow of Fig. 1 can be described as follows.
If C _{ 1 } is satisfied, i.e., the spectrum is sparse and all the elements of γ = {γ _{ k }, ∀ k} are above the lower limit \( \overline{\gamma} \), in A _{ 1 }, R(t) is compressed sampled at the optimal subNyquist sampling rate, given by A _{ 3 }, for the energy efficiency maximization, and then reconstructed through the orthogonal matching pursuit (OMP) method [4] as \( \widehat{\boldsymbol{R}}=\left\{\widehat{R}(n)\right\} \), n = {1, 2, …, N}. Otherwise, a ⋅ exp(b ⋅ δ) + c ⋅ exp(d ⋅ δ) is sampled at the Nyquist rate as R = {R(n)}, n = {1, 2, …, N}. Next, \( \widehat{\boldsymbol{R}} \) (or R) is used by A _{ 2 } for the parallel multiband detection. Meanwhile, the summary statistic of each subband k, \( {\widehat{T}}_k \) (or T _{ k }), is used by B _{ 1 } to estimate the sparsity order and γ.
As an example of normal ADC chips, the energy consumption of AD9257 can be described as [12]
where f _{ s } is the sampling rate and τ _{ s } is the sampling time duration; the units of E, f _{ s }, and τ _{ s } are mW, Mbps, and s, respectively. It can be observed that when f _{ s } is in a relatively low regime, i.e., f _{ s } ≤ 65MHz, E is mainly dependent on τ _{ s }. This indicates that for a given N, where N = f _{ s } τ _{ s }, increasing f _{ s } (as a means of shortening τ _{ s }) is efficient to save energy. Compared with the sequential sensing scheme, the parallel detection structure of A _{ 2 } is more suitable for sampling the wideband spectrum at a high f _{ s }. However, when f _{ s } > 65 MHz, the energy consumption caused by the increase of f _{ s } is apparent. To overcome this, A _{ 1 } is applied to reduce f _{ s } to a level of less than the Nyquist rate for further energy saving.
Compressed sensing (A _{ 1 })
In most cases, since X(t) does not occupy all the K subbands, it may be sparse in the frequency domain. According to the compressed sensing theory [13], if X(t) is truly sparse, it can be sampled at the subNyquist rate and then reconstructed with slight errors. Denote the sparsity order of X(t) as \( \rho =\frac{\mathrm{the}\kern0.5em \mathrm{number}\kern0.5em \mathrm{of}\kern0.5em \mathrm{occupied}\kern0.5em \mathrm{s}\mathrm{u}\mathrm{b}\hbox{} \mathrm{bands}}{K} \) and the compression rate for sampling as δ = f _{cs}/f _{ N }, δ ∈ (0, 1), where f _{cs} is the compressed sampling rate and f _{ N } is the Nyquist rate. It is well known that δ must be larger than ρ in order to reconstruct the sparse signals. Moreover, the reconstruction performance is improved with the increase of δ.
Module A _{ 1 } consists of two sequential submodules, the compressed sampling and the signal reconstruction. It has been shown that samples acquired from Gaussian and Bernoulli random sampling matrices have a better chance to perfectly recover sparse signals than other types of sampling matrices [6]. There are several options for hardware implementations of compressed sampling. An exemplary sampler is called an analogtoinformation converter (AIC). It has a serial concatenated structure with three main components: a wideband modulator made of a pseudorandom chipping sequence, a lowpass filter, and a lowrate conventional ADC [10, 11]. In this paper, for a given 1 × N vector R, we simulate the process of compressed sampling as follows:

Choose an N × N discrete Fourier transform (DFT) matrix as the sparse representation basis Ψ, then map R into the sparse domain as Θ = Ψ ^{T} R ^{T}.

Choose a V × N uniform Gaussian random sampling matrix Φ, where V = ⌈δN⌉ (⌈x⌉ is the smallest integer not less than x), then calculate the measurement matrix as W = ΦΨ ^{T} R ^{T}.
Next, we represent ΦΨ ^{T} as Λ and feed Λ and W into the OMP method to calculate \( \widehat{\boldsymbol{R}} \), i.e., the reconstruction of R. OMP is a kind of greedy iterative algorithm for reconstruction. In each iteration, the column of Λ having the highest correlation with the error vector is selected and is used to update the approximate solution of R. The iterative process will not be stopped until the error is small enough or the number of iterations is equal to V. In detail, the process of signal reconstruction through OMP method can be described as follows:

Initialization. Denote the iteration index as i = 0, the error vector as r ^{(0)} = W, and the expected nonnegative error vector as \( \overline{\boldsymbol{r}} \). Let \( {\widehat{\boldsymbol{R}}}^{(0)}=0 \), Ω ^{(0)} = Ø, where 0 is a 1 × N vector consisting of zero elements.

Step 1: Calculate the inner products of the error vector and the columns of Λ, g ^{(i)} = Λ ^{T} r ^{(i − 1)}.

Step 2: Find the maximum element of g ^{(i)}, then get its column index as \( j=\underset{n\in \left\{1,2,\cdots, N\right\}}{ \arg \max}\left{\boldsymbol{g}}^{(i)}(n)\right \).

Step 3: Update Ω ^{(i)} as Ω ^{(i − 1)} ∪ {Λ(:, j)}, where Λ(:, j) represents all the elements of the jth column of Λ.

Step 4: Calculate the approximate solution of R through the least square method, \( {\widehat{\boldsymbol{R}}}^{(i)}={\left({\left({\boldsymbol{\varOmega}}^{(i)}\right)}^{\mathrm{T}}{\boldsymbol{\varOmega}}^{(i)}\right)}^{1}{\left({\boldsymbol{\varOmega}}^{(i)}\right)}^{\mathrm{T}}\boldsymbol{W} \).

Step 5: Update r ^{(i)} as \( \boldsymbol{W}\boldsymbol{\varLambda} {\widehat{\boldsymbol{R}}}^{(i)} \).

Step 6: If \( \left{\boldsymbol{r}}^{(i)}\right\le \overline{\boldsymbol{r}} \) or i = V, output \( \widehat{\boldsymbol{R}}={\widehat{\boldsymbol{R}}}^{(i)} \) and stop. Otherwise, go to step 1.
So far, the compressed sampling and the signal reconstruction submodules have been present, and the simulation model of the compressed sensing can be established as a result.
Multiband joint detection (A _{ 2 })
To facilitate the description, we introduce the multiband joint detection module when sampling at f _{ N }. The module implements the WSS in three steps:

Calculate the discrete frequency response of R (denoted as Y = {Y(n)}, n = {1, 2, …, N}) through an Npoint fast Fourier transform (FFT).

For each subband k, calculate summary statistic T _{ k } as the sum of the received signal energy over an interval of M samples, i.e., \( {T}_k={\displaystyle {\sum}_{m=1}^M{\left{Y}_k(m)\right}^2} \), where M = N/2K and n = (k − 1)M + m.

Compare T _{ k } with the threshold λ _{ k } to make a decision whether the primary signal is present or not.
According to [4], for a large M, the probability distribution functions (PDFs) of T _{ k } are close to normal distributions and can be represented as \( N\left({\mu}_{i,k},\;{\sigma}_{i,k}^2\right) \), i ∈ {0, 1}, where
Impact of sparsity order, compression rate, and SNR
Now, we consider the multiband joint detection when the compressed sensing module A _{ 1 } is valid. The spectrum can be reconstructed through the OMP method but at the expense of causing recovery errors. The performance of signal reconstruction depends on the sparsity order and the compression rate. Thus, it is foreseeable that the two factors should also affect the detection accuracy. On the other hand, since the energy detector used at each branch of A _{ 2 } cannot extract the primary signal from the noise, the received SNR is the most important factor for signal detection. In what follows, we thus investigate the impact of sparsity order, compression rate, and SNR on the sensing performance of the proposed scheme.
Assume N = 512, p _{0} = − 95.2 dBm, and a sparse wideband spectrum contains 10 TV bands each with 6MHz bandwidth. Within the range of δ ∈ (0, 1), Figs. 2a and 3a demonstrate that the probability of false alarm and the probability of detection rapidly drop to 0 and raise to 1, respectively, for ∀ ρ ∈ {0.1, 02, 0.3, 0.4} as the increase of δ. This proves the feasibility of the scheme, i.e., the structure of the combined A _{ 1 } and A _{ 2 } is the ability to accomplish the task of WSS if the spectrum is truly sparse. In addition, for the same sensing performance, the needed compression rate becomes lower as the sparsity order decreases. Figures 2b and 3b show the probability of false alarm and the probability of detection, respectively, for different pairs of (ρ, γ _{ k }) as δ = 0.5. We can see that for any subband in the wideband spectrum, the detection accuracy of the status (occupied or not) is proportional to the received SNR of the primary signal. This indicates when the sparsity order and compression rate have been determined that the higher the received SNR, the better the sensing performance.
Analysis model
Denote that the primary signal does not occupy channel k as hypothesis \( {H}_{0,\;k} \), otherwise as \( {H}_{1,\;k} \). Using the Central Limit Theorem (CLT) as in [4], we have that \( {\widehat{T}}_k\sim N\left({\widehat{\mu}}_{i,k},\;{\widehat{\sigma}}_{i,k}^2\right) \), where \( {\widehat{\mu}}_{i,k} \) and \( {\widehat{\sigma}}_{i,k}^2 \) i d primary signal, i ∈ {0, 1}, respectively. Thus,
can be used to unify the expressions of the probability of false alarm \( {P}_f^{(k)} \) (when i = 0) and the probability of detection \( {P}_d^{(k)} \) (when i = 1), where \( Q(x)=\left(1/\sqrt{2\pi}\right)\cdot {\displaystyle {\int}_x^{\infty } \exp \left({t}^2/2\right)dt} \). Based on the extensive analysis and simulation above, we identify ρ, γ _{ k }, and δ as three key factors that affect the sensing performance of the proposed scheme. Therefore, to establish a relationship between \( {\widehat{T}}_k \) and T _{ k }, we denote
where α _{ i,k } and \( {\beta}_{i,k}^2 \) are normalized coefficients, both of which are closely linked to ρ, γ _{ k }, and δ. Substitute Eqs. (2) and (4) into Eq. (3). For a target probability of detection \( {\overline{P}}_d \), the probability of false alarm can be calculated by
On the other hand, for a target probability of false alarm \( {\overline{P}}_f \), the probability of detection is
For simplification, we rewrite α _{ i,k } as α _{ i } and β _{ i,k } as β _{ i } in the following sections. The analytical expressions of the coefficients α _{ i } and β _{ i } can be obtained from simulation results through the curvefitting method. Since there are similar fitting results for different pairs of (ρ, γ _{ k }), we choose ρ = 0.2 and γ _{ k } = 9dB for demonstrations. Table 1 gives the experimental data of the coefficients. It can be found that α _{1} converges to 1 rapidly as δ increases. Then, α _{0} and β _{ i } can be accurately fitted into functions of δ as
Furthermore, as shown in Table 2, a is always positive while b is negative. As for c and d, at least one of them is close to zero.
Energy efficiency maximization (A _{ 3 })
SU’s final goal is to access the spectrum and transmit its own data [1, 5]. There are two different spectrum access schemes, namely the underlay and overlay approaches [1, 4, 14]. Under the underlay approach, SUs are allowed to transmit on occupied subbands but suffer to severe transmitting power limit for avoiding interference with the primary signals. On the contrary, although only the unoccupied subbands can be utilized when the overlay approach is selected, SUs can greatly increase their transmitting powers to improve the quality of service (QoS). Generally speaking, the overlay approach is more suitable for the communication of CRN; thus, it is considered in this paper and the spectrum access opportunity of SU can be represented as
where Pr(⋅) is the occurrence probability of the hypothesis, \( {H}_0 \) is that the channel is unoccupied by PUs, and \( {H}_1 \) is not. In practice, \( \tilde{\zeta} \) can be approximated by the first part of Eq. (8), since the second part is generally much smaller. Based on this, we define ζ as \( \tilde{\zeta}/ \Pr \left({H}_0\right) \) and the energy efficiency as η = ζ/(energy consumed). When the compressed sensing module A _{ 1 } is valid, to enhance the spectrum access opportunity, we formulate the problem of energy efficiency maximization as follows.
The constraint (10) ensures that the primary transmission is not interrupted by the maximization process. The constraints (11) and (12) give an exact range of the compression rate.
To solve the above problem, we firstly focus on the subproblem as
Substitute Eqs. (1) and (5) into Eq. (13). Then, the derivation of η _{ k } against δ is
where \( \upsilon =\left({\beta}_1/{\beta}_0\right)\kern0.5em \sqrt{2{\gamma}_k+1}\kern0.5em {Q}^{1}\left({\overline{P}}_d\right)+\kern0.5em \left(\left({\alpha}_1\left({\gamma}_k+1\right){\alpha}_0\right)\sqrt{M}\right)/\sqrt{2}{\beta}_0 \). After some simplifications, e.g., α _{1} → 1, α _{0}, and β _{ i } → a ⋅ exp(b ⋅ δ), υ can be approximated as
From Table 2, we see that there are small differences between any two b values. When δ ∈ (0, 1), we have
Correspondingly,
thus, υ′ > 0, then υ is monotonically increasing as δ increases. Given the fact that Q(x) is a decreasing function and upper bounded by 1, we find that both part A and B of Eq. (14) have nonnegative values. Moreover, A and B are monotonically decreasing and increasing as \( {\boldsymbol{T}}_{\mathbf{k}}=\left\{{\widehat{T}}_k^{(0)},{\widehat{T}}_k^{\left(1\right)},\dots {\widehat{T}}_k^{\left(S+1\right)}\right\} \) increases, respectively, so \( {\eta}_k^{\prime } \) is monotonically decreasing as δ increases. In the limit, when δ → ρ and ρ → 0,
then we have \( \underset{\delta \to \rho,\ \rho \to 0}{ \lim }{\eta}_k^{\prime }>0 \). On the other hand, when δ → 1, υ is close to be a constant being equal to \( \sqrt{2{\gamma}_k+1}\kern0.5em {Q}^{1}\left({\overline{P}}_d\right)+\sqrt{M/2}\left({\gamma}_k+1\right) \); thus, \( \underset{\delta \to 1}{ \lim }{\upsilon}^{\prime}\approx 0 \). Moreover, there is υ > 0 when P ^{–} _{ d } ≥ 0.5. Then, we have \( \underset{\delta \to 1}{ \lim }A\approx 0 \) and \( \underset{\delta \to 1}{ \lim }B\approx {E}^{\prime }>0 \); thus, \( \underset{\delta \to 1}{ \lim }{\eta}_k^{\prime }<0 \). As a result, there is a zero point of \( {\eta}_k^{\prime } \) within the interval of δ ∈ (0, 1), so the convexity of η _{ k } is proved. Considering all the K independent subbands, the maximum η must also be unique within the range of δ, and it can be easily found through the onedimensional exhaustive search. In practical application, we can replace the module A _{ 3 } by an optimal compression rate matrix indexed by the sparsity order ρ and the SNR vector γ, which can be stored in the computer’s memory. When the estimation of ρ and γ is finished, the compression rate δ can be chosen by searching through the matrix. This makes the energy consumed by A _{ 3 } be neglected compared with that of ADC.
SNR and sparsity order estimation (B _{ 1 })
To take into account the applicability of the scheme, we give a possible solution of joint SNR and sparsity order estimation in this section. It employs the SNR classification through the multiplehypothesistestingbased typeI testing method (see the details in Section V in [14]). In our applications, the received SNR is partitioned into a noise level plus k signal levels with the strength of each level equal to (l − 1)dB, l = {1, 2, …, L}. Denote the confidence level as ε and the probability matrix as p = [p _{ k,l }]_{ K × L }, where p _{ k,l } is the probability that the hypothesis \( {H}_{k,l} \) is accepted, i.e., γ _{ k } should be classified into signal level l. To improve the exactness of SNR classification, p _{ k,l } is calculated by using the summary statistic sequence \( {\boldsymbol{T}}_{\mathbf{k}}=\left\{{\widehat{T}}_k^{(0)},{\widehat{T}}_k^{\left(1\right)},\dots, {\widehat{T}}_k^{\left(S+1\right)}\right\} \) obtained from the past S tests before the current moment. The process of SNR classification is as follows:

Initialization: Let l = 1 and the set of accepted \( {H}_{k,l} \) for subband k as \( {\boldsymbol{H}}_k=\left\{{H}_{k,1},{H}_{k,2},\cdots, {H}_{k,L}\right\} \).

Step 1: At the signal level l, sort p(:, l) in ascending order of p values, p ^{(1)} ≤ p ^{(2)} ≤ ⋯ ≤ p ^{(K)}, where p(:, l) represents all the elements of the lth column of p.

Step 2: Find the maximum index of p ^{(j)} satisfying the condition that \( {p}^{(j)}\le \frac{j}{L}\varepsilon \), j ∈ {1, 2, ⋯, K}, and denote it as J.

Step 3: Reject all the \( {H}_{k,l} \) if k ∈ [1, J], then eliminate them from H _{ k }.

Step 4: If l = L, break the loop. Otherwise, l = l + 1, then go to step 1.

Step 5: If H _{ k } ≠ Ø, choose the maximum l from H _{ k } as the SNR level of subband k. Otherwise, classify it into the noise level.
Considering all the K subbands, the estimation of γ can be obtained. Furthermore, after the SNR classification, ρ can be estimated by \( \frac{\mathrm{the}\kern0.5em \mathrm{number}\kern0.5em \mathrm{of}\kern0.5em \mathrm{S}\mathrm{N}\mathrm{R}\kern0.5em \mathrm{classified}\kern0.5em \mathrm{into}\kern0.5em \mathrm{signal}\kern0.5em \mathrm{levels}}{K} \).
Compressed sampling decision (C _{ 1 })
Since there is no uniform criterion for judging the sparsity [10], in our application, we say the spectrum is truly sparse if ρ < 0.5. Finally, by canceling out the threshold variable λ _{ k } of Eq. (3) when i = 0 and i = 1, we evaluate the lower limit of the received SNR \( \overline{\gamma} \) with the solution of
when ρ = 0.5 and δ = 1, to ensure M is not less than the minimum number of required samples to achieve the pair of target probabilities \( \left({\overline{P}}_d,{\overline{P}}_f\right) \).
Performance analysis and simulations
In this section, the performance of energy efficiency maximization and energy saving is demonstrated by simulations. We consider a sparse wideband spectrum contains 10 TV bands each with 6MHz bandwidth. Assume the occurrence probabilities as \( \Pr \left({H}_1\right)=q \), \( \Pr \left({H}_0\right)=1q \), and q ∈ (0, 1), the number of signal levels as L = 10, and the received SNRs of the primary signal on each subband as γ = {0, 1, …, L − 1} (dB). Moreover, assume that \( {\overline{P}}_d=0.9 \), \( {\overline{P}}_f=0.1 \), N = 512, ε = 0.95, S = 20, and p _{0} = − 95.2 dBm.
From Fig. 4, we observe that there is a maximum energy efficiency in each case of (ρ, κ), where κ is the set of occupied subbands. As the number of occupied subbands decreases, the optimal compression rate can be reduced, which means a lower sampling ratio is needed. As a result, the maximum energy efficiency can also be substantially improved. For instance, when κ = {3}, the maximum energy efficiency is 728 at the optimal compression rate δ = 0.55, then drops to 607 at δ = 0.8 when κ = {3, 5, 7, 9}. In addition, all the simulated results match to the numerical results very well, which confirms that the analytical model of the proposed scheme and the process of energy efficiency maximization are valid.
For thorough analysis of energy efficiency maximization, Fig. 5a, b illustrates the maximum energy efficiency and the optimal compression rate, respectively, versus the received SNR and the sparsity order. When focusing on the sparsity orders, ∀ ρ ∈ {0.1, 02, 0.3, 0.4}, we observe that the higher the received SNR, the larger the maximum energy efficiency can be achieved, and a lower optimal compression rate is needed. Moreover, the positive effect of sparsity order on the energy efficiency can be clearly seen, i.e., the sparser the spectrum, the more energy efficient the proposed scheme.
Finally, to highlight the energy efficiency of our proposed scheme, we compare the energy consumption of the proposal with those of the two sensing schemes mentioned in the introduction, (i) the sequential sensing scheme sampling at the Nyquist rate [3] and (ii) the onestep compressed sensing scheme sampling at the subNyquist rate but aiming at signal reconstruction [5]. Sequentially, denote the energy consumption of the three schemes as E_pro, E_seq, and E_com. In order to facilitate the analysis, under the same sensing performance constraints (\( {\overline{P}}_d\ge 0.9 \), \( {\overline{P}}_f\le 0.1 \)), we normalized E_pro and E_com by E_seq, respectively, i.e., Ẽ_pro = E_pro/E_seq, Ẽ_com = E_com/E_seq. In Fig. 6, we assume that the SNR vector and sparsity order are a priori information and calculate the optimal compression rate through A _{ 3 }. Then, we can obtain the numerical result of Ẽ_pro. On the other hand, we estimate the practical SNR vector and sparsity order through B _{ 1 } (in particular, to improve the performance of parameter estimation, the signal is sampled at the Nyquist rate in the first 20 sensing time durations) and use them to choose the optimal compression rate from the stored compression rate matrix mentioned above, to obtain the simulated result of Ẽ_pro. In addition, when performing the onestep compressed sensing scheme as comparison, we use the OMP algorithm to solve the ℓ _{1}optimization problem (see the details in formula (11) in [5]). We can see from this figure, the energy consumption of our proposal, Ẽ_com, is always smaller than that of the onestep compressed sensing scheme, Ẽ_com. Furthermore, the energy saving is more obvious if q is smaller, which means the wideband spectrum is sparser. However, when q ≥ 0.7, although C _{ 1 } cannot be satisfied in most cases and the sampling rate is chosen to be the Nyquist rate, the energy consumption of the proposal is only about 24 % of that of the sequential sensing scheme, which can be attributed to the parallel multiband detection scheme used in A _{ 2 } shortening the sampling time.
Conclusions
Taking advantage of the frequencydomain sparsity of the wideband spectrum, a new wideband spectrum sensing scheme has been proposed to save energy through reducing both the sampling rate and sensing time duration. The sparsity order, the received signaltonoise ratio, and the compression rate are identified as three key factors that affect the sensing performance. Moreover, under the sensing performance constraints, the uniqueness of the maximum energy efficiency within the range of the compression rate has been proved. It is indicated that the sparser the wideband spectrum, the higher the energy efficiency and the lower the energy consumption. All these advantages have been corroborated by simulations.
References
 1.
YY Pei, YC Liang, KC Teh, KH Li, Energyefficient design of sequential channel sensing in cognitive radio networks: optimal sensing strategy, power allocation, and sensing order. IEEE J. Sel. Areas Commun. 29(8), 1648–1659 (2011)
 2.
J Meng, W Yin, HH Li, E Hossain, Z Han, Collaborative spectrum sensing from sparse observations in cognitive radio networks. IEEE J. Sel. Areas Commun. 29(2), 327–337 (2011)
 3.
M Xu, H Li, XY Gan, Energy efficient sequential sensing for wideband multichannel cognitive network, in Proc. IEEE ICC (2011)
 4.
Z Quan, SG Cui, AH Sayed, HV Poor, Optimal multiband joint detection for spectrum sensing in cognitive radio network. IEEE Trans. Signal Process. 57(3), 1128–1140 (2009)
 5.
Z Tian, GB Giannakis, Compressed wideband sensing in cooperative cognitive radio network, in Proc. IEEE GLOBECOM, 2008, pp. 1–5
 6.
FZ Zeng, C Li, Z Tian, Distributed compressive spectrum sensing in cooperative multihop cognitive networks. IEEE J. Sel. Topics Signal Process. 5(1), 37–48 (2011)
 7.
YL Polo, Y Wang, A Pandharipande, G Leus, Compressive wideband spectrum sensing, in Proc. IEEE ICASSP, 2009, pp. 2337–2340
 8.
DD Ariananda, G Leus, Compressive wideband power spectrum estimation. IEEE Trans. Signal Process. 60, 4755–4789 (2012)
 9.
D Cohen, YC Eldar, SubNyquist sampling for power spectrum sensing in cognitive radios: a unified approach. IEEE Trans. Signal Process. 62(15), 3897–3910 (2014)
 10.
Y Wang, Z Tian, CY Feng, A towstep compressed spectrum sensing scheme for wideband cognitive radios, in Proc. IEEE Globecom, 2010
 11.
Y Wang, Z Tian, CY Feng, Sparsity order estimation and its application in compressive spectrum sensing for cognitive radios. IEEE Trans. Wireless Commun. 11(6), 2116–2125 (2012)
 12.
AD9257 datasheet, [Online], Available. http://www.analog.com/media/en/technicaldocumentation/datasheets/AD9257.pdf.
 13.
EJ Candes, MB Wakin, An introduction to compressive sampling. IEEE Personal Commun. 6(4), 12–18 (2008)
 14.
SH Wu, CY Yang, DHT Huang, Cooperative sensing of wideband cognitive radio: a multiplehypothesistesting approach. IEEE Trans. Veh. Technol. 59(4), 1835–1846 (2009)
Author information
Additional information
Competing interests
The authors declare that they have no competing interests.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Zhao, Q., Wu, Z. & Li, X. Energy efficiency of compressed spectrum sensing in wideband cognitive radio networks. J Wireless Com Network 2016, 83 (2016) doi:10.1186/s1363801605819
Received:
Accepted:
Published:
Keywords
 Cognitive radio network
 Distributed cooperation
 Spectrum allocation
 Random broadcast