1. Introduction
Cognitive Radio (CR) enables the efficient use of limited spectrum by allowing secondary users (SUs) to access the licensed frequency bands of primary users (PUs). Spectrum sensing is a key element required to allow SUs to use vacant frequency bands in a CR network. Many signal detection techniques such as energy detection, matched filtering, and cyclostationary feature detection can be used to enhance detection performance in spectrum sensing [1]. However, in practice, many factors, such as multipath fading, shadowing, and the hidden PU problem, may significantly affect detection performance. To solve this challenging problem, cooperative spectrum sensing has been proposed [2]. In cooperative spectrum sensing, each sensing node reports its sensing result to a fusion center (FC). The FC determines the presence of the PU by combining multiple independent sensing results from sensing nodes. A soft combination (SC) based on the Neyman-Pearson criterion can maximize the detection probability for a given false alarm probability [3]. Some researchers have increased the spectrum sensing performance of the energy detector by adjusting parameters such as decision thresholds, sensing frequency, and the number of sensing operations [4]-[6]. However, because the detection performance of the cooperative spectrum sensing increases according to the number of sensing results reported from sensing nodes, it is important to reduce the reporting overhead. The authors of [7], [8] elaborated on the performance of cooperative spectrum sensing while taking the reporting overhead into consideration. To reduce the reporting overhead, cooperative spectrum sensing with quantized sensing observation has been considered in some earlier works [9]-[11]. In [9], [10], the authors formulated a limited reporting scheme that uses one-bit or two-bit quantized information for cooperative spectrum sensing. In [11], SU assignment and sensing observation quantization schemes were proposed in a CR network operating in multiple primary bands. However, the previous studies of [7]-[11] didn’t take the reduction of the reporting overheads into consideration. An alternative approach to reduce the reporting overhead is to use difference levels of thresholds in each sensing node. Each sensing node performs local spectrum sensing and decides the presence of a PU by using a different detection threshold. Each sensing node reports its local decision to the FC and then the FC finally decides the presence of a PU by using hard combination (HC) methods (e.g., OR-rule or AND-rule) [12]-[14]. However, the SC method shows better sensing performance than HC methods at the cost of increased bandwidth of reporting channels [9], [15], [16]. In cellular networks with multiuser diversity, various approaches have been studied to reduce the amount of the channel state information fed back by users [17]-[20]. One approach is to quantize the observed channel state [17], [18]. An alternative approach is to allow users to report only if their channel state exceeds a threshold [19], [20]. In cellular networks with multiuser diversity, a base station finds one user who has the best channel condition among multiple users, for every frame. Contrastively, in the CR networks with cooperative spectrum sensing, an FC combines multiple sensing information reported from sensing nodes. Hence, previous multiuser diversity schemes with limited feedback in cellular networks cannot be directly applied to the CR networks.
The paper proposes two cooperative spectrum sensing schemes with dedicated or shared reporting channels. The proposed schemes allow sensing nodes to report their sensing results only if their observed energy is greater than a decision threshold and therefore the proposed schemes result in the reduction of the number of reporting transmissions by sensing nodes. The contribution of this paper is twofold. First, this paper proposes two SC based cooperative spectrum sensing schemes, an SC with threshold-based reporting (SC-TR) scheme and an SC with contention-based reporting (SC-CR) scheme. To the best of our knowledge, few studies have reduced the reporting overhead in SC based cooperative CR networks while most previous work has focused on HC based cooperative CR networks. To reduce the reporting overhead, a threshold-based reporting technique proposed for use in cellular networks with multiuser diversity is applied to the proposed schemes and the conventional HC scheme. However, the proposed SC-TR scheme and the HC scheme with threshold-based reporting differ in terms of the combining rule at the FC. The SC based fusion rule can increase the diversity gain by using weighted combining factors. Moreover, the proposed SC-CR scheme can increase the throughput of SUs by using the fixed number of shared reporting channels when there are many SUs. Second, this paper develops an analytical model to evaluate the performance of cooperative spectrum sensing schemes from two perspectives, that of the PU and that of the SU. From the PU’s perspective, this paper analyzes the detection probability, the false alarm probability, and the reporting overhead of the cooperative spectrum sensing schemes. From the SU’s perspective, this paper analyzes the throughput and the power consumption of SUs. The findings reported in this paper will help operators to find the best cooperative spectrum sensing scheme by comparing the performance of four cooperative spectrum sensing schemes.
The remainder of this paper is organized as follows: Section 2 describes the system model. Section 3 introduces two traditional cooperative spectrum sensing schemes based on the HC and SC method, and also proposes two SC based cooperative spectrum sensing schemes with limited reporting. Section 4 analyzes the sensing performance of four cooperative spectrum sensing schemes in terms of the detection probability, the false alarm probability, and the reporting overhead. Section 5 analyzes the throughput and the power consumption from the SU’s perspective. Section 6 presents numerical and simulation results and finally Section 7 concludes the paper.
2. System Model
We consider a centralized CR network with K SUs which cooperatively detect the presence of the PU by sending their sensing results to the CR base station, which acts as an FC, as shown Fig. 1.
Fig. 1.Cooperative spectrum sensing in a CR network
As shown Fig. 2, each frame of a CR network is divided into sensing duration, reporting duration, and data transmission duration. Let the frame time, sensing time, reporting time, and data transmission time be respectively denoted by Tf, Ts, Tr, and Td, where Tf = Ts + Tr + Td. In the sensing duration, each SU k performs spectrum sensing during the sensing time. In the reporting duration, SUs report their sensing results or their observed energy values to the FC via the reporting channels, where the reporting channel between the SU and the FC is assumed to be free of error. The reporting time can be represented by Tr = L∙τr, where L is the number of reporting channels and τris the duration of a time slot. The FC determines the presence of a PU by combining multiple independent sensing results from SUs, where we consider two kinds of combination methods at the FC, an HC method and an SC method. For the HC method, an OR-rule scheme is adopted [22]. For the SC method, a maximum ratio combination (MRC) is adopted [9]. In the data transmission duration, if the FC decides the absence of a PU, one SU selected by the FC transmits data, where the FC is assumed to use a round-robin (RR) scheduling algorithm.
Fig. 2Frame structure of a CR network
Let the hypotheses corresponding to the absence and presence of the PU signal be denoted by H0 and H1, respectively. When each SU senses a PU signal during M samples through energy detection, the observed energy value of the kth SU can then be expressed as [21], [22]
where skj is the received PU signal and nkj is the white noise at the jth sample of the kth SU, respectively. The noise at each sample is assumed to be Gaussian distributed with zero mean and unit variance, i.e., nkj ~ N(0, σ2), where σ2 = 1. Since different SUs are at different locations, Yk values are assumed to be independent [22]. Let γk represent the received instantaneous SNR of the kth SU within the observation period, defined as [9], [22]. We assume γk varies from (observation) period to period. The probability density function and cumulative distribution function of the received SNR of the kth SU are respectively denoted by fγk(γk) and Fγk(γk).
In the CR network, as the detection probability becomes higher, the PUs are better protected. However, from the perspective of the SU’s throughput, as false alarm probability falls, there are more chances the channel can be reused by an SU when it is available, and thus the achievable throughput of SUs becomes accordingly higher. In this light, the CR network has a fundamental tradeoff between the protection of PUs and the achievable throughput of SUs [23]. Consequently, according to the perspective, the objectives of the CR network are as follows:
3. Cooperative Spectrum Sensing Schemes
3.1 OR-rule based Hard Combination
In the traditional HC-based CR networks, each SU reports its decision result, 0 or 1, to the FC [12], [14]. However, in this paper, each SU is assumed to report only if the decision result is ‘1’ to reduce the reporting overhead. In particular, in the HC with different thresholds, each SU k performs local spectrum sensing and decides the presence of the PU on the basis of each threshold, μk [12], [14]. Each SU reports one-bit information to the FC via the dedicated reporting channel if the received SNR is greater than each threshold, μk. Hence, although the number of actually used reporting channels is less than K, the number of required reporting channels is given by L = K, where K is the number of SUs.
3.2 Soft Combination with Full Reporting
In the conventional SC based cooperative spectrum sensing, all SUs report their observed energy values, Yk, to the FC via dedicated reporting channels. Hence, the number of reporting channels is given by L = K, where K is the number of SUs. The weighted summation at the FC is [15]
where wk, which is the normalized weight coefficient corresponding to the kth SU, is approximated as [9], [22]. The FC determines the presence of a PU on the basis of the weighted summation of (2). This operation is called an SC with full reporting (SC-FR).
3.3 Proposed Soft Combination with Threshold-based Reporting
In order to reduce the actual reporting overhead, we propose a cooperative spectrum sensing that limits the number of SUs who report their observed energy values; which is called an SC-TR. In the SC-TR scheme, each SU is allowed to report its sensing result to the FC through its own reporting channel only if the observed energy value is higher than a decision threshold of λ under the hypothesis, H1. However, because each SU uses its dedicated reporting channel, the number of required reporting channels is given by L = K, where K is the number of SUs.
3.4 Proposed Soft Combination with Contention-based Reporting
Although the SC-TR scheme reduces the actual reporting overhead, each SU requires its own dedicated control channel to report the sensing result to the FC. To prevent a shortage of reporting channels due to the increase in the number of SUs, we propose another cooperative spectrum sensing, which is called an SC-CR, where the reporting channels are shared by all the SUs.
Fig. 3 shows an example of a frame structure of the proposed SC-CR scheme, where the number of reporting channels is fixed to L = β regardless of the number of SUs. SUs share β reporting channels and compete to send their sensing results through random access from the first reporting channel to the β th reporting channel if their observed energy values are greater than a threshold, λ. SUs randomly access each reporting channel with an access probability, p. We assume that the FC can capture the strongest signal from the multiple received signals at each reporting channel. Under a Rayleigh channel, the probability of a signal being captured is given by i/2i-1, where i is the number of received signals [24].
Fig. 3.A frame structure of the SC-CR scheme
Because the SC-CR scheme requires SUs to report their sensing information via contentions, there are pros and cons. The main advantage of the SC-CR scheme lies in the use of a fixed number of reporting channels regardless of the number of SUs. The SC-CR scheme hence can increase the throughput of SUs owing to the fixed number of reporting channels when there are many SUs. Generally, the number of reporting channels linearly increases with the number of SUs and excessive reporting overhead deteriorates the throughput of SUs due to a shortage of available data transmission time [8]. If an FC limits the number of SUs that report their sensing results, the FC will randomly select SUs because it does not know which user has the high observed energy value due to the fluctuation of the channel. Hence, the limitation of the number of SUs may decrease the multiuser diversity gain at the FC. The proposed SC-CR scheme enables the FC to receive sensing results with higher observed energy values via contention based reporting channels by controlling the threshold according to the number of SUs. Hence, the SC-CR scheme increases the multiuser diversity gain at the FC as the number of SUs increases. However, the SC-CR scheme has the following weaknesses: First, the SC-CR scheme deteriorates the performance of the CR networks when the number of SUs is low because of collisions due to the contention based reporting channels. Second, the SC-CR scheme increases the power consumption of SUs because SUs may report their sensing results several times during the reporting time. However, the average power consumption of an SU decreases as the number of SUs increases because the FC controls the reporting load according to the number of SUs. Third, the FC should find the optimal parameters, λ and p, and inform them to SUs whenever the number of SUs changes. Hence, the SC-CR scheme should be applied to a CR network with many SUs.
4. Sensing Performance of the Cooperative Spectrum Sensing Schemes
4.1 OR-rule based Hard Combination
In the HC scheme, because Yk approximates the Gaussian distribution for a large M, the probabilities of false alarm and detection of the kth SU are [12], [22]
where is the average received SNR of the kth SU. When the OR-rule at the FC is applied, the average probabilities of false alarm and detection in the cooperative spectrum sensing network with K SUs are given by
Under the constraint that a false alarm probability is less than a target value, PF, the threshold vector, μ = (μ1, μ2, ⋯, μK), is optimally selected to maximize the average detection probability, . The heuristic algorithm to find optimal thresholds was introduced in [14].
Because an SU reports one-bit information only if the observed energy value is greater than its threshold, the number of reporting channels that are actually used by SUs is given by
4.2 Soft Combination with Full Reporting
In the SC based fusion rule, given a false alarm probability, PF, the detection probability, PD, can be expressed as [15], [22]
where and γK is the vector of the received SNRs at SUs, γK = (γ1, γ2, ⋯, γK). Similarly, given a detection probability, PD, the false alarm probability, PF, can be expressed as [22]
Hence, given a false alarm probability, the average detection probability of the SC-FR scheme can then be expressed as
Similarly, given a detection probability, the average false alarm probability is given by . Because all the SUs report their sensing results via dedicated reporting channels, the number of reporting channels that are actually used by SUs is equal to the number of SUs, as follows: , where K is the number of SUs.
4.3 Proposed Soft Combination with Threshold-based Reporting
Let αk(∙) denote the probability that the observed energy value, Yk, of the kth SU is above the threshold λ under H1. From (1), we obtain Yk = M(γk + 1) and therefore the decision threshold can be represented by λ = M(λth + 1). The αk(λth) can then be expressed as
The probability that there are n SUs who have an observed energy value higher than a threshold is
When n SUs out of K SUs report their observed energy values to the FC, the weighted summation at the FC is given by
where Yi is the observed energy value of the ith reported message. Let Γ(n) denote the set of the SNRs listed in descending order as follows:
Given a false alarm probability, the average detection probability of the SC-TR scheme can then be expressed as
where γn, which is the ordered list of the received SNRs of SUs with γk > λth, is given by γn = (γ1, γ2, ⋯, γn). The PD(γn) is obtained from (6). The case in which there is no reporting transmissions from SUs can be neglected if the number of SUs is large enough. Similarly, given the detection probability, the average false alarm probability is obtained from (13) by replacing PD(γn) with PF(γn).
Because the number of SUs who can report their sensing results is limited to the SUs who have the observed energy value higher than a threshold, the average number of reporting channels that are actually used by SUs is given by
If the received SNRs of SUs are identically distributed, we have .
4.4 Proposed Soft Combination with Contention-based Reporting
Assuming that there are n SUs whose observed energy values are greater than λ, let ps(n) be the probability that one SU out of n candidate SUs successfully reports its sensing result at a contention based reporting channel, as follows: , where p is the access probability. Because an SU do not know if the reported signal is succssfully received at the FC, the SU may report its sensing result several times during the β reporting channels and the FC may receive multiple sensing results from the same SU. The probability that there are m different sensing results out of k successfully received sensing results is given by
where is the number of cases that k sensing results are reported by m SUs when there are n candidate SUs, and suj(k, m), which is the number of surjections from an k-set to an m-set, is given by . Consequently, when there are n candidate SUs, the probability that m SUs out of n candidate SUs successfully report their observed energy values without collision is given by
The average detection probability of the SC-CR scheme can then be expressed as
where γm is the vector of the received SNRs of SUs that successfully report their sensing results without collision. PD(γm) is obtained from (6). For simplicity, we neglect the case in which there is no successful reporting from SUs, i.e, for n = 0 or m = 0, the detection probability is assumed to be zero. Similarly, given the detection probability, the average false alarm probability is obtained from (17) by replacing PD(γm) with PF(γm).
The probability that at least one SU out of n candidates SUs transmits its sensing result at a reporting channel is ptx(n) = 1 - (1 - p)n. The average number of reporting channels that are actually used by SUs can then be expressed
With a fixed number of reporting channels, β, the parameters of λ and p are selected to maximize the average detection probability as follows:
In (19), since the decision threshold λ and the access probability p are independent and the detection probability of cooperative spectrum sensing increases with the number of sensing results reported from SUs, we can select the value of p* that maximizes V(n, m). Hence, when there are n SUs whose observed energy values are greater than λ, the optimization problem to find the optimal access probability is given by
Because the solution of ∂V(n,m)/∂p = 0 is identical to ∂ps(n)/∂p = 0 the optimal value is given by p* = 2/n. However, because the FC cannot precisely estimate the number of candidate SUs for every sensing period, the FC estimates the number of candidate SUs on the basis of the distribution of the received SNR as follows:
Consequently, the optimal value of p is estimated by . With a given value of p*, the optimal value of the threshold is selected to maximize (19) by using the Golden section method or an exhaust search method [25].
5. Throughput and Power Consumption of Cooperative Spectrum Sensing Schemes
5.1 Throughput of Secondary Users
In the cooperative CR network, there is a tradeoff between the sensing-reporting time and the data transmission time. A longer sensing and reporting time will improve the sensing performance; however, this shortens the allowable data transmission time, which degrades the throughput of SUs. A cooperative fusion method also affects the throughput of SUs because the throughput of SUs depends on the sensing performance. Generally, the SC method shows better sensing performance than the HC methods [15], [16]. Given the sensing time and the average detection probability, the average spectral efficiency of an SU can then be expressed as [23]
where Δs = Ts/Tf, Δr = τr/Tf, and L is the number of reporting channels. Additionally, r0 is the average spectral efficiency of an SU when the primary channel is idle and r1 is the average spectral efficiency of an SU when the primary channel is busy. From (22), the average throughput of an SU depends on the sensing time, the number of reporting channels, the average false alarm probability, and the average detection probability because the other parameters, r0, r1, P(H0), and P(H1), are uncontrollable. To provide sufficient protection to the PUs, the throughput of SUs should be derived under the constraint that the detection probability is greater than a prescribed value.
In the SC-CR scheme, the parameters, λ and p, are selected to maximize the average spectral efficiency of an SU as follows:
where ξ is the prescribed value to provide protection to the PUs. Since r0, r1, P(H0), and P(H1) are uncontrollable, the above optimization problem of (23) can be simplified as . The optimal value of p is obtained from (20) and the optimal value of λ is selected to minimize the average false alarm probability by using the Golden section method.
5.2 Power Consumption of Secondary Users
The power consumption of an SU during the reporting time can be expressed as
where Pproc is the processing power, Pt is the power consumed to transmit a reporting message, and Nt is the number of reporting transmissions during the reporting time. Because an SU mainly consumes power to transmit a message, the power consumption of an SU can be approximately represented by Pc ≈ Nt ⋅ Pt, where Pt is assumed to be a constant value in this paper. According to the cooperative spectrum schemes, the average number of reporting transmissions of an SU, , is as follows:
6. Numerical and Simulation Results
6.1 Simulation Environments
The performance of the cooperative spectrum sensing is evaluated under a Rayleigh channel environment with where γ is the received PU’s SNR at the kth SU and is the average SNR of the kth SU. For simplicity, the average SNRs of SUs are assumed to be uniformly distributed among three values of -12 dB, -9 dB, and -6 dB, respectively. However, the results can be generalized without modification by modeling the distribution of the average SNR. Each SU is assumed to sense a PU signal during M = 25 samples.
Because of the tradeoff between the PU’s protection and the SU’s throughput, we respectively evaluate the performance of four cooperative spectrum sensing schemes from the PU’s perspective and from the SU’s perspective. First, from the perspective of the PU’s protection, we compare the sensing performance of the four cooperative spectrum sensing schemes in Fig. 4 to Fig. 7, with a given value of a false alarm probability, ε = 0.05. Here, to calculate the multi-fold integration in (8), (13), and (17), we reduce the multiple integral to an iterated integral (i.e., a series of integrals of one variable) and use a trapezoidal rule for approximating each definite integral. Second, from the SU’s perspective, we compare the spectral efficiency and the power consumption of an SU in Fig. 8 and Fig. 9 with the given value of a detection probability, ξ = 0.9. The parameters used in the simulation are as follows: P(H0) = 0.8, P(H1) = 0.2, r0 = 2.6 bps/Hz, r1 = 1.9 bps/Hz, Δs = 0.1, Δr = 0.01 in the SC method and Δr = 0.005 in the HC method. In the simulation results of Fig. 4 to Fig. 9, the symbols represent the computer simulation results and the lines represent the analytical results. For the OR-rule based HC scheme, only analytical results are plotted.
Fig. 4.The average detection probability vs. the number of SUs
Fig. 5.The average number of used reporting channels vs. the number of SUs
Fig. 6.The average detection probability of the SC-CR scheme
Fig. 7.The average detection probability vs. the average SNR
Fig. 8.The average spectral efficiency of an SU vs. the number of SUs
Fig. 9.The average number of reporting transmissions of an SU vs. the number of SUs
6.2 Sensing Performance from the PU’s Perspective
Fig. 4 shows the average detection probabilities of the four cooperative spectrum sensing schemes. The SC-FR scheme shows the best detection performance at the cost of increased reporting overhead and the OR-rule based HC scheme shows the worst detection performance. For the three SC schemes, the detection probability approaches one as the number of SUs increases. However, for the OR-rule based HC scheme, the detection probability slowly increases as the number of SUs increases because the HC scheme has low sensing performance at the low SNR region. In the SC-TR scheme, as the decision threshold decreases, the detection performance increases with an increase of the reporting overhead. The SC-CR scheme shows the worse detection performance because of collisions due to the shared reporting channels. When the number of SUs is 42, the loss of the average detection performance is about 1.9% in the SC-TR scheme with λth = -7 dB, about 3.3% in the SC-TR scheme with λth = -6 dB, about 9.3% in the SC-CR scheme, and about 45.2% in the OR-rule based HC scheme, in comparison with the SC-FR scheme.
Fig. 5 illustrates the average number of reporting channels that are actually used by SUs. In the conventional SC-FR scheme, the reporting overhead linearly increases with the number of SUs because all SUs report their sensing results via the dedicated reporting channels. In the SC-TR scheme, the number of dedicated reporting channels also increases with the number of SUs but the number of reporting channels that are actually used by SUs can be adjusted by controlling the value of the threshold, λ. In particular, the SC-CR scheme uses a fixed number of reporting channels regardless of the number of SUs; moreover, the number of reporting channels actually used by SUs is also almost fixed under the value of β. When the number of SUs is 42, the average number of actually used reporting channels can be reduced by about 76.7% in the SC-TR scheme with λth = -7 dB, about 82.6% in the SC-TR scheme with λth = -6 dB, and about 58.3% in the SC-CR scheme, in comparison with the SC-FR scheme. In particular, for the OR-rule based HC scheme, a very small number of reporting channels are actually used by SUs in order to report one-bit information because, if at least one SU reports one-bit information, the FC decides the presence of a PU.
Fig. 6 shows the average detection probability of the SC-CR scheme according to the number of reporting channels. As expected, the detection performance increases as the number of reporting channels increases. For a small number of β, the detection performance is severely deteriorated because of frequent collisions. For K = 42, the average detection probability is about {0.82, 0.86, 0.89, 0.92} when β = {10, 15, 20, 30}, respectively.
Fig. 7 shows the average detection probability as the average received SNR of SUs increases when the number of SUs is 24, where the average SNRs of all SUs are assumed to be identical. The average detection probability approaches to one as the average received SNR of SUs increase. The OR-rule based HC scheme shows the worst detection performance. In particular, the detection probability of the OR-rule based HC scheme is significantly deteriorated at the low SNR region. The decision threshold of the SC-TR scheme is configured by adding 2 dB to the average SNR of SUs. When the average SNR is -8 dB, the loss of the average detection performance is about 9.4% in the SC-TR scheme, about 17.9% in the SC-CR scheme, and about 53.9% in the OR-rule based HC scheme, in comparison with the SC-FR scheme.
6.3 Throughput and Power Consumption from the SU’s Perspective
Fig. 8 shows the average spectral efficiency of an SU in the four cooperative spectrum sensing schemes, where the parameters of the SC-CR scheme are optimally selected to maximize the throughput of an SU. In the SC-FR and SC-TR schemes, as the number of SUs increases, the average spectral efficiency of an SU increases owing to the increase of the sensing performance but it decreases after a critical number of SUs, e.g., 18 in the SC-FR scheme, because of the excessive reporting overhead. On the other hand, the average spectral efficiency of the SC-CR scheme continuously increases without any decrease owing to the multiuser diversity as the number of SUs increases. However, the SC-CR scheme shows the worst throughput performance when the number of SUs is low. Although the OR-rule based HC scheme uses a small amount of resources to transmit a reporting message, it shows worse throughput performance because of its lower sensing performance.
Fig. 9 shows the average number of reporting transmissions of an SU in the four cooperative spectrum sensing schemes, where the parameters of the SC-CR scheme are optimally selected to maximize the throughput. From (24), the average number of reporting transmissions can be approximately regarded as the amount of power consumption. In the SC-FR scheme, because all SUs report their sensing results during the reporting time, the power consumption of an SU becomes Pt, where Pt is the power consumed to transmit a reporting message. In the SC-TR scheme and the OR-rule based HC scheme, the power consumption of an SU is very low and it is almost constant because an SU transmits its sensing result only when the observed energy value is greater than a threshold. The OR-rule based HC scheme has a higher threshold because, if at least one SU reports one-bit information, the FC decides the presence of a PU. Hence, in the OR-rule based HC scheme, the power consumption of an SU is quite low because of the higher threshold. In the SC-CR scheme, SUs may transmit their reporting messages several times during the reporting time and therefore the power consumption of an SU may be higher. However, because the FC controls the load of reporting transmissions according to the number of SUs, the average power consumption of an SU decreases as the number of SUs increases.
7. Conclusion
In a centralized cognitive radio network, two cooperative spectrum sensing schemes have been proposed to reduce the reporting overhead; a soft combination with threshold-based reporting (SC-TR) and a soft combination with contention-based reporting (SC-CR). The proposed schemes significantly reduce the reporting overhead with a slight sacrifice in detection performance. When the number of sensing nodes is 42, the SC-TR scheme reduces the actual reporting overhead by about 76.7% with an 1.9% sacrifice in detection performance; and the SC-CR scheme reduces the reporting overhead by about 58.3% with a 9.3% sacrifice in detection performance. Additionally, we can control the tradeoff between the reduction of the reporting overhead and the loss of the detection performance by adjusting the decision threshold in the SC-TR scheme or the number of shared reporting channels in the SC-CR scheme. From the perspective of secondary users, we analyzed the throughput and power consumption of an SU. When there are many secondary users, the SC-CR scheme shows higher throughput with an increase of the power consumption than other threshold-based cooperative spectrum sensing schemes.
References
- T. Yücek and H. Arslan, "An survey of spectrum sensing algorithms for cognitive radio applications," IEEE Communications Surveys & Tutorials, vol. 11, no. 1, pp. 116-130, First quarter 2009. Article (CrossRef Link). https://doi.org/10.1109/SURV.2009.090109
- Y.-C. Liang, K.-C. Chen, G. Y. Li, and P. Mahonen, “Cognitive radio networking and communications: an overview,” IEEE Transactions on Vehicular Technology, vol. 60, no. 711, pp. 3386–3407, Sep. 2011. Article (CrossRef Link). https://doi.org/10.1109/TVT.2011.2158673
- E. C.Y. Peh, Y.-C. Liang, Y. L. Guan, and Y. Zeng, “Cooperative spectrum sensing in cognitive radio networks with weighted decision fusion schemes,” IEEE Transactions on Wireless Communications, vol. 9, no. 12, pp. 3838-3847, Dec. 2010. Article (CrossRef Link). https://doi.org/10.1109/TWC.2010.092810.100320
- H. Hu, Y. Xu, Z. Liu, N. Li, and H. Zhang, “Optimal strategies for cooperative spectrum sensing in multiple cross-over cognitive radio networks,” KSII Transactions on Internet and Information Systems, vol. 6, no. 12, pp. 3016-3080, Dec. 2012. Article (CrossRef Link).
- X.-L. Huang, G. Wang, F. Hu, and S. Kumar, “The impact of spectrum sensing frequency and packet-loading scheme on multimedia transmission over cognitive radio networks,” IEEE Transactions on Multimedia, vol. 13, no. 4, pp.748-761, Aug. 2011. Article (CrossRef Link). https://doi.org/10.1109/TMM.2011.2148701
- W. Lee and D.-H. Cho, “Enhanced spectrum sensing scheme in cognitive radio systems with MIMO antennae,” IEEE Transactions on Vehicular Technology, vol. 60, no. 3, pp. 1072-1085, Mar. 2011. Article (CrossRef Link). https://doi.org/10.1109/TVT.2011.2112676
- A. Noel and R. Schober, “Convex sensing-reporting optimization for cooperative spectrum sensing,” IEEE Transactions on Wireless Communications, vol. 11, no. 5, pp. 1900-1910, May 2012. Article (CrossRef Link). https://doi.org/10.1109/TWC.2012.030812.111408
- Y.-J. Choi, W. Pak, Y. Xin, and S. Rangarajan, “Throughput analysis of cooperative spectrum sensing in Rayleigh-faded cognitive radio systems,” IET Communications, vol. 6, no. 9, pp. 1104-1110, Sep. 2012. Article (CrossRef Link). https://doi.org/10.1049/iet-com.2010.1025
- J. Ma, G. Zhao, and Y. G. Li, “Soft combination and detection for cooperative spectrum sensing in cognitive radio networks,” IEEE Transactions on Wireless Communications, vol. 7, no. 11, pp. 4502-4507, Nov. 2008. Article (CrossRef Link). https://doi.org/10.1109/T-WC.2008.070941
- Z. Wang and W. Zhang, “Exploiting multiuser diversity with 1-bit feedback for spectrum sharing,” IEEE Transactions on Wireless Communications, vol. 62, no. 1, pp. 29-40, Jan. 2014. Article (CrossRef Link). https://doi.org/10.1109/TCOMM.2013.112313.130355
- P. Kaligineedi and V. K. Bhargava, “Sensor allocation and quantization schemes for multi-band cognitive radio cooperative sensing system,” IEEE Transactions on Wireless Communications, vol. 10, no. 1, pp. 284-293, Jan. 2011. Article (CrossRef Link). https://doi.org/10.1109/TWC.2010.102810.100650
- W. Zhang, R. K. Mallik, and K. B. Letaief, “Optimization of cooperative spectrum sensing with energy detection in cognitive radio networks,” IEEE Transactions on Wireless Communications, vol. 8, no. 12, pp. 5761-5766, Dec. 2009. Article (CrossRef Link). https://doi.org/10.1109/TWC.2009.12.081710
- W. Han, J. Li, Z. Tian, and Y. Zhang, “Efficient cooperative spectrum sensing with minimum overhead in cognitive radio,” IEEE Transactions on Wireless Communications, vol. 9, no. 10, pp. 3006-3011, Oct. 2010. Article (CrossRef Link). https://doi.org/10.1109/TWC.2010.080610.100317
- J. Lai, E. Dutkiewicz, R. P. Liu, and R. Vesilo, "Performance optimization of cooperative spectrum sensing in cognitive radio networks," in Proc. of IEEE Wireless Communications and Networking Conference (WCNC), Apr. 2013, pp. 631-636. Article (CrossRef Link).
- N. Han and H. Li, “Cooperative spectrum sensing with location information,” IEEE Transactions on Vehicular Technology, vol. 61, no. 7, pp. 3015-3024, Sep. 2012. Article (CrossRef Link). https://doi.org/10.1109/TVT.2012.2202410
- W. Kadhim Saad, M. Ismaila , R. Nordina, and A. A. El-Saleh, “On the performance of cooperative spectrum sensing of cognitive radio networks in AWGN and Rayleigh fading environments,” KSII Transactions on Internet and Information Systems, vol. 7, no. 8, pp. 1754-1769, Aug. 2013. Article (CrossRef Link). https://doi.org/10.3837/tiis.2013.08.001
- S. Sanayei and A. Nosratinia, “Opportunistic downlink transmission with limited feedback,” IEEE Transactions on Information Theory, vol. 53, no. 11, pp. 4363-4372, Nov. 2007. Article (CrossRef Link). https://doi.org/10.1109/TIT.2007.899529
- T. Yoo, N. Jindal, and A. Goldsmith, “Multi-antenna downlink channels with limited feedback and user selection,” IEEE Journal on Selected Areas in Communications, vol. 25, no. 7, pp. 1478-1491, Sep. 2007. Article (CrossRef Link). https://doi.org/10.1109/JSAC.2007.070920
- D. Gesbert and M.-S. Alouini, "How much feedback is multi-user diversity really worth?" in Proc. of IEEE International Conference on Communications (ICC), pp. 234-238, Jun. 2004. Article (CrossRef Link).
- J. So and J. M. Cioffi, “Multiuser diversity in a MIMO system with opportunistic feedback,” IEEE Transactions on Vehicular Technology, vol. 58, no. 9, pp. 4909–4918, Nov. 2009. Article (CrossRef Link). https://doi.org/10.1109/TVT.2009.2024019
- S. Atapattu, C. Tellambura, and H. Jiang, “Energy detection based cooperative spectrum sensing in cognitive radio networks,” IEEE Transactions on Wireless Communications, vol. 10, no. 4, pp. 1232–1241, Sep. 2010. Article (CrossRef Link). https://doi.org/10.1109/TWC.2011.012411.100611
- J. Ma and Y. G. Li, "Soft combination and detection for cooperative spectrum sensing in cognitive radio networks," in Proc. of IEEE Global Communications Conference (GLOBECOM), Nov. 2007, pp. 3139-3143. Article (CrossRef Link).
- Y.-C. Liang, Y. Zeng, E. C.Y. Peh, and A. T. Hoang, “Sensing-throughput tradeoff for cognitive radio networks,” IEEE Trans. Wireless Commun., vol. 7, no. 4, pp. 1326–1337, Apr. 2008. Article (CrossRef Link). https://doi.org/10.1109/TWC.2008.060869
- H. Li, Q. Guo, and D. Huang, “Throughput analysis of opportunistic feedback for downlink multiuser diversity with capture effect,” IEEE Commun. Lett., vol. 16, no. 1, pp. 44–46, Jan. 2012. Article (CrossRef Link). https://doi.org/10.1109/LCOMM.2011.111011.111751
- S. Boyd and L. Vandenberghe, “Convex Optimization”, Cambridge, MA: Cambridge University Press, 2004. Article (CrossRef Link).
Cited by
- Energy efficient scheme based on simultaneous transmission of the local decisions in cooperative spectrum sensing vol.10, pp.3, 2015, https://doi.org/10.3837/tiis.2016.03.003
- Secure Cooperative Sensing Scheme for Cognitive Radio Networks vol.41, pp.8, 2015, https://doi.org/10.7840/kics.2016.41.8.877
- An Efficient Contention-Window Based Reporting for Internet of Things Features in Cognitive Radio Networks vol.2019, pp.None, 2015, https://doi.org/10.1155/2019/8475020