 Research
 Open Access
 Published:
A clusterbased selective cooperative spectrum sensing scheme in cognitive radio
EURASIP Journal on Wireless Communications and Networking volume 2013, Article number: 176 (2013)
Abstract
Developing an effective cooperative spectrum sensing (CSS) scheme in cognitive radio (CR), which is considered as promising system for enhancing spectrum utilization, is necessary. In this paper, a clusterbased optimal selective CSS scheme is proposed for reducing reporting time and bandwidth while maintaining a certain level of sensing performance. Clusters are organized based on the identification of primary signal signaltonoise ratio value, and the cluster head in each cluster is dynamically chosen according to the sensing data qualities of CR users. The cluster sensing decision is made based on an optimal threshold for selective CSS which minimizes the probability of sensing error. A parallel reporting mechanism based on frequency division is proposed to considerably reduce the time for reporting decision to fusion center of clusters. In the fusion center, the optimal ChairVashney rule is utilized to obtain a high sensing performance based on the available cluster’s information.
1 Introduction
Cognitive radio (CR) has been recently proposed as a promising technology to improve spectrum utilization by enabling secondary access to unused licensed bands. A prerequisite to this secondary access is having no interference to the primary system. This requirement makes spectrum sensing a key function in cognitive radio systems. Among common spectrum sensing techniques, energy detection is an engaging method due to its simplicity and efficiency. However, the major disadvantage of energy detection is the hidden node problem, in which the sensing node cannot distinguish between an idle and a deeply faded or shadowed band [1]. Cooperative spectrum sensing (CSS) which uses a distributed detection model has been considered to overcome that problem [2–12].
Cooperation among CR users (CUs) is usually coordinated by a fusion center (FC). For each sensing interval, CUs will send their sensing data to the FC. In the FC, all local sensing data will be combined to make a final decision on whether the primary signal is present or absent. An optimal data fusion rule was firstly considered by Chair and Varshney in [13]. Despite a good performance, the requirement for knowledge of detection and false alarm probabilities at each local node is still a barrier to the optimal fusion rule.
CSS schemes require a large communication resource including sensing time delay, control channel overhead, and consumption energy for reporting sensing data to the FC, especially when the network size is large. There are some previous works [3–9] that considered this problem. In our previous work [3], we proposed an ordered sequential reporting mechanism based on sensing data quality to reduce communication resources. A similar sequential ordered report transmission approach was considered for reducing the reporting time in [4]. However, the reporting time of these methods is still unpredictably long. In [5], the authors proposed to use a censored truncated sequential spectrum sensing technique for saving energy. On the other hand, clusterbased CSS schemes are considered for reducing the energy of CSS [6] and for minimizing the bandwidth requirements by reducing the number of terminals reporting to the fusion center [7]. In [8], Chen et al. proposed a clusterbased CSS scheme to optimize the cooperation overhead along with the sensing reliability. In fact, these proposed cluster schemes can reduce the amount of direct cooperation with the FC but cannot reduce the communication overhead between CUs and the cluster header. A similar problem can be observed in the cluster scheme in [9], though the optimal cluster size to maximize the throughput used for negotiation is identified. Another consideration of the cluster scheme is to enhance sensing performance when the reporting channel suffers from a severe fading environment [10, 11].
In this paper, we propose a clusterbased selective CSS scheme which utilizes an efficient selective method for the best quality sensing data and a parallel reporting mechanism. The selective method, which is usually adopted in cooperative communications [14, 15], is applied in each cluster to implicitly select the best sensing node during each sensing interval as the cluster header without additional collaboration among CUs. The parallel reporting mechanism based on frequency division is considered to strongly reduce the reporting time of the cluster decision. In the FC, the optimal ChairVashney rule (CV rule) is utilized to obtain a high sensing performance based on the available cluster’s signaltonoise ratio (SNR). In this way, the proposed cooperative sensing will be performed with an extremely low cooperation resource while a certain high level of sensing performance is ensured.
The remainder of this paper is organized as follows. In Section 2, some background on spectrum sensing and optimal fusion rule is described. In Section 3, we present system descriptions. The proposed system model and detailed descriptions of the proposed clusterbased selective CSS scheme are also given in Section 4. Simulation results are shown in Section 5. Finally, the conclusions are drawn in Section 6.
2 Preliminaries
2.1 Local spectrum sensing
Each CU conducts a spectrum sensing process, which is called local spectrum sensing in distributed scenario for detecting the primary user (PU) signal. Local spectrum sensing at the i th CU is essentially a binary hypotheses testing problem:
where H_{0} and H_{1} correspond, respectively, to hypotheses of absence and presence of the PU signal, x_{ i }(t) represents received data at CU _{ i }, h_{ i } denotes the gain of the channel between the PU and the CU _{ i }, s(t) is the signal transmitted from the primary user, and n(t) is additive white Gaussian noise. Additionally, channels corresponding to different CUs are assumed to be independent, and further, all CUs and PUs share a common spectrum allocation.
Among various methods for spectrum sensing, energy detection has been shown to be quite simple, quick, and able to detect the primary signal  even if the feature of the primary signal is unknown. Here, we consider the energy detection for local spectrum sensing. Figure 1 shows the block diagram of an energy detection scheme. To measure the signal power in a particular frequency region in a time domain, a bandpass filter is applied to the received signal, and power of the signal samples is then measured at CU. The estimation of received signal power is given at CU _{ i } by the following equation:
where x_{ j } is the j th sample of the received signal and N = 2T W in which T and W correspond to detection time and signal bandwidth in hertz, respectively.
If the primary signal is absent, ${x}_{{E}_{i}}$ follows a central chisquare distribution with N degrees of freedom; otherwise, ${x}_{{E}_{i}}$ follows a noncentral chisquare distribution with N degrees of freedom and a noncentrality parameter θ_{ i } = N γ_{ i }, i.e.,
When N is relatively large (e.g., N > 200) [16], x_{ E } can be well approximated as a Gaussian random variable under both hypotheses H_{1} and H_{0}, according to the central limit theorem such that
where γ_{ i } is the SNR of the primary signal at the CU.
For the case of local sensing or hard decision fusion, the CUs will make the local sensing decision based on an energy threshold λ_{ i } as follows:
where D_{ i } = 1 and D_{ i } = 1 mean that the hypotheses of H_{1} and H_{0} are declared at the i th CU, respectively. The local probability of detection and the local probability of false alarm can be determined based on (4) by:
and
respectively, where Q(.) is the MarcumQ function, i.e., $Q\left(x\right)=\frac{1}{\sqrt{2\pi}}{\int}_{x}^{\infty}{e}^{}\frac{{t}^{2}}{2}\mathit{\text{dt}}$.
2.2 The optimal fusion rule for global decision
Chair and Varshney provided the optimal data fusion rule in a distributed local hard decision detection system [13]. This optimal rule is in fact the sum of weighted local decisions where the weights are functions of probabilities of detection and false alarm.
The optimal fusion rule is based on the likelihood ratio test as follows:
where π_{0} and π_{1} are the prior probabilities of the presence and absence of the PU signal, respectively, and C_{00}, C_{01}, C_{10}, and C_{11} are the decision costs. If we choose C_{00} = C_{11} = 0 and C_{01} = C_{10} = 1, the likelihood ratio test now follows the minimum probability of error criterion [17], and (8) can be rewritten as:
Since the decision set {D_{ i }} is independent, the loglikelihood ratio test corresponding to (9) is as follows:
If S+ and S denote the set of all i such that {D_{ i } = 1} and {D_{ i } = 1}, respectively, then (10) can be computed by:
Finally, the ChairVashney fusion rule can be rewritten in the form of the weighting formula as follows:
where ${W}_{0}=log\frac{{\pi}_{1}}{{\pi}_{0}}$ and
Local false alarm probability p_{ f }_{ i } and local detection probability p_{ d }_{ i } are defined in (6) and (7), respectively.
3 System description
In this paper, the CR network, which shares the same spectrum band with a license system, utilizes a clusterbased CSS scheme as shown in Figure 2. The CR network is organized in multiple clusters in each of which the CUs have an identical average SNR of the received primary signal. This identical SNR assumption can be practical when the clusters are divided according to geographical position, i.e., adjacent CUs in a small area are gathered into a cluster. The header in each cluster is not fixed but dynamically selected for each sensing interval based on the quality of the sensing data at each CU. In detail, the node with the most reliable sensing result will take on the cluster header’s roles which include making and reporting the cluster’s decision to the FC. In order to reduce the reporting time and bandwidth, only the sensing data of the cluster header, which is the most reliable sensing data, is utilized to make the cluster decision. This method means that the decision of a cluster is made according to the selective combination method. The FC will combine all cluster decisions to make a final decision and broadcast the final sensing decision to the whole network.
The fusion rule in the FC can be any kind of hard decision fusion rules such as an OR rule, AND rule, ‘K out of N’ rule, or ChairVarshney rule. Without loss of generality, we propose the utilization of the optimal ChairVarshney rule at the FC since the SNR value of the received primary signal at the CU is available in this proposed scheme. However, there are three issues with the proposed scheme that need to be considered:

1.
How can the scheme efficiently select the cluster header, which is the node with the best quality for sensing data, for each sensing interval without any extra overhead among nodes in the cluster?

2.
How can the cluster header optimally make the cluster decision?

3.
What is the method for reporting the cluster decision to the FC?
The answers to these questions are given in the following section.
4 The proposed clusterbased selective CSS scheme
4.1 Selective CSS mechanism
In this subsection, we suggest a cluster header selection based on sensing data reliability. For each sensing interval, the CU with the most reliable sensing data in a cluster is selected to be the cluster header. Obviously, the reliability of the sensing data can be evaluated by the loglikelihood ratio (LLR) of the sensing result. The LLR value of the received signal energy ${x}_{{E}_{i}}$ is given by:
where ${f}_{X\left{H}_{j}\right.}\left({x}_{{E}_{i}}\left{H}_{j}\right.\right),j=0,1$ is the probability density function (PDF) of ${x}_{{E}_{i}}$ corresponding to each hypothesis. Since the SNRs of the received primary signals in a cluster are identical, the LLR of the i th user in the c_{ j }th cluster ${\Lambda}_{i,{c}_{j}}$ can be considered to be derived from the same distribution ${f}_{{\Lambda}_{{c}_{j}}}\left(\Lambda \right)$ of LLR Λ. For each cluster, therefore, the LLR value can be normalized such that it has a zero mean as follows:
It is obvious that the reliability of the sensing data will be higher if the absolute value of the normalized LLR is larger. We propose utilization of the absolute value of the normalized LLR $\left{Y}_{i,{c}_{j}}\right$ as the reliability coefficient for selecting the cluster header as well as the selective cluster data.
In order to implicitly select the most reliable sensing data among CUs in a cluster without additional data collaboration, one contention time should be determined for each CU as follows:
where κ is a predefined constant such that the contention time is sufficient. Obviously, from this equation, the node with the highest absolute value of the normalized LLR will have the smallest contention time. In contention, each CU must monitor the reporting channel and wait for a quiescent condition before considering itself as a cluster header, i.e., the node with the most reliable sensing data, when the contention time expires. The CU who wins the contention will make a local cluster decision and report the cluster decision to the FC based on its own sensing data as follows:
where ${Y}_{{c}_{j}}$ is equal to the normalized LLR with highest absolute value and ${\tau}_{{c}_{j}}$ is the cluster threshold. Next, we consider the problem of choosing the optimal cluster threshold.
4.2 Cluster threshold determination
In order to make a controllable cluster decision that follows a certain criterion such as the NeymanPearson criterion or minimum error probability criterion, one factor to consider is the probability density function of the cluster’s selective sensing data which is utilized to make the cluster decision. In this subsection, we will formulate this requirement.
First, from (15), the normalized LLR distributions of a CU in the c_{ j }th cluster are given by:
where ${f}_{{\Lambda}_{{c}_{j}}}\left(\Lambda \right)$ and ${f}_{{\Lambda}_{{c}_{j}}}\left(\Lambda \right)$ are the cumulative distribution function (CDF) and PDF of the LLR of the received primary signal power at the CUs in the c_{ j }th cluster, respectively. These LLR distributions are given by:
where the conditional PDF’s of the LLR under H_{0} and H_{1} are determined in [12] as follows:
If $\Lambda \ge \frac{b}{a}$
and
where a = [N^{2}/4 + N log(2γ + 1)/γ](2γ + 1) and b = 2N(2γ + 1)/γ.
Otherwise, ${f}_{\Lambda \left{H}_{0}\right.}\left(\Lambda \right)=0$, ${F}_{\Lambda \left{H}_{1}\right.}\left(\Lambda \right)=0$, ${f}_{\Lambda \left{H}_{0}\right.}\left(\Lambda \right)=0$, and ${f}_{\Lambda \left{H}_{1}\right.}\left(\Lambda \right)=0$.
Since the SNRs of the received primary signal at the CUs in a cluster are identical and the selective data for a cluster is the highest absolute value of the normalized LLR, the distribution of the selective cluster data will be equal to the distribution of the n_{0}th absolute order sample, i.e., the sample with the highest absolute value, where n_{0} is the number of CUs in the cluster. In addition, the PDF of the n_{0}th absolute order sample is given by:
The derivation of (22) can be found in the Appendix. Similarly, the conditional PDF of the n_{0}th absolute order sample under the H_{ j } hypothesis, j = 0,1, ${f}_{{Y}_{\left({n}_{0}\right),{c}_{j}}\left{H}_{j}\right.}\left(y\right)$ can be achieved.
For a specific value of threshold ${\tau}_{{c}_{j}}$, the probability of false alarm and the probability of detection of the c_{ j }th cluster are, respectively, given by:
and
Since the probabilities of false alarm and the probability of detection of the c_{ j }th cluster in (23) and (24) mainly depend on the received primary signal SNR and the number of nodes in the cluster, the cluster threshold can be determined offline in the initial phase of the cluster establishment based on the NeymanPearson criterion or the minimum error probability criterion. For the NeymanPearson criterion, the probability of false alarm ${P}_{{F}_{{c}_{j}}}$ is predefined. Also, the cluster threshold ${\tau}_{{c}_{j}}$ is computed based on (23). In this paper, we utilize the minimum error probability criterion to numerically determine the optimal cluster threshold through the following equation:
4.3 Parallel report mechanism
For implementing the proposed selective mechanism in a cluster, all CUs in a cluster have to monitor the control channel to determine the cluster header during the contention time. One question raised here is how to arrange the contention time for multiple clusters in the network. Generally, there are two common solutions for this problem. The first approach is to assume that the contention times of the clusters are carried out sequentially over time. This method requires a strict synchronization among CUs in the network and a long contention time to minimize the collision in contention due to differences in transmission range. Obviously, this method can cause a long reporting time with a high rate of contention collision. The second approach is to assume that the contention times of different clusters are conducted in parallel with different subcontrol channels. Since each cluster only reports a 1bit hard decision to the FC, the subcontrol channel can be reduced to a pair of frequencies corresponding to two possible values of a cluster decision. This means that a node in a certain cluster only monitors two predetermined frequencies during the contention time, and the node who wins the contention will transmit only one predefined frequency to the FC according to its cluster decision. Normally, a control channel bandwidth is sufficient for allocating a reasonable number of frequency pairs to clusters. For example, it is acceptable to divide 50 pairs of frequencies for 50 clusters in a 200kHz control channel. Figure 3 shows an example of a sensing frame structure for the proposed parallel report mechanism compared with the conventional fixed allocation direct reporting method.
In this method, the problems of strict synchronization and contention collision, which can occur with the previous method, are completely resolved. Indeed, with this parallel contention and reporting mechanism, the synchronization among CUs can be looser since there is only one contention time that is identical to the reporting time. No collision between two cluster reports will occur since these cluster decisions are transmitted at different frequencies. Even in the case that two CUs in a cluster have the same value of the most reliable sensing data, a collision still will not occur since the two nodes will transmit the same frequency, and at the receiver side, two transmitted frequencies can be considered as two versions of a multipath signal. The remainder problem with this parallel reporting method is that the FC needs to be equipped with parallel communication devices such as an FFT block, which is usually used in an OFDM receiver, or a filter bank block to detect multiple reporting frequencies. However, this requirement is not a big issue.
5 Simulation results
The simulation of the proposed clusterbased selective CSS scheme is conducted under the following assumptions:

The LU signal is a DTV signal as in [18].

The bandwidth of the PU signal is 6 MHz, and the AWGN channel is considered.

The local sensing time is 50 μ s.

The probability of the presence and absence of PU signal is 0.5 for both.

The network has n_{0} nodes and can be divided into n_{ c } clusters. Each cluster includes n_{0} nodes.
First, we evaluate the sensing performance of the selective method in the cluster with three different received primary signal SNRs of 14, 12, and 10 dB when the number of nodes in the cluster changes from 1 to 100. As shown in Figure 4, the probability of error will decrease along with the increase in the number of nodes in the cluster. However, the decreasing rate of probability of error is low when the number of nodes in the cluster is large, specially when n_{0}>10. Therefore, the selective method only provides high sensing efficiency when the number of nodes is in the range of 20.
Second, we assume that the network includes five clusters with different SNR values corresponding to 20, 18, 16, 14, and 12 dB. The error probabilities of the global CV rulebased conventional direct reporting scheme, the cluster and global CV rulebased conventional cluster reporting scheme, and the proposed CSS scheme are then observed according to different values of cluster size. As illustrated in Figure 5, the error probabilities of all CSS schemes decrease along with the increase of the cluster size. The direct conventional CV rulebased CSS scheme provides the best sensing performance. The proposed CSS scheme outperforms the cluster and global CV rulebased conventional cluster CSS scheme when the cluster size is small, i.e., n_{0} < 8. When the cluster size is large, i.e., n_{0} > 8, the sensing error probability of the proposed method is slightly higher than that of the conventional cluster scheme, which utilizes a CV rule at both cluster headers and FC. However, it is noteworthy that the cost of this better performance with the conventional cluster and direct schemes compared with the proposed scheme are the extremely large amount of overhead, energy consumption, and reporting time for collecting all decisions from all nodes in the network.
Finally, to clarify the energy efficiency and collection time savings, we first assume that E_{0} = k E_{1} where E_{0} is the energy for transmitting the report from a cluster header to the FC and E_{1} is the energy for transmitting the report from a local node to the cluster header. Similarly, we assume that T_{ p } = l T_{ r } where T_{ p } is the parallel reporting time slot, and T_{ r } is the fixed allocation reporting time slot (see Figure 3). We also assume that each cluster utilizes a separate reporting channel to transmit the sensing result from local nodes to the cluster header in the case of a conventional clusterbased CSS scheme, and the guard interval between time slots is ignored. As a result, the reporting energy consumption and the total reporting time of the direct reporting (DIR), the conventional cluster (CON), and the proposed (PROP) CSS schemes can be calculated by:
and
respectively. The energy consumption efficiency (EE) and the reporting timesaving efficiency (TE) of the conventional cluster and the proposed CSS schemes compared with the direct CSS scheme can be easily obtained by EE _{∗} = 1  E_{∗}/E_{DIR} and TE _{∗} = 1  T_{∗}/T_{DIR}, respectively, where the asterisk (*) can be replaced by CON or PROP.
When the number of cluster is constant at n_{ c } = 5 as assumed in Figure 5, we can obtain the energy consumption efficiency and the reporting time saving as shown in Figure 6. Obviously, both cluster schemes enable an increase in the energy efficiency and time savings along with the increase in cluster size. As illustrated in Equation 26 and in the simulation result of Figure 6, it can be concluded that the energy efficiency of the proposed scheme is the upper bound of the conventional cluster scheme for all cases of k. Therefore, the proposed scheme achieves the highest energy efficiency among cluster schemes.
Similarly, from Figure 7, we can see that the proposed CSS scheme provides higher reporting time savings than the conventional cluster scheme. In fact, for an acceptable value of l, i.e., l = 4, the proposed scheme produces time savings greater than 80% compared with the conventional direct reporting CSS scheme, while the conventional cluster scheme only remains at 75% of the highest saving percentage.
6 Conclusions
In this paper, we have proposed a clusterbased CSS scheme which includes the selective method in the cluster and the optimal fusion rule in the FC. The proposed selective combination method can dramatically reduce the reporting time and energy consumption while achieving a certain high level of sensing performance especially when it is combined with the proposed frequency divisionbased parallel reporting mechanism.
Appendix
Derivation of Equation 22
Let Y denote a continuous random variable with PDF f_{ Y }(y) and CDF f_{ Y }(y) and let $({Y}_{1},{Y}_{2},\dots ,{Y}_{{n}_{0}})$ be a random sample of size n_{0} drawn from Y. The corresponding ordered sample derived from the parent Y is $({Y}_{\left(1\right)},{Y}_{\left(2\right)},\dots ,{Y}_{\left({n}_{0}\right)})$, which is arranged in increasing order of absolute value such that $\left{Y}_{\left(1\right)}\right<\left{Y}_{\left(2\right)}\right<\dots <\left{Y}_{\left(k\right)}\right<\dots <\left{Y}_{\left({n}_{0}\right)}\right$. In order to determine the PDF of Y_{(k)}, we define the event D_{k,y} = {y≤Y_{(k)}≤y + Δ y} = {y≤±Y_{(k)}≤y + Δ y}. Thus, the probability of event D_{k,y} can be calculated by
if y ≥ 0 or
if y < 0, where ${C}_{k}=\left(\begin{array}{c}{n}_{0}\\ k1& 1& {n}_{0}k\end{array}\right).$Consequently, the PDF of Y_{(k)} is calculated using
By replacing Y with ${Y}^{{c}_{j}}$ and substituting k = n_{0} into (30), Equation 22 can be obtained.
References
 1.
Cabric D, Mishra SM, Brodersen RW: Implementation issues in spectrum sensing for cognitive radios. Conf. Record of the 38th Asilomar Conf. on Signals, Systems and Computers 2004, 1: 772776.
 2.
Chen L, Wang J, Li S: An adaptive cooperative spectrum sensing scheme based on the optimal data fusion rule. In 4th International Symposium on Wireless Communication Systems. IEEE Piscataway; 2007:582586.
 3.
NguyenThanh N, Koo I: An efficient ordered sequential cooperative spectrum sensing scheme based on evidence theory in cognitive radio. IEICE Trans. Commun 2010, E93.B(12):32483257. 10.1587/transcom.E93.B.3248
 4.
Hesham L, Sultan A, Nafie M, Digham F: Distributed spectrum sensing with sequential ordered transmissions to a cognitive fusion center. IEEE Trans. Signal Process 2012, 60: 25242538.
 5.
Maleki S, Leus G: Censored truncated sequential spectrum sensing for cognitive radio networks. IEEE J Selected Areas Commun 2013, 31: 364378.
 6.
De Nardis L, Domenicali D, Di Benedetto MG: Clustered hybrid energyaware cooperative spectrum sensing (CHESS). In 4th International Conference on Cognitive Radio Oriented Wireless Networks and Communications 2009 (CROWNCOM ’09). IEEE Piscataway; 2009:16.
 7.
Hussain S, Fernando X: Approach for clusterbased spectrum sensing over bandlimited reporting channels. IET Commun 2012, 6: 14661474. 10.1049/ietcom.2010.0510
 8.
Guo C, Peng T, Xu S, Wang H, Wang W: Cooperative spectrum sensing with clusterbased architecture in cognitive radio networks. In IEEE 69th Vehicular Technology Conference 2009 (VTC Spring 2009). IEEE Piscataway; 2009:15.
 9.
Karami E, Banihashemi AH: Cluster size optimization in cooperative spectrum sensing. In 2011 Ninth Annual Communication Networks and Services Research Conference (CNSR). IEEE Piscataway; 2011:1317.
 10.
Reisi N, Ahmadian M, Jamali V, Salari S: Clusterbased cooperative spectrum sensing over correlated lognormal channels with noise uncertainty in cognitive radio networks. IET Commun 2012, 6: 27252733. 10.1049/ietcom.2011.0401
 11.
Sun C, Zhang W, Letaief KB: Clusterbased cooperative spectrum sensing for cognitive radio systems. In Proceedings of IEEE International Conference on Communications, Glasgow. IEEE Piscataway; 2007:25112515.
 12.
NguyenThanh N, Koo I: Loglikelihood ratio optimal quantizer for cooperative spectrum sensing in cognitive radio. IEEE Commun. Lett 2011, 15(3):317319.
 13.
Chair Z, Varshney PK: Optimal data fusion in multiple sensor detection systems. IEEE Trans. Aerospace and Electronic Syst 1986, AES22(1):98101.
 14.
Vo Nguyen Quoc B, Duong TQ, Benevides da Costa D, Alexandropoulos GC, Nallanathan A: Cognitive amplifyandforward relaying with best relay selection in nonidentical Rayleigh fading. IEEE COML 2013, 17(3):475478.
 15.
Duong TQ, Bao VNQ, Tran H, Alexandropoulos GC, Zepernick HJ: Effect of primary networks on the performance of spectrum sharing AF relaying. IET Lett 2012, 48(1):2527. 10.1049/el.2011.3151
 16.
Urkowitz H: Energy detection of unknown deterministic signals. Proceedings of the IEEE 1967, 55(4):523531.
 17.
Barkat M: Signal Detection and Estimation. Artech House, London; 2005.
 18.
Shellhammer SJ, Shankar SN, Tandra R, Tomcik J: Performance of power detector sensors of DTV signals in IEEE 802.22 WRANs. In Proceedings of the 1st International Workshop on Technology and Policy For Accessing Spectrum. ACM Press New York; 2006.
Acknowledgements
This work was supported by the National Research Foundation of Korea (NRF) grant funded by the Korea government (MEST) (NRF2012R1A1A2038831 and NRF2013R1A2A2A05004535).
Author information
Affiliations
Corresponding author
Additional information
Competing interests
Both authors declare that they have no competing interests.
Authors’ original submitted files for images
Below are the links to the authors’ original submitted files for images.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
About this article
Cite this article
NguyenThanh, N., Koo, I. A clusterbased selective cooperative spectrum sensing scheme in cognitive radio. J Wireless Com Network 2013, 176 (2013). https://doi.org/10.1186/168714992013176
Received:
Accepted:
Published:
Keywords
 Cognitive radio
 Cooperative spectrum sensing
 Cluster
 Selective combination
 Parallel reporting mechanism