Next Article in Journal
Improved Time-Synchronization Algorithm Based on Direct Compensation of Disturbance Effects
Next Article in Special Issue
Prediction of Motor Failure Time Using An Artificial Neural Network
Previous Article in Journal
An Enhanced Virtual Force Algorithm for Diverse k-Coverage Deployment of 3D Underwater Wireless Sensor Networks
Previous Article in Special Issue
Human Activity Recognition Using Inertial Sensors in a Smartphone: An Overview
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Further Exploration of Multi-Slot Based Spectrum Sensing

1
College of Mechatronic Engineering, North University of China, Taiyuan 030051, China
2
School of Information and Communication Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China
*
Authors to whom correspondence should be addressed.
Sensors 2019, 19(16), 3497; https://doi.org/10.3390/s19163497
Submission received: 28 June 2019 / Revised: 1 August 2019 / Accepted: 6 August 2019 / Published: 9 August 2019
(This article belongs to the Special Issue Sensor Technologies for Smart Industry and Smart Infrastructure)

Abstract

:
Spectrum sensing (SS) exhibits its advantages in the era of Internet of Things (IoT) due to limited spectrum resource and a lower utilization rate of authorized spectrum. In consequence, the performance improvement of SS seems a matter of great significance for the development of wireless communication and IoT. Motivated by this, this paper is devoted to multi-slot based SS in specialty and several important conclusions are drawn. Firstly, SS with one slot outperforms those with multiple slots if decision fusion rule is considered for multi-slot based SS. Secondly, multi-slot based SS is conducive to the performance improvement of SS when instantaneous strong noise occurs in the radio environment. Thirdly, for multi-slot based cooperative spectrum sensing (CSS), majority voting rule among multiple nodes obtains the optimal sensing performance. Both theoretical analysis and simulation experiment validate the conclusions drawn in this paper.

1. Introduction

With the rapid development of wireless communication technology and the rapid increasing of wireless communication services, the resources of frequency spectrum are increasingly scarce, even resulting in the increasing crowd of unauthorized ISM (Industrial Scientific Medical) public bands. A recent investigation from Federal Communications Commission (FCC) have shown that the variations in the utilization of the assigned spectrum vary from 15% to 85% [1], which makes the efficient utilization of these bands a more significant problem than the scarcity of the spectrum [2]. In addition, the time scale of spectrum occupancy varies from millisecond to hour [3].
Cognitive radio (CR), with its ability to sense radio environment and exploit the information to opportunistically find unused frequency bands which is best suited for the user’s communication requirements, is viewed as a novel approach to improve spectrum utilization [4]. Cognitive radio consists of three essential components: (1) Spectrum sensing: The secondary users are required to sense and monitor the radio spectrum environment within their operating range to detect the frequency bands that are not occupied by primary users; (2) dynamic spectrum management: Cognitive radio networks are required to dynamically select the best available bands for communication; and (3) adaptive communications: A cognitive radio device can configure its transmission parameters (carrier frequency, bandwidth, transmission power, etc.) to opportunistically make best use of the ever-changing available spectrum.
As the basis of CR, spectrum sensing mainly contributes to the decision on spectrum occupancy in virtue of various signal detection and processing methods. Over the last decade, classical SS schemes contain narrowband sensing and wideband sensing. Narrowband SS analyzes one frequency channel at a time while wideband SS analyzes several frequencies at a time [5]. The main narrowband SS schemes include energy detector (ED) [6], cyclostationary feature detection [7], matched filter detection [8], covariance-based detection [9] and machine learning based sensing [10]. Wideband sensing is mainly devoted to Nyquist based wideband sensing and compressive wideband sensing. ED works as the most popular and classical scheme for spectrum sensing due to its low complexity and superior performance [6]. However, the performance of ED always suffers from noise uncertainty in the radio environment. Even when the background environment is out of the “signal-to-noise radio (SNR) wall”, the capacity of differentiating whether observed spectrum band is busy disappears thoroughly. Consequently, ED with less noise uncertainty deserves to be explored in terms of both performance and reliability improvement for the detection of idle spectrums [11].
Generally speaking, there are two parameters closely associated with a spectrum sensing (SS) scheme: Detection probability and false alarm probability. The higher the detection probability is, the better the primary users can be protected. However, from the secondary users’ perspective, the lower the false alarm probability is, the more chances the channel can be reused when it is available, thus the higher the achievable throughput for the secondary users [12]. As a result, the performance of a SS scheme is usually evaluated by the combination of these two factors, such as (1) maximizing detection probability subject to below maximum acceptable false alarm probability, (2) maximizing throughput subject to above minimum tolerable detection probability, (3) minimizing the sum of false alarm probability and probability of miss, etc.
A cognitive user (CU) may have a good line of sight with a primary user, but due to the shadow phenomenon, the existence of the main transmitter (hidden terminal) may not be detected, which is very common in urban/indoor environments. Cooperative spectrum sensing (CSS) solves the hidden terminal issue preferably by placing multiple CR terminals in various locations [13]. With the data gathered by those local terminals or the corresponding judgment results, the observed frequency spectrum is declared to be idle or busy. Although CSS greatly improves the sensing performance, the sensing accuracy is still far below the standard of wireless regional area networks (WRAN) based on CR of 802.22 working group [14]. Motivated by this, multi-slot SS is considered in [15], where the sensing slot in each frame is split into multiple discontinuous mini-slots. The advantages of multi-slot SS in [15] consist in both sides. Firstly, it increases the robustness of the CR system, especially under instantaneous strong noise. For single slot SS, the sensing function of CR may not work due to the high false alarm probability. Secondly, it helps to improve sensing accuracy. The joint decisions of multiple nodes will lower the error probability of idle spectrum detection. However, the work in [15] is mainly devoted to the analysis of data fusion based SS in the multi-slot fashion. When the situation with limited storage or computing power occurs, the work in [15] is not the optimal choice due to that the scheme in [15] requires much computation and storage resource. Consequently, a specialized exploration on decision fusion based multi-slot SS is made in this paper. With theoretical analysis and simulation experiments, several significant conclusions are drawn as follows:
  • SS with one slot outperforms those with multiple slots if decision fusion rule is considered for multi-slot based SS.
  • Multi-slot based SS is conducive to the performance improvement of SS when instantaneous strong noise occurs in the radio environment.
  • For multi-slot based CSS, majority voting rule among multiple nodes obtains the optimal sensing performance.
The rest of this paper is organized as it is shown in the following. Section 2 reviews basic conceptions of SS and provide the system model. In Section 3, decision fusion-based SS in the multi-slot fashion is discussed in detailed. Simulations and analysis are made in Section 4. Finally, Section 5 concludes this paper.

2. System Model

Suppose that the frequency bands of interest are with carrier frequency f c and bandwidth W . Simultaneously, the received signal at the receiver of a CR is sampled at sampling frequency f s then the received signal y ( n ) could be formulated as the additive sum of clean signal (primary signal) s ( n ) and background noise w ( n ) .
y ( n ) = s ( n ) + w ( n ) , n = 0 , 1 , , N 1 ,
where N denotes the sampling point. If sensing duration is assumed to be T , N = f s τ , where τ denotes the sensing duration at a sensing event. In addition, s ( n ) is assumed to be independent and identically distributed random process with mean zero and variance E [ | s ( n ) | 2 ] = σ s 2 while w ( n ) is assumed to be additive white Gaussian noise (AGWN) with mean zero and variance E [ | w [ n ] | 2 ] = σ w 2 . Take γ = σ s 2 σ w 2 as the received signal-to-noise radio (SNR) of the primary user. Note that the estimation of noise and signal variance could be made based on our work in [11].
For an ED, the energy statistics on average could be defined as:
T ( y ) = 1 N n N | y ( n ) | 2 .
When N is large enough, T ( y ) it is regarded to be Gaussian distribution. Consequently, the false alarm probability P f and its corresponding detection probability P d could be described as:
P f = P { T ( y ) > ε | H 0 } = Q ( ( ε σ w 2 1 ) τ f s ) ,
P d = P { T ( y ) > ε | H 1 } = Q ( ( ε σ w 2 γ 1 ) τ f s 2 γ + 1 ) ,
Q ( x ) = 1 2 π x e x p ( t 2 2 ) d t ,
where H 0 denotes the absence of the primary signal and H 1 denotes the presence of the primary signal. Additionally, Q ( x ) signifies the complementary cumulative distribution function (CCDF) of standard normal distribution function.
Figure 1 exhibits the frame structure of classical SS schemes, where T denotes the frame duration. For a fixed T , a larger τ corresponds to more sampling points and a better sensing performance in return. While a smaller τ corresponds to a larger T τ and a better communication capacity of CR. In consequence, a tradeoff between sensing capacity and communication capacity always exists in CR based communication systems. How to take full advantage of limited sensing duration τ seems significant to balance sensing capacity and communication capacity of a CR.

3. Multi-Slot SS

In this section, the sensing slot in Figure 1 is divided into multiple discontinuous mini-slots just as shown in Figure 2, namely multi-slot SS. We give false alarm probability and detection probability of multi-slot SS based on decision fusion of mini-slots. Afterwards, we consider multi-slot SS in a cooperative fashion. In addition, we analyze the sensing performance of both local detection and cooperative detection when instantaneous strong noise occurs in the radio environment.
Figure 2 shows frame structure of multi-slot SS. Different from Figure 1, the sensing duration τ is decomposed into M ( M > 0 & M Z + ) , where ED based SS is conducted based on joint decision of M mini EDs with decision fusion in the fusion center.

3.1. Multi-Slot SS with Single Node

Let M be the number of mini-slots and τ 1 be the sensing time for each mini slot. Then the sensing duration in each frame could be denoted as τ   =   M τ 1 , and the number of samples for each mini-slot is N 1 = N M . In order not to lose the generality, we assume that N 1 is an integer [16]. The observed signal at the receiver of each mini slot could be formulated as
y i ( n ) = h i s i ( n ) + w i ( n ) , n = 0 , 1 , , N 1 ,
where (6) is built under three assumptions: (1) s i ( n ) is independent and identically distributed random process with mean zero and variance E [ | s i ( n ) | 2 ] = σ s 2 while w i ( n ) is AGWN with mean zero and variance E [ | w i [ n ] | 2 ] = σ w 2 ; (2) | h i | follows the N a k a g a m i m i distribution with a mean of zero; (3) the noise of each slot is independent of each other and the spectrum detection of each slot is also mutually independent [17,18,19,20].
Denote P f ( i ) and P d ( i ) as the respective probabilities of false alarm and detection at the i th mini-slot. With detection threshold ε 0 , the detection probability of i th time slot is formulated as:
P d ( i ) = Q ( ( ε 0 σ n 2 γ 1 ) τ 0 f s 2 γ + 1 ) ,
and the corresponding false alarm probability is described as:
P f ( i ) = Q ( ( ε 0 σ w 2 1 ) τ 0 f s ) .
For centralized CSS, the joint decision is made in the Fusion center (FC) with two patterns, data fusion and decision fusion. Data fusion is used to convey local received energy value of each mini EDs to FC and FC makes the final decision with fusion rules such as the maximum likelihood ratio (MLR), equal gain combining (EGC), selection combining (SC) and maximal ratio combining (MRC), etc. While logic-1 or legic-0 is transmitted to the FC for the final status decision of observed spectrum band in decision based CSS, where logic-1 denotes the presence of PU(primary user) and logic-0 denotes the absence of PU. It has been shown in [21,22,23,24] that soft-based decisions (decision fusion) outperform hard-based decisions (data fusion). But this difference in performance is at the expense of more energy consumption and bandwidth. Furthermore, [25] shows that the difference between hard and soft decision fusion is less than a fraction of 1 dB. However, in [26], a fair comparison shows that the hard decision fusion is better than that of the soft in most cases if we consider the reporting channel bandwidth. Motivated by these considerations, in this paper, we consider the decision fusion based CSS for multi-slot SS.
The K-out-of-N rule is a general rule for decision fusion-based CSS, where K denotes the number of CUs and states the existence of PU and N is the full number of CUs [27]. With a different size of K, several rules can be derived from the K-out-of-N rule, for instance the OR rule (K = 1) [28], the AND rule (K = N) [29] and majority-logic rule ( K N 2 ) [30]. In the following, we discuss three classical decision fusion based CSS mentioned above.
OR rule: The OR rule declares the presence of primary signal when at least one user indicates the signal is present. Mathematically, we define the status statistics in the FC as Λ = i = 1 M I i , where I i denotes the decision status of each local mini ED (0 or 1). If Λ 1 , we decide that the primary signal is present; otherwise, the primary user is not present. According to (7) and (8), the detection probability and false alarm probability in this case could be written as:
P d O R = 1 i = 1 M ( 1 P d ( i ) ) ,
P f O R = 1 i = 1 M ( 1 P f ( i ) ) ,
And rule: The primary signal is considered to be in when all the users declare its presence. In other words, if i = 1 M I i = M , the observed radio spectrum band is decided to be busy; in other cases, the observed radio spectrum band is idle. Then the corresponding detection probability and false alarm probability is denoted as:
P d A N D = i = 1 M P d ( i ) ,
P f A N D = i = 1 M P f ( i ) ,
Majority voting rule (MV): The majority voting rule declares the presence of the primary signal when more than half of CUs vote for that. Mathematically, if Λ = i = 1 M I i M 2 , the spectrums of interest are judged to be busy. On the contrary, the observed spectrums are unoccupied. As a result, the detection probability and false alarm probability could be expressed as
P d M V = j = 0 M [ M 2 ] ( M [ M 2 ] + j ) ( 1 P d , 0 ) M [ M 2 ] j P d , 0 [ M 2 ] + j ,
P f M V = j = 0 M [ M 2 ] ( M [ M 2 ] + j ) ( 1 P f , 0 ) M [ M 2 ] j P f , 0 [ M 2 ] + j ,
where ( c k ) = c ! k ! ( c k ) ! , P d ( 1 ) = P d ( M ) = P d , 0   and P f ( 1 ) = P f ( M ) = P f , 0 .
Proposition 1.
For a given false alarm probability, σ w 2 and γ , P d O R < P d for a smaller M and P d O R > P d in large M cases.
Proposition 2.
For a given false alarm probability, σ w 2 and γ , P d A N D P d ( P d A N D   =   P d when M = 1 ).
Proposition 3.
For a given false alarm probability, σ w 2   and γ , P d M V < P d with the rise of M.

3.2. Multi-Slot Based CSS

In this subsection, multi-slot based SS is conducted in the cooperative fashion. We provide possible conditions of multi-slot based CSS and analyze their performance respectively [31].
Figure 3 exhibits possible conditions of multi-slot based CSS, where fusion approaches of both mini slots and CRs consider three classical decision fusion rules mentioned in (9)–(14). It is emphasized that the ‘and’ fusion rule obtains a lower false alarm probability at the expense of a lower detection probability while the ‘or’ fusion rule gets a higher detection probability with a higher false alarm probability. As a result, neither the ‘and’ fusion rule nor the ‘or’ fusion rule are the optimal fusion rule for CSS. As for MV, a tradeoff is made therein between the capacity of protecting PU and the communication capacity of CUs. In consequence, in Figure 3, the sensing performance of the ‘and-and’ fusion rule based CSS, the ‘or-or’ fusion rule based CSS and the ‘MV-MV’ fusion rule based CSS are respectively similar to those of the ‘and’ fusion rule based CSS, the ‘or’ fusion rule based CSS and ‘MV’ fusion rule based CSS. In addition, the performance of the ‘and-or’ fusion rule based CSS and the ‘or-and’ fusion rule based CSS, the ‘and-MV’ fusion rule based CSS and the ‘MV-and’ fusion rule based CSS, the ‘or-MV’ fusion rule based CSS and the ‘MV-or’ fusion rule based CSS are approximate, theoretically, due to their symmetry of the fusion rule. On this basis analyzed above, we give the performance rank of nine fusion rules of multi-slot based CSS as exhibited in Table 1, where the rank is made given a tradeoff between detection probability and false alarm probability.

3.3. Instantaneous Strong Noise

Noise interference in the wireless communication environment greatly degrades communication quality and noise enhancement has been regarded as a hot issue on wireless communication in the long run [32]. When some emergency occurs in radio environment, such as thunder, lighting, moving objects, etc., the wireless signal will suffer from instantaneous strong interference, resulting in a dramatic decline on the quality of observed signal [33]. As a result, this paper assumes SS is conducted in instantaneous strong noise environment.
For SS with a single node, as instantaneous strong noise occurs, the practical energy statistics on average T p ( y ) will be larger than T ( y ) in (2),
T p ( y ) > T ( y ) ,
leading to that the practical false alarm probability P f p and detection probability P d p being above those in (3) and (4),
{ P f p > P f P d p > P d .
Note that (A11) is obtained based on two aspects of reasons. Firstly, the observed spectrums may be declared to be busy while it is idle in reality if instantaneous strong noise happens, which lowers the communication opportunity of CU. Secondly, the observed spectrums are busy originally and the detection probability and false alarm probability are higher than that of the actual when instantaneous strong noise occurs. This exaggerates the ability of CR to protect PU and lowers throughput of CU [34].
Proposition 4.
For SS with single node, when ε < ( r 2 + 1 4 + 1 2 ) σ w 2 , the disadvantages far outweigh advantages in instantaneous strong noise conditions.
As a result, when sensing threshold ε < ( r 2 + 1 4 + 1 2 ) σ w 2 , instantaneous strong noise will cause a performance decline on SS with single node. By dividing one time slot into multiple mini slots, the performance influence from instantaneous strong noise will be greatly restrained owing to joint decision of multiple slots at different moments.
Proposition 5.
The sensing performance of multi-slot-based SS outperforms that of one-slot based SS when instantaneous strong noise occurs.
Note that the proofs of Propositions 1–5 are respectively exhibited in Appendix A, Appendix B, Appendix C, Appendix D and Appendix E.

4. Simulations and Analysis

In this section, simulations are made to validate the conclusions drawn in this paper, where carrier frequency f c = 100   MHz , sampling frequency f s = 300   MHz , sampling number N = 600 and S N R = 10   dB . Gauss channel, Rayleigh fading channel and Rice channel are considered in the simulations.

4.1. Multi-Slot SS with Single Node

Figure 4 exhibits performance comparisons of multi-slot SS with single node in the Gaussian channel, where the major voting rule is short for major here and Figure 4d–f consider instantaneous strong noise in the simulations. Firstly, instantaneous strong noise has a prominent influence on sensing performance. From Figure 4a,d, when instantaneous strong noise occurs, the sensing performance greatly degrades. In addition, from Figure 4a–c, when M increases, the sensing performance decreases gradually, which manifests that SS with one slot outperforms those with multiple slots if decision fusion rule is considered for multi-slot based SS. Thirdly, from Figure 4e, when instantaneous strong noise occurs, the SS scheme with one slot doesn’t work due to the high false alarm probability.
As a supplement, Figure 5 shows performance comparisons of multi-slot SS with single node in the Rayleigh channel and the Rice channel, respectively. It validates that SS with one slot outperforms those with multiple slots if the decision fusion rule is considered for multi-slot-based SS again, just as analyzed in Propositions 1–3. In addition, when instantaneous strong noise occurs for one slot based SS, the detection capacity of the CR for idle radio spectrum decreases dramatically. This is because that the high false alarm probability makes it difficult to determine whether the primary signal exists. However, from Figure 4d,f, multi-slot SS could work normally, which validates that multi-slot based SS is conducive to the performance improvement of SS when instantaneous strong noise occurs, just as exhibited in Propositions 4–5.

4.2. Multi-Slot Based CSS

Performance comparisons of CSS with multiple slots in Gaussian channel is given in Figure 6. Obviously, the MV-MV rule-based CSS has the optimal sensing performance compared with the others. The OR-OR based sensing scheme almost does not work due to a higher false alarm probability, especially when M is at a higher level. The sensing performance of AND-AND based CSS is inferior to that of AND-OR, AND-MV and MV-OR, which corresponds with the discussions in Section 3.2.

4.3. Performance Comparison with Data Fusion Based Multi-Slot SS

Figure 7 and Figure 8 respectively exhibit normalized throughput and its corresponding sensing time comparisons between proposed scheme and classical scheme, where classical scheme denotes the work in [15] in the case that the fading coefficients are unknown, and the proposed scheme is with the MV fusion rule. Obviously, the classical scheme outperforms the proposed scheme in terms of sensing performance. However, the advantage of the classical scheme is at the expense of sensing time, which indicates that the classical scheme requires much more computation and storage resource than that of the proposed scheme. Therefore, the proposed scheme works as a better choice for the situation with limited storage and computation resource.

5. Conclusions

This paper is devoted to multi-slot based spectrum sensing with decision fusion rule and instantaneous strong noise, where several significant conclusions are drawn and demonstrated. On the basis of multi-slot based spectrum sensing with single node, we extend it to the cooperative fashion. Both theory analysis and simulation experiments validate the conclusions drawn in this paper. In the future work, convolutional neural network will be considered for possible performance improvement of multi-slot spectrum sensing.

Author Contributions

J.Z. and J.M. proposed the idea of the paper, wrote the paper. J.Z. designed the experiment; H.C. and J.M. performed the experiment and analyzed the recorded data. This manuscript was prepared by J.Z. and revised by J.M.

Funding

This research received no external funding.

Conflicts of Interest

The authors declare no conflicts of interest.

Appendix A

Proof of Proposition 1.
For given false alarm probability, σ w 2 and γ , sensing threshold for SS and multi-slot SS with single node could be respectively formulated as
ε = [ Q 1 ( P f ) N + 1 ] σ w 2
ε 0 = [ Q 1 ( P f ) N M + 1 ] σ w 2
Then
P d O R P d 1 i = 1 M ( 1 P d ( i ) ) Q ( ( ε σ w 2 γ 1 ) N 2 γ + 1 ) i = 1 M Φ ( ( ε 0 σ w 2 γ 1 ) N M 2 γ + 1 ) Φ ( ( ε σ w 2 γ 1 ) N 2 γ + 1 )
where Φ ( )   =   1     Q ( ) denotes function of standard normal distribution.
Due to
( ε 0 σ w 2 γ 1 ) N M 2 γ + 1 = [ Q 1 ( P f ) N M γ ] N M 2 γ + 1 = Q 1 ( P f ) 2 γ + 1 γ N M 2 γ + 1
( ε σ w 2 γ 1 ) N 2 γ + 1 = [ Q 1 ( P f ) N γ ] N 2 γ + 1 = Q 1 ( P f ) 2 γ + 1 γ N 2 γ + 1
therefore
( ε 0 σ w 2 γ 1 ) N M 2 γ + 1 ( ε σ w 2 γ 1 ) N 2 γ + 1
On the other hand, Φ ( x ) monotonically increases on x . As a result,
Φ [ ( ε 0 σ w 2 γ 1 ) N M 2 γ + 1 ] Φ [ ( ε σ w 2 γ 1 ) N 2 γ + 1 ]
(A7) is equivalent to
1 ( 1 P d ( i ) ) Q ( ( ε σ w 2 γ 1 ) N 2 γ + 1 ) P d O R < P d
However, according to (19), i = 1 M Φ ( ( ε 0 σ w 2 γ 1 ) N M 2 γ + 1 ) Φ ( ( ε 0 σ w 2 γ 1 ) N M 2 γ + 1 ) = 1 ( 1 P d ( i ) ) due to Φ ( ( ε 0 σ w 2 γ 1 ) N M 2 γ + 1 ) [ 0 , 1 ] . In consequence, P d O R gradually increases with the rise of M until M 0 , after which P d O R > P d . □

Appendix B

Proof of Proposition 2.
According to (A8),
P d ( i ) Q ( ( ε σ w 2 γ 1 ) N 2 γ + 1 ) = P d
Similarly, P d ( i ) [ 0 , 1 ] , then
P d A N D = i = 1 M P d ( i ) Q ( ( ε σ w 2 γ 1 ) N 2 γ + 1 ) = P d

Appendix C

Proof of Proposition 3.
According to Bernoulli experiment, if event A occurs with the probability p ( 0 < p < 1 ) , then the probability that A happens k times in the n-weight Bernoulli experiment is equal to:
p n ( k ) = ( n k ) p k ( 1 p ) n k
For a given n, ( n k )   monotonously increases on k , p k and ( 1 p ) n k   monotonously decreases with the rise of M. However, the increment of ( n k )   is unable to keep pace with the decline of p k ( 1 p ) n k   due to 0 < p < 1   and 0 < 1 p < 1 . As a result, P d M V < P d   with the rise of M. □

Appendix D

Proof of Proposition 4.
Let us respectively define the energy statistics in H 0 case and that in H 1 case as T 0 and T 1 . Simultaneously, we assume the capacity of protecting PU is equal to its communication capacity for a CR. Then when instantaneous strong noise occurs,
{ P f p = P { T 0 + Δ > ε } P d p = P { T 1 + Δ > ε }
where Δ denotes the average increment of energy statistics when instantaneous strong noise exits.
(A12) is equivalent to
{ P f p = P { T 0 > ε 1 } P d p = P { T 1 > ε 1 }
due to an increase on both false alarm probability and detection probability, where ε 1 ( 0 < ε 1 < ε ) denotes a lower sensing threshold.
The increment of false alarm probability and detection probability when instantaneous strong noise happens are respectively defined as:
Δ P f = P f p P f = P { T 0 > ε 1 } P { T 0 > ε } = Q ( ( ε 1 σ w 2 1 ) τ f s ) Q ( ( ε σ w 2 1 ) τ f s )
Δ P d = P d p P d = P { T 1 > ε 1 } P { T 1 > ε } = Q ( ( ε 1 σ w 2 γ 1 ) τ f s 2 γ + 1 ) Q ( ( ε σ w 2 γ 1 ) τ f s 2 γ + 1 )
For
P f ε = τ f s 2 π σ w 2 exp { 1 2 [ ( ε σ w 2 1 ) τ f s ] 2 }
P d ε = τ f s 2 π ( 2 γ + 1 ) σ w 2 exp { 1 2 [ ( ε σ w 2 γ 1 ) τ f s 2 γ + 1 ] 2 }
τ f s 2 π σ w 2 > τ f s 2 π ( 2 γ + 1 ) σ w 2
then
P f ε P d ε [ ( ε σ w 2 1 ) τ f s ] 2 [ ( ε σ w 2 γ 1 ) τ f s 2 γ + 1 ] 2 ( 2 γ + 1 ) ( ε σ w 2 1 ) 2 ( ε σ w 2 γ 1 ) 2 ( ε σ w 2 1 2 ) 2 γ 2 + 1 4 ε ( r 2 + 1 4 + 1 2 ) σ w 2
According to A(16)–(19), when ε < ( r 2 + 1 4 + 1 2 ) σ w 2 , | P f ε | > | P d ε | , which indicates that the increment of false alarm probability is higher than that of detection probability when ε < ( r 2 + 1 4 + 1 2 ) σ w 2 . Due to the fact that false alarm probability is against of sensing performance while detection probability is to the benefit of sensing performance, consequently, when ε < ( r 2 + 1 4 + 1 2 ) σ w 2 , disadvantages far outweigh its advantages in instantaneous strong noise conditions for SS with single node. □

Appendix E

Proof of Proposition 5.
According to (15) and (16), when instantaneous strong noise occurs, the detection probability and its corresponding false alarm probability will be dramatically improved for one-slot based SS. However, high false alarm probability and detection probability correspond to an increased difficulty in distinguish between the signal from PU and environment noise, which implies a great decline on sensing performance and even a failure in detecting observed spectrum bands.
For multi-slot based SS, the influence of instantaneous strong noise is balanced due to multiple time slots, especially when the time slot is large enough. In consequence, the sensing performance of multi-slot based SS has a slight decline and even remains unchanged. To sum up, the sensing performance of multi-slot based SS outperforms that of one-slot based SS when instantaneous strong noise occurs. □

References

  1. Akyildiz, I.F.; Lee, W.-Y.; Vuran, M.C.; Mohanty, S. NeXt generation/dynamic spectrum access/cognitive radio wireless networks: A survey. Comput. Netw. 2006, 50, 2127–2159. [Google Scholar] [CrossRef]
  2. McHenry, M.A. NSF Spectrum Occupancy Measurements Projects Summary; Shared Spectrum Company Report; Shared Spectrum Company: Vienna, VA, USA, 2005. [Google Scholar]
  3. Federal Communications Commission Spectrum Policy Task Force. Available online: http://www.fcc.gov/sptf/files/SEWGFinalReport_1.pdf (accessed on 9 August 2019).
  4. Haykin, S. Cognitive radio: Brain Empowered Wireless Communications. IEEE J. Selet. Area Commun. 2005, 23, 201–220. [Google Scholar] [CrossRef]
  5. Arjoune, Y.; Kaabouch, N. A Comprehensive Survey on Spectrum Sensing in Cognitive Radio Networks: Recent Advances, New Challenges, and Future Research Directions. Sensors 2019, 19, 126. [Google Scholar] [CrossRef] [PubMed]
  6. Zhang, H.; Gladisch, A.; Pickavet, M.; Tao, Z.; Mohr, W. Energy efficiency in communications. IEEE Commun. Mag. 2010, 48, 48–49. [Google Scholar] [CrossRef]
  7. Yawada, P.S.; Wei, A.J. Cyclostationary Detection Based on Non-cooperative spectrum sensing in cognitive radio network. In Proceedings of the International Conference on Cyber Technology in Automation, Control, and Intelligent Systems, Chengdu, China, 19–22 June 2016; pp. 184–187. [Google Scholar]
  8. Salahdine, F.; El Ghazi, H.; Kaabouch, N.; Fihri, W.F. Matched filter detection with dynamic threshold for cognitive radio networks. In Proceedings of the International Conference on Wireless Networks and Mobile Communications, Marrakech, Morocco, 20–23 October 2015; pp. 1–6. [Google Scholar]
  9. Kumar, K.S.; Saravanan, R.; Muthaiah, R. Cognitive Radio Spectrum Sensing Algorithms based on Eigenvalue and Covariance methods. Int. J. Eng. Technol. 2013, 5, 595–601. [Google Scholar]
  10. Guangming, N. Byzantine Defense in Collaborative Spectrum Sensing Via Bayesian Learning. IEEE Access 2017, 5, 20089–20098. [Google Scholar]
  11. Hillenbrand, J.; Weiss, T.A.; Jondral, F. Calculation of detection and false alarm probabilities in spectrum pooling systems. IEEE Commun. Lett. 2005, 9, 349–351. [Google Scholar] [CrossRef]
  12. Ghasemi, A.; Sousa, E.S. Optimization of spectrum sensing for opportunistic spectrum access in cognitive radio networks. In Proceedings of the 4th IEEE Consumer Communications Networking Conference (CCNC), Las Vegas, NV, USA, 11–13 January 2007; pp. 1022–1026. [Google Scholar]
  13. Zhang, W.; Mallik, R.; Letaief, K. Optimization of cooperative spectrum sensing with energy detection in cognitive radio networks. IEEE Trans. Wirel. Commun. 2009, 8, 5761–5766. [Google Scholar] [CrossRef]
  14. Stevenson, C.R. Functional Requirements for the 802.22 WRAN Standard. Available online: https://mentor.ieee.org/802.22/dcn/05/22-05-0007-46-0000-draft-wran-rqmts-doc.doc (accessed on 9 August 2019).
  15. Liang, Y.C.; Zeng, Y.; Peh, E.; Hoang, A.T. Sensing-Throughput Tradeoff for Cognitive Radio Networks. IEEE Trans. Wirel. Commun. 2008, 7, 5330–5335. [Google Scholar]
  16. Liu, X.; Li, F.; Na, Z. Optimal Resource Allocation in Simultaneous Cooperative Spectrum Sensing and Energy Harvesting for Multichannel Cognitive Radio. IEEE Access 2017, 5, 3801–3812. [Google Scholar] [CrossRef]
  17. Cichon, K.; Kliks, A.; Bogucka, H. Energy-Efficient Cooperative Spectrum Sensing: A Survey. IEEE Commun. Surv. Tutor. 2016, 18, 1861–1886. [Google Scholar] [CrossRef]
  18. Zhang, Y.; Yang, D.; Xue, G.; Tang, J. A Spectrum Auction under Physical Interference Model. IEEE Trans. Cogn. Commun. Netw. 2016, 3, 719–728. [Google Scholar] [CrossRef]
  19. Wu, F.; Vaidya, N.H. A Strategy-Proof Radio Spectrum Auction Mechanism in Noncooperative Wireless Networks. IEEE Trans. Mob. Comput. 2013, 12, 885–894. [Google Scholar] [CrossRef]
  20. Jin, H.; Su, L.; Chen, D.; Nahrstedt, K.; Xu, J. Quality of Information Aware Incentive Mechanisms for Mobile Crowd Sensing Systems. In Proceedings of the 16th ACM Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2015), Hangzhou, China, 22–25 June 2015. [Google Scholar]
  21. Mu, J.; Jing, X.; Xie, J.; Zhang, Y.; Xie, J. Multistage spectrum sensing scheme with SNR estimation. IET Commun. 2019, 13, 1148–1154. [Google Scholar] [CrossRef]
  22. Chaudhari, S.; Lunden, J.; Koivunen, V.; Poor, H.V. Cooperative Sensing with Imperfect Reporting Channels: Hard Decisions or Soft Decisions? IEEE Trans. Signal Process. 2012, 60, 18–28. [Google Scholar] [CrossRef]
  23. Weiss, T.; Hillenbrand, J.; Jondral, F. A Diversity Approach for the Detection of Idle Spectral Resources in Spectrum Pooling Systems; International Scientific Colloquium: Ilmenau, Germany, 2003. [Google Scholar]
  24. Visotsky, E.; Kuffner, S.; Peterson, R. On collaborative detection of TV transmissions in support of dynamic spectrum sharing. In Proceedings of the IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks, Baltimore, MD, USA, 8–11 November 2005. [Google Scholar]
  25. Mishra, S.M.; Sahai, A.; Brodersen, R. Cooperative Sensing among Cognitive Radios. In Proceedings of the IEEE ICC, Istanbul, Turkey, 11–15 June 2006. [Google Scholar]
  26. Althunibat, S.; Palacios, R.; Granelli, F. Performance Optimization of Soft and Hard Spectrum Sensing Schemes in Cognitive Radio. IEEE Commun. Lett. 2012, 16, 998–1001. [Google Scholar] [CrossRef]
  27. Peh, E.C.Y.; Liang, Y.-C.; Guan, Y.L. Optimization of Cooperative Sensing in Cognitive Radio Networks: A Sensing-Throughput Tradeoff View. IEEE Int. Conf. Commun. 2009, 58, 5294–5299. [Google Scholar]
  28. Sun, C.; Zhang, W.; Letaief, K.B. Cooperative Spectrum Sensing for Cognitive Radios under. In Proceedings of the IEEE Wireless Communications & Networking Conference, Kowloon, China, 11–15 March 2007. [Google Scholar]
  29. Qihang, P.; Kun, Z.; Jun, W.; Shaoqian, L. A distributed spectrum sensing scheme based on credibility and evidence theory in cognitive radio context. In Proceedings of the IEEE 17th International Symposium on Personal, Indoor and Mobile Radio Communications, Helsinki, Finland, 11–14 September 2006. [Google Scholar]
  30. Unnikrishnan, J.; Veeravalli, V.V. Cooperative Sensing for Primary Detection in Cognitive Radio. IEEE J. Sel. Top. Signal Process. 2008, 2, 18–27. [Google Scholar] [CrossRef]
  31. Nallagonda, S.; Sudheer, S.; Roy, S.D.; Kundu, S. Cooperative spectrum sensing with censoring of cognitive radios and improved energy detector under majority logic fusion. In Proceedings of the IEEE International Conference on Signal Processing, Hong Kong, China, 12–15 August 2012. [Google Scholar]
  32. Clement, J.C.; Reddy, B.B.; Emmanuel, D.S. An Energy-Efficient Cooperative Spectrum Sensing Strategy with Robustness Against Noise Uncertainty for Cognitive Radio Networks. Arab. J. Sci. Eng. 2016, 41, 3399–3405. [Google Scholar] [CrossRef]
  33. Chen, D.; Li, J.; Ma, J. Cooperative Spectrum Sensing under Noise Uncertainty in Cognitive Radio. In Proceedings of the International Conference on Wireless Communications, Dalian, China, 12–14 October 2008. [Google Scholar]
  34. Zhu, L.; Yao, C.; Wang, L. The Optimization of Combination Scheme in Cooperative Spectrum Sensing Based on the Practical Reporting Frame Format. Wirel. Pers. Commun. 2018, 102, 3009–3019. [Google Scholar] [CrossRef]
Figure 1. Frame structure of classical spectrum sensing (SS) schemes.
Figure 1. Frame structure of classical spectrum sensing (SS) schemes.
Sensors 19 03497 g001
Figure 2. Frame structure of multi-slot SS.
Figure 2. Frame structure of multi-slot SS.
Sensors 19 03497 g002
Figure 3. Possible conditions of multi-slot based cooperative spectrum sensing (CSS).
Figure 3. Possible conditions of multi-slot based cooperative spectrum sensing (CSS).
Sensors 19 03497 g003
Figure 4. Performance comparisons of multi-slot SS in Gaussian channel with different fusion rules respectively ((ac) are without instantaneous strong noise while (df) consider instantanous strong noise).
Figure 4. Performance comparisons of multi-slot SS in Gaussian channel with different fusion rules respectively ((ac) are without instantaneous strong noise while (df) consider instantanous strong noise).
Sensors 19 03497 g004
Figure 5. Performance comparisons of multi-slot SS in the Rice channel with different fusion rules for (ac); performance comparisons of multi-slot SS in the Rayleigh channel with different fusion rules for (df).
Figure 5. Performance comparisons of multi-slot SS in the Rice channel with different fusion rules for (ac); performance comparisons of multi-slot SS in the Rayleigh channel with different fusion rules for (df).
Sensors 19 03497 g005
Figure 6. Performance comparisons of CSS with multiple slots in the Gaussian channel (af).
Figure 6. Performance comparisons of CSS with multiple slots in the Gaussian channel (af).
Sensors 19 03497 g006
Figure 7. Throughput comparisons between the proposed scheme (decision fusion) and the classical scheme (data fusion).
Figure 7. Throughput comparisons between the proposed scheme (decision fusion) and the classical scheme (data fusion).
Sensors 19 03497 g007
Figure 8. Sensing time comparions between the proposed scheme and the classical scheme.
Figure 8. Sensing time comparions between the proposed scheme and the classical scheme.
Sensors 19 03497 g008
Table 1. Performance rank of nine fusion rules of multi-slot based CSS.
Table 1. Performance rank of nine fusion rules of multi-slot based CSS.
Performance RankFusion Approach
1MV-MV
2and-MV, MV-and, or-MV, MV-or, and-or, or-and
3and-and, or-or

Share and Cite

MDPI and ACS Style

Zhu, J.; Cao, H.; Mu, J. A Further Exploration of Multi-Slot Based Spectrum Sensing. Sensors 2019, 19, 3497. https://doi.org/10.3390/s19163497

AMA Style

Zhu J, Cao H, Mu J. A Further Exploration of Multi-Slot Based Spectrum Sensing. Sensors. 2019; 19(16):3497. https://doi.org/10.3390/s19163497

Chicago/Turabian Style

Zhu, Jia, Hongsong Cao, and Junsheng Mu. 2019. "A Further Exploration of Multi-Slot Based Spectrum Sensing" Sensors 19, no. 16: 3497. https://doi.org/10.3390/s19163497

APA Style

Zhu, J., Cao, H., & Mu, J. (2019). A Further Exploration of Multi-Slot Based Spectrum Sensing. Sensors, 19(16), 3497. https://doi.org/10.3390/s19163497

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop