Optimal Sensing Time for Maximizing the Throughput of Cognitive Radio Using Superposition Cooperative Spectrum Sensing

  • cc icon
  • ABSTRACT

    Spectrum sensing plays an essential role in a cognitive radio network, which enables opportunistic access to an underutilized licensed spectrum. In conventional cooperative spectrum sensing (CSS), all cognitive users (CUs) in the network spend the same amount of time on spectrum sensing and waste time in remaining silent when other CUs report their sensing results to the fusion center. This problem is solved by the superposition cooperative spectrum sensing (SPCSS) scheme, where the sensing time of a CU is extended to the reporting time of the other CUs. Subsequently, SPCSS assigns the CUs different sensing times and thus affects both the sensing performance and the throughput of the system. In this paper, we propose an algorithm to determine the optimal sensing time of each CU for SPCSS that maximizes the achieved system throughput. The simulation results prove that the proposed scheme can significantly improve the throughput of the cognitive radio network compared with the conventional CSS.


  • KEYWORD

    Cognitive radio , Optimal sensing time , Superposition cooperative spectrum sensing , Throughput maximization

  • I. INTRODUCTION

    In recent years, greater bandwidth and higher bit rates have been required to meet the increased usage demands caused by the explosion of wireless communication technology. According to the Federal Communications Commission spectrum policy task force report [1], the actual utilization of a licensed spectrum varies from 15% to 80%. Therefore, cognitive radio (CR) technology [2] has been proposed to solve the problem of the ineffective utilization of spectrum bands. The scarcity of spectrum bands can be relieved by allowing some cognitive users (CUs) to opportunistically access the spectrum assigned to the primary user (PU) whenever the channel is free. However, CUs must vacate their frequency when the presence of a PU is detected. Therefore, reliable detection of the PU signal is an essential requirement of CR networks.

    To ascertain the presence of a PU, CUs can use one of the several common detection methods, such as the matched filter, feature, and energy detection methods [2,3]. Energy detection is an optimal detection method if the CUs have limited information about the PU signal (e.g., if only the local noise power is known) [3]. Improved spectrum usage detection can be obtained by allowing some CUs to perform cooperative spectrum sensing (CSS) [4-6].

    In conventional CSS, the time frame is divided into two main parts, namely the sensing and the data transmission parts. In the sensing part, all CUs take the same amount of time to perform spectrum sensing, and then, because of the limitations of the control channel, the CUs report their sensing results to the fusion center (FC) one by one, while the other CUs remain silent. On the other hand, the superposition cooperative spectrum sensing (SPCSS) proposed in [7], which allows CUs to extend their sensing times to the reporting slots of the others, can improve the sensing performance of CSS without requiring any more time for the sensing part. The trade-off between the sensing time and the throughput was studied in [8] for conventional CSS, in which the optimal sensing time for all CUs that maximize the throughput of the CR system was determined. Since the optimal sensing time obtained by [8] is the same for all CUs, it may not apply to SPCSS, in which each CU is assigned a different sensing time according to the reporting order of the CUs. Subsequently, the problem of determining the optimal sensing time for SPCSS is still open and needs more research on throughput maximization.

    In this paper, we propose an algorithm to determine the optimal sensing time for SPCSS, with which the system can achieve the maximum throughput. In the proposed algorithm, we consider the reliability of the CUs (i.e., the signal-to-noise ratio (SNR) of the sensing channel) to decide the reporting order of the CUs. According to this order, the proposed algorithm determines the optimal sensing time for all the CUs in the network. Thus, we expect the proposed scheme to offer a higher throughput for CR networks than the conventional CSS scheme [8].

    The rest of this paper is organized as follows: Section II describes the system model of the proposed scheme. Section III gives a detailed explanation of the proposed algorithm to find the optimal sensing time for maximizing the throughput of the CR system. Section IV introduces the simulation models and the simulation results of the proposed scheme. Finally, Section V concludes this paper.

    II. SYSTEM MODEL

    In this study, we consider a network consisting of N CUs. Further, there is one PU occupying the observed band with a specific probability. The high accuracy of transmission from the CUs to the FC can be mostly guaranteed by using some error control methods. For example, an error detection and correction method can be used in which the error of the received data at the FC can be detected and corrected by using channel coding. An error detection and retransmission method in which the FC can ask the CUs to retransmit their sensing data when it receives the error data from the CUs can also be used. Therefore, in this study, we assume that the CUs can transmit their sensing data to the FC through an ideal reporting channel.

    Each CU utilizes an energy detector for spectrum sensing. Then, at the ith sensing interval, the received signal energy Ej(i) of the jthCU is calculated as follows:

    image

    where H0 and H1 correspond to the hypotheses of the absence and the presence of the PU signal, respectively; x(k) represents the signal transmitted from the PU; hj denotes the amplitude gain of the channel; n(k) indicates the additive white Gaussian noise; Mj = tsjfs represents the number of samples over a sensing interval; tsj refers to the sensing time; fs stands for the sensing bandwidth; and ki denotes the time slot at which the ith sensing interval begins.

    When Mj is relatively large (e.g., Mj > 200), Ej can be well approximated as a Gaussian random variable for both hypotheses as follows [9]:

    image

    where N(‧) denotes the Gaussian distribution, μj,H0 and μj,H1 represent the mean of Ej for the H0 and H1 hypotheses, respectively; indicate the variance of Ej for the H0 and H1 hypotheses, respectively; and γj stands for the SNR of the sensing channel between the jth CU and the PU. In general, the exact value of the SNR is not available for both the CUs and the FC. However, there are many studies on the estimation of the SNR, such as [10-12]. For CSS, the CUs and the FC can utilize one of these SNR estimation algorithms to estimate the SNR. Further, the main purpose of this study is to determine the optimal sensing time for SPCSS. Therefore, in this study, we assume that the SNR information is available in the FC.

    III. OPTIMAL SENSING TIME FOR SUPERPOSITION COOPERATIVE SPECTRUM SENSING

    The sensing result (i.e. received signal power) that the CUs sense from the PU’s signal will be reported to the FC. In conventional CSS, when a CU sends the sensing results to the FC, the other CUs remain silent and wait until their reporting time. In this case, all the CUs have the same sensing time, as shown in Fig. 1, such that ts1,C=ts2,C=…=tsN,C=ts . On the other hand, SPCSS extends the sensing time of the CUs to the reporting time of the other CUs, as shown in Fig. 2. This implies that the CU that is the last CU reporting the sensing information to the FC will have the longest sensing time tsN,S , and the CU that reports first to the FC will have the shortest sensing time ts1,S=ts . Here, we assume that all CUs have the same reporting duration tr1,S=tr2,S=…=trN,S=tr . Then, the sensing time of all CUs in the case of the SPCSS can be expressed as follows:

    image

    At the FC, a maximum gain combination (MGC) rule is used for combining all the sensing results from the CUs as follows:

    image

    where εj denotes the weight of the jth CU and is given as

    Without any loss of generality, we assume that Ej and εj are independent for different CUs. Therefore, EMGC can be approximated by a Gaussian distribution for both hypotheses of the PU signal.

      >  A. Conventional Cooperative Spectrum Sensing

    In the conventional CSS, all CUs have the same number of sensing samples (i.e., the same sensing time) such that M=M1=M2=…=MN . Subsequently, the distribution of the accumulated signal power at the FC, EC,MGC , is expressed as follows:

    image

    where N denotes the normal distribution, and μC,H0 and μC,H1 represent the mean of EC,MGC for the H0 and H1 hypotheses, respectively. denote the variance of EC,MGC for the H0 and H1 hypotheses, respectively.

    According to the value of EC,MGC , the global decision GC(i) will be determined as follows:

    image

    Here, λC denotes the threshold for the global decision of the conventional CSS.

    The sensing performance of the conventional CSS can be evaluated by the probability of detection and the probability of false alarm as follows, respectively:

    image

    and

    image

      >  B. Superposition Cooperative Spectrum Sensing

    For the case of SPCSS, the CU that first reports its sensing information to the FC has the shortest sensing time, which is equal to the sensing time of conventional CSS. Other CUs will continue with spectrum sensing until their reporting rounds are reached. Therefore, different CUs will have a different number of sensing samples. Subsequently, the distribution of the accumulated signal power at the FC, ES,MGC, is expressed as follows:

    image

    where Mj=fs(ts+(j-1)tr) denotes the number of sensing samples of the jth CU, fs represents the sensing sample rate, and μS,H0 and μS,H1 indicate the mean of EC,MGC for the H0 and H1 hypotheses, respectively. denote the variance of EC,MGC for the H0 and H1 hypotheses, respectively.

    As in conventional CSS, in SPCSS, the global decision is made as follows:

    image

    where λs denotes the threshold for the global decision of the SPCSS.

    The sensing performance of the SPCSS can be evaluated by using the probability of detection and the probability of false alarm as follows, respectively:

    image

    and

    image

    Depending on the required value of the probability of detection Pd*, the probability of false alarm can be calculated as follows:

    image

      >  C. Optimal Sensing Time

    Suppose that τ denotes the time for the CUs performing spectrum sensing and reporting the sensing information to the FC. Then, we have τ=ts+Ntr . Therefore, the time that can be used for data transmission is tt=T-τ , where T denotes the total frame time.

    Let us consider C0 to be the throughput of the CR network when it operates in the absence of the PU, and C1 to be the throughput when it operates in the presence of the PU. Then, C0 and C1 can be calculated as follows:

    image

    and

    image

    where Ps denotes the received power of the CU, PN represents the noise power, Pp indicates the interference power of the PU measured at the CU, SNRs=Ps / PN stands for the SNR of the CU–CU communication channel when the PU signal is absent, and SNRP=Pp / PN denotes the SNR received in the CU when the PU signal is present.

    Let us define P0 as the probability that the PU is idle and P1 as the probability that the PU is active. Then, P0+P1=1 and the average throughput of the CR system can be expressed as follows:

    image

    where

    image
    image

    Further, Ys={Ts1,S, Ts2,S,…, TsN,S} denotes the sensing times of all the CUs in the network.

    Next, the problem of determining the optimal sensing time can be formulated as follows:

    image

    where denotes the required probability of detection of the CR network.

    Further, the reporting time tr is fixed for all the CUs (they report the same type of data to the same destination). Therefore, Ys depends on ts and the sensing order of each CU. In this study, we determine the sensing order of each CU according to its SNR in the sensing channel. That is, the CU with a higher SNR will be given a longer sensing time. Let us now arrange the CUs following an increase in the SNR; this implies that CU 1 has the lowest SNR and is the first in the sensing order with the lowest sensing time Ts1,S=ts and that CU N has the highest SNR and is the last in the sensing order with the longest sensing time TsN,S=ts+(N-1)tr . Subsequently, the problem in Eq. (19) can be rewritten as follows:

    image

    The problem in Eq. (20) can be solved to find the optimal sensing time ts,opt and the maximum throughput of the system R(ts,opt) by using a numerical method such as the Golden section search or a Fibonacci search method [13]. In this study, the Golden search method [13] is used for finding the optimal value of the sensing time. Initially, the range of the sensing time is experimentally determined to be ts ϵ [ts,min,ts,max] .

    On the basis of this range, we apply the Golden search method to find ts,opt according to the flow chart shown in Fig. 3, where ρ=0.382 is a constant defined by the Golden search method [13].

    IV. SIMULATION RESULTS

    In this section, we will present the simulation results to demonstrate the performance of the proposed scheme. We consider a CR network containing 10 CUs and 1 PU with the absence probability of P0=0.8 . The required probability of detection is set as =0.95 . The reporting time is set as tr = 0.001 s, which is similar to the IEEE 802.11 standard. Each CU independently senses the presence of the PU. For reference, the simulation results of the proposed scheme are compared with the results of [8].

    Fig. 4 shows the sensing performance at the FC of the CR network in terms of the probability of detection and the probability of false alarm Pf(ts) when the SNR of the sensing channel of all the CUs is the same as γj = 17 dB. This shows that the SPCSS can improve the sensing performance (i.e., decrease the probability of false alarm) while maintaining the same probability of detection. Therefore, the SPCSS can increase the opportunity to utilize a free frequency band of the PU.

    Fig. 5 presents the average throughput of the CR system for different values of the sensing time. It can be seen that SPCSS provides a considerable higher throughput than the conventional CSS. Further, at the same SNR in the sensing channel, the SPCSS needs a smaller sensing time to achieve the maximum average throughput than the conventional CSS. The average throughput of the CR system for different values of the required probability of detection is shown in Fig. 6. This figure proves that the proposed scheme can improve the throughput of the CR system. In other words, when the SNR of the sensing channel is –17 dB or –20 dB, the proposed scheme provides a throughput that is 30% or 40% higher than that of the conventional scheme, respectively.

    Fig. 7 shows the optimal sensing time ts,opt for the achieved throughput shown in Fig. 6 for different values of the required probability of detection It can be seen that ts,opt is dependent on the value of and that higher may require higher ts,opt.

    Fig. 8 shows the average throughput of the CR system for different values of the required probability of detection Pd when the network includes six CUs and each of them has a different SNR value; the SNR values of these six CUs are –24, –22, –20, –18, –16, and –13 dB, respectively. The performance values of four schemes, namely the proposed scheme that assigns a longer sensing time to a CU with a higher SNR (called the proposed scheme with ordered sensing), the proposed scheme that utilizes a random sensing order (called the proposed scheme with random sensing), conventional scheme proposed in [8] with MGC, and conventional scheme proposed in [8] with equal gain combination (EGC), are provided for reference. It can be seen that the proposed scheme with ordered sensing can achieve a better sensing performance than the proposed scheme with a random sensing order. Further, the proposed scheme always outperforms the conventional scheme. The conventional scheme with MGC has a better performance than the conventional scheme with EGC.

    V. CONCLUSION

    In this paper, we proposed an algorithm to find the optimal sensing time of all the CUs for SPCSS. In the proposed algorithm, ordered sensing was considered for assigning a longer sensing time to the CUs with higher SNR values and a shorter sensing time to the CUs with lower SNR values. The simulation results showed that the proposed scheme could significantly improve the throughput of the CR system, in comparison with the conventional scheme [8]. Moreover, we observed that the proposed scheme with ordered sensing achieved a better performance than the proposed scheme with a random sensing order. However, further research is required to analytically prove this conclusion. This will be our future work on this research topic.

  • 1. 2002 “Spectrum Policy Task Force Report,” google
  • 2. Hur Y., Park J., Woo W., Lim K., Lee C. H., Kim H. S., Laskar J. 2006 “A wideband analog multi-resolution spectrum sensing (MRSS) technique for cognitive radio (CR) systems,” [in Proceedings of 2006 IEEE International Symposium on Circuits and Systems (ISCAS2006)] P.4090-4093 google
  • 3. Sahai A., Hoven N., Tandra R. 2004 “Some fundamental limits on cognitive radio,” [in Proceedings of Allerton Conference on Communications, Control and Computing] P.1662-1671 google
  • 4. Ganesan G., Li Y. 2005 “Cooperative spectrum sensing in cognitive radio networks,” [in Proceedings of 2005 First IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks (DySPAN2005)] P.137-143 google
  • 5. You C., Kwon H., Heo J. 2011 “Cooperative TV spectrum sensing in cognitive radio for Wi-Fi networks,” [IEEE Transactions on Consumer Electronics] Vol.57 P.62-67 google doi
  • 6. Vu-Van H., Koo I. 2011 “Cooperative spectrum sensing with collaborative users using individual sensing credibility for cognitive radio network,” [IEEE Transactions on Consumer Electronics] Vol.57 P.320-326 google doi
  • 7. Jin J., Xu H., Li H., Ren C. 2010 “Superposition-based cooperative spectrum sensing in cognitive radio networks,” [in Proceedings of 2010 International Conference on Computer Application and System Modeling (ICCASM)] P.342-346 google
  • 8. Liang Y. C., Zeng Y., Peh E. C. Y., Hoang A. T. 2008 “Sensing-throughput tradeoff for cognitive radio networks,” [IEEE Transactions on Wireless Communications] Vol.7 P.1326-1337 google doi
  • 9. Ma J., Li Y. 2007 “Soft combination and detection for cooperative spectrum sensing in cognitive radio networks,” [in Proceedings of IEEE Global Telecommunications Conference (GLOBECOM)] P.3139-3143 google
  • 10. Hua J., Meng L., Xu Z., Li G. 2010 “An adaptive signal-to-noise ratio estimator in mobile communication channels,” [Digital Signal Processing] Vol.20 P.692-698 google doi
  • 11. Fujii M., Watanabe Y. 2012 “A study on SNR estimation for cognitive radio,” [in Proceedings of 2012 IEEE International Conference on Ultra-Wideband (ICUWB)] P.11-15 google
  • 12. Al-Hmood H., Abbas R. S., Masrub A., Raweshidy H. S. 2013 “An estimation of primary user’s SNR for spectrum sensing in cognitive radios,” [in Proceedings of 2013 3rd International Conference on Innovative Computing Technology (INTECH)] P.479-484 google
  • 13. Chong E. K. P., Zak S. H. 2013 An Introduction to Optimization. google
  • [] 
  • [] 
  • [] 
  • [Fig. 1.] Time frame of conventional cooperative spectrum sensing. CU: cognitive user.
    Time frame of conventional cooperative spectrum sensing. CU: cognitive user.
  • [Fig. 2.] Time frame of superposition cooperative spectrum sensing. CU: cognitive user.
    Time frame of superposition cooperative spectrum sensing. CU: cognitive user.
  • [] 
  • [] 
  • [] 
  • [] 
  • [] 
  • [] 
  • [] 
  • [] 
  • [] 
  • [] 
  • [] 
  • [] 
  • [] 
  • [] 
  • [] 
  • [] 
  • [] 
  • [Fig. 3.] Flow chart of the Golden search method for finding the optimal sensing time.
    Flow chart of the Golden search method for finding the optimal sensing time.
  • [Fig. 4.] Sensing performance of the cognitive radio network for different values of the sensing time ts. CCS: cooperative spectrum sensing.
    Sensing performance of the cognitive radio network for different values of the sensing time ts. CCS: cooperative spectrum sensing.
  • [Fig. 5.] Average throughput of the cognitive radio system for different values of the sensing time ts. CCS: cooperative spectrum sensing, SNR: signal-to-noise ratio.
    Average throughput of the cognitive radio system for different values of the sensing time ts. CCS: cooperative spectrum sensing, SNR: signal-to-noise ratio.
  • [Fig. 6.] Average throughput of the cognitive radio system for different values of the required probability of detection Pd when the optimal solution ts,opt is applied. SNR: signal-to-noise ratio.
    Average throughput of the cognitive radio system for different values of the required probability of detection Pd when the optimal solution ts,opt is applied. SNR: signal-to-noise ratio.
  • [Fig. 7.] Optimal sensing time ts,opt of the cognitive radio system for different values of the required probability of detection Pd. SNR: signal-to-noise ratio.
    Optimal sensing time ts,opt of the cognitive radio system for different values of the required probability of detection Pd. SNR: signal-to-noise ratio.
  • [Fig. 8.] Average throughput of the cognitive radio system for different values of the required probability of detection Pd when the optimal solution ts,opt is applied and the signal-to-noise ratio values of six CUs are ?24, ?22, ?20, ?18, ?16, and ?13 dB, respectively. MGC: maximum gain combination, EGC: equal gain combination.
    Average throughput of the cognitive radio system for different values of the required probability of detection Pd when the optimal solution ts,opt is applied and the signal-to-noise ratio values of six CUs are ?24, ?22, ?20, ?18, ?16, and ?13 dB, respectively. MGC: maximum gain combination, EGC: equal gain combination.