Next Article in Journal
Effect of Unit-Cell Size on the Barely Visible Impact Damage in Woven Composites
Next Article in Special Issue
Towards Collaborative and Dynamic Spectrum Sharing via Interpretation of Spectrum Access Policies
Previous Article in Journal
Analytical Solutions of Model Problems for Large-Deformation Micromorphic Approach to Gradient Plasticity
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Correlation-Based Sensing Scheme for Outlier Detection in Cognitive Radio Networks

1
Department of Electronics Engineering, Korea Polytechnic University, Gyeounggi-do 15073, Korea
2
Department of Computer Science, University of Malakand, Chakdara 18800, Pakistan
3
Department of Electrical Engineering, Mirpur University of Science and Technology, Mirpur 10250, Pakistan
4
Department of System and Computer Engineering, Carleton University, Ottawa, ON K1S 5B6, Canada
*
Author to whom correspondence should be addressed.
Appl. Sci. 2021, 11(5), 2362; https://doi.org/10.3390/app11052362
Submission received: 23 December 2020 / Revised: 27 February 2021 / Accepted: 2 March 2021 / Published: 7 March 2021

Abstract

:
Cooperative spectrum sensing (CSS) is a vital part of cognitive radio networks, which ensures the existence of the primary user (PU) in the network. However, the presence of malicious users (MUs) highly degrades the performance of the system. In the proposed scheme, each secondary user (SU) reports to the fusion center (FC) with a hard decision of the sensing energy to indicate the existence of the PU. The main contribution of this work deals with MU attacks, specifically spectrum sensing data falsification (SSDF) attacks. In this paper, we propose a correlation-based approach to differentiate between the SUs and the outliers by determining the sensing of each SU, and the average value of sensing information with other SUs, to predict the SSDF attack in the system. The FC determines the abnormality of a SU by determining the similarity for each SU with the remaining SUs by following the proposed scheme and declares the SU as an outlier using the box-whisker plot. The effectiveness of the proposed scheme was demonstrated through simulations.

1. Introduction

The services provided for the rapid growth of the applications, such as computers, laptops, ipads, internet of things (IoT), etc., have increased the demand of the spectrum, which results in spectrum shortage. According to the Federal Communication Commission (FCC), most of the spectrum is underutilized, even in the crowded region, the spectrum utilization is between 15% and 85% [1]. To tackle the issue of the spectrum underutilization, cognitive radio technology (CRT) has emerged as a strong candidate for exploiting the spectrum [2]. The main functionality of CRT is to determine the availability of the spectrum for the secondary users (SUs). For achieving the spectrum availability and efficient utilization of the spectrum, the SUs need to continuously monitor the available spectrum to find the spectrum holes and vacate the spectrum whenever the primary user (PU) appears in the network [3].
The spectrum sensing is performed to determine the presence or absence of the PU in the network. Different detection techniques, such as matched filter detection, cyclo-stationary feature detection, energy detection, etc., have been proposed in the literature [4,5]. Every detection technique has their own features. For example, feature detection is optimal, when the PU information is available at the SU. When the SU has no prior information about the PU, then the energy detection technique is the optimal detection technique. The SU has only knowledge about the local noise power. The received signal energy is utilized to decide about the existence of the PU in the network.
Various techniques are used to efficiently utilize the scarce spectrum by merging the underlay and overlay methods in hybrid cognitive radio networks [6]. However, spectrum sensing is highly vulnerable to fading and hidden terminal problems between the PU and the SUs [7,8]. Thus, the decision of the spectrum sensing performed by a single SU is neither sufficient nor reliable for final decision about the presence of the PU in the network. To overcome the problem of the single SU sensing, researchers take advantages of cooperative spectrum sensing (CSS) for the enhancement of spectrum sensing. In CSS, each single SU gathers information about the PU channel, and shares its local sensing information with the FC, which accumulates the sensing information from the SUs and declares the global decision about the presence of the PU in the network [9,10]. In CSS, the SUs send information to the FC in two ways. In the first scenario, the SU sends a single bit of information to the FC, which is also known as the hard-decision rule. In the second scenario, which is called the soft combination rule, the SU sends a sampled energy value to the FC [11,12].
However, the existence of malicious users (MUs), or outliers, in the network highly degrades the performance of CSS. Various attacks, which highly degrade the performance of the networks, have been studied in the literature. Two common attacks are primary user emulation attacks (PUEAs) and spectrum sensing data falsification (SSDF) attacks [13,14]. In SSDF attacks, the MUs falsify the sensing results, which influences the sensing results in two ways. First, it decreases the probability of detection, which ultimately decreases the spectrum utilization. Second, it increases the probability of misdetection and the probability of false alarm, which increases interference in the network. Thus, overall performance of CSS is degraded by the SSDF attacks. To mitigate the effects of these attacks, several schemes have been proposed [15,16,17]. In Reference [18], the impact of incorrect information of the sensing system was formulated as detection performance and sensing efficiency; additionally, an authentication code length was proposed to reduce the system overhead. The authors of [19] proposed a MU suppression scheme, which consists of an improved energy detector followed by a statistical algorithm implemented at the FC. The authors of [20] proposed a neighbor detection-based spectrum sensing algorithm in distributed CRNs, which detects attackers with the help of neighbors during spectrum sensing to improve the decision-making accuracy. In this algorithm, the extreme outliers are isolated in the cognitive radio ad hoc network via the modified Z-test, and then the q-out-of-m rule is implemented to mitigate the SSDF attack [21]. Similarly, the authors integrated the reputation and q-out-of-m rule mechanism to mitigate the effect of the SSDF attack [22,23]. The authors of [24] utilized a k-medoids clustering algorithm to mine the collection of sensing reports at the FC to determine the attacker’s presence; additionally, the proposed scheme can be utilized on streaming data (sensing reports), and thereby detects and isolates the attackers existing in the networks. The intelligent MUs were accurately detected by the authors of [25], who used a physical-layer network coding scheme based on a novel scheme friend or foe (FOF) detection. A cross-layered approach was presented to make the SU able to differentiate between the PU and MU through the hidden Markov model at the medium access control (MAC) layer [26]. The authors of [27] took advantage of the compressive sensing to detect the attack and defensive behavior and proposed a density-based MU detection with the trusted user to distinguish the MU precisely. A robust defense strategy against the MUs via double-sided neighbor distance-based genetic algorithm was presented in order to filter out the MU sensing reports in CSS [28]. The authors of [29] proposed a novel attacker identification algorithm that is able to skillfully detect attackers and reject their reported results. Moreover, a novel attacker punishment algorithm was provided with the aim of punishing attackers by lowering their individual energy efficiency, motivating them to quit sending false results. A comparative analysis of different outlier techniques was proposed by the authors of [30]. Similarly, a comparative analysis of the various outlier method for the MUs was discussed by the authors of [31]. The authors of [32] assigned a reputation value to the SU, while ignoring the SUs having a reputation below a threshold value. An extended sequential CSS scheme was proposed based on the value of each SU [33]. A critical analysis of the MU attack, i.e., always yes, always no, and random attack, was studied by the authors of [34]. An onion peeling approach based on the calculation of suspicious levels was proposed by the authors of [35], which used belief propagation as the detection method. Protection of the CSS method, mentioned by the authors of [32], was reduced in the case of a large number of MUs.
In this paper, we propose a correlation-based scheme at the FC to detect the outlier and its behavior. In the proposed scheme, the FC first collects sensing information from all individual SUs, and then applies the correlation tool in the difference of the result of each SU, with the collective sensing results of all the SUs. The proposed scheme at the FC detects the results of the normal SUs, which are dissimilar from those of the MUs. In the proposed scheme, the box-whisker plot is utilized to classify the outlier and normal SUs. The box-whisker plot defines the upper and lower quartile limits of the normal SUs. Through the proposed scheme, the outlier and normal SUs are classified. The proposed scheme is tested for the existence of opposite malicious users (OMUs) and random opposite malicious users (ROMUs). The OMUs always send a high-energy signal when the PU is absent and a low-energy signal when PU is present. The ROMU is more dangerous and difficult to cope with. The ROMU’s behavior is unpredictable, it behaves as a normal SU, while appearing as MU with opposite behavior at random intervals of time. Unlike always yes and always no, both the OMU and ROMU increase the probability of a false alarm and misdetection, which both degrades the bandwidth utilization and increases the interference to the PU network. Through the simulation study, we demonstrated that the proposed scheme can successfully classify the response of both OMUs and ROMUs from the normal SUs in a delicate manner.
The remaining sections of this paper are organized as follows. In Section 2, a detailed description of the system model is presented. In Section 3, we discuss the proposed scheme and describe the steps required for the classification of the outlier from the normal users. The performance evaluation and discussion are presented in Section 4. Finally, the paper is concluded in Section 5.

2. System Model

We considered a cooperative spectrum sensing scenario in a cognitive radio network. We assumed that the total number of outliers/MUs in the network was less than the total number of normal SUs. The system model for the proposed scheme is shown in Figure 1. The SUs performed spectrum sensing and sent the report to the FC, for the presence of the PU in the network. The SUs forwarded a hard-binary decision 1 if the spectrum was occupied by the PU, and -1 if the spectrum was not occupied by the PU. The FC received the local sensing reports from all SUs. The FC then employed the proposed scheme on these reports to identify the SU as an outlier on the basis of the history of each SU energy report. Once the outliers were identified and removed, the FC then employed a simple rule to declare a global decision about the presence of the PU in the network.
The information received at the receiver SU in a particular band for the presence or absence of the PU was represented as a binary hypothesis given as
y j ( l ) = { n j ( l ) ;   H 0 h j s ( l ) + n j ( l ) ;   H 1   ,
where H 0 is the absence hypothesis, H 1 represents the presence hypothesis of the PU in the network, y j ( l ) shows the received signal from the j th SU, n j ( l ) is the additive white Gaussian noise (AWGN) in the l th time slot for the j th SU, s ( l ) is the signal transmitted by the PU, and h j is the channel gain value between the PU and the SU in the l th time slot.
According to the hypotheses H 0 and H 1 , the received signal energy of the channel by the j th SU at the i th sensing interval is
E j ( i ) = { l = l i l i + K 1 | n j ( l ) | 2 ;   H 0 l = l i l i + K 1 | h j s ( l ) + n j ( l ) | 2 ;   H 1   ,
where K denotes the number of samples in the i th sensing interval. According to central limit theorem (CLT), when the value of K is large enough, then the energy reported by each SU converges to a Gaussian random variable under H 0 and H 1 , which can be formulated as [28]:
E j ~ { N ( μ 0 = K , σ 2 0 = 2 K ) ;   H 0 N ( μ 1 = K ( η j + 1 ) , σ 2 1 = 2 K ( η j + 1 ) ) ;   H 1   ,
where η j is the signal-to-noise ratio (SNR) between the j th SU and the PU, ( μ 0 , σ 2 0 ) is the mean and variance under H 0 , and ( μ 1 , σ 2 1 ) are the mean and variance under H 1 .

3. Proposed Scheme

In this paper, we proposed a correlation-based approach to identify the legitimate SUs and outliers. The box-whisker plot was introduced to classify the legitimate SUs from the outliers. In the proposed scheme, each SU senses the spectrum by utilizing the energy-detection technique and compares the received signal strength with a threshold value. On the basis of the sensing results, the SUs send a hard decision of 1 or −1 to the FC, which can be given as
Z j ( i ) = { 1 ;   i f   E j ( i ) γ j 1 ;   O t h e r w i s e   ,
where E j ( i ) is the energy received by the j th SU in the i th sensing interval, γ j is the value of the threshold set for the j th SU, and Z j ( i ) is the j th SU decision of the PU signal in the i th sensing interval, representing 1 if the E j ( i ) is greater than the threshold value and −1 if energy of the received signal E j ( i ) is smaller than the threshold value. The FC collects spectrum sensing information of the individual SU results with its own local decision as
Z = [ z 11 z 12 z 13 z 14 z 1 M z 21 z 22 z 23 z 24 z 2 M z 31 z 32 z 33 z 34 z 3 M z N 1 z N 2 z N 3 z N 4 z N M ]   ,
where Z represents the sensing energy accumulated in the database of the FC by all the SUs’ hard-decision values. In Equation (5), the rows represent the sensing intervals, and the columns represent the SUs’ energy responses under each sensing interval. M denotes the total number of SUs including the normal SUs, the outlier/MU, and the FC information, and N is the number of sensing intervals. Furthermore, correlation was used as a tool for the detection of the most harmful and difficult detect OMU and ROMU users.
The correlation coefficients for the two samples X and Y can be determined as
r X Y = r X Y = p ( X p X ¯ ) ( Y p Y ¯ ) p ( X p X ¯ ) 2 ( Y p Y ¯ ) 2   , 1 r X Y + 1
where X ¯ = p = 1 N X p N and Y ¯ = p = 1 N Y p N are the mean values of the samples X and Y, respectively, and X p and Y p are the p th elements of samples X and Y, respectively. Equation (6) shows that the correlation of variable X taken with Y is the same as the correlation of Y taken with X.
Correlation is a statistical exercise that shows how intensely the pair of testers are related to each other. Equation (6) shows the value of r from −1, when both variables are in the opposite direction with a perfect negative correlation, to +1, when both variables are in the same direction with a perfect positive correlation. Effective use of this correlation process is a good measure of the relationship between the two variables when there is a chance of outliers, no normality, no steady variance, and nonlinearity existing between the two variables that are being examined.

3.1. Outlier Detection

All SUs send their sensing reports to the FC as shown in Equation (5). At the FC, a relationship is verified by comparing each SU’s sensing decision with the other SUs, to determine any abnormal SU, which sends spectrum sensing falsification data to the FC. The FC is able to easily identify the both the OMU and ROMU category of outliers/MUs by the following three steps.

3.1.1. Step One: Averaging Differences of the SUs

In this step, the FC determines the difference in the sensing results of the j th SU with the rest of the SUs. First, the average of all the SUs’ sensing decisions is calculated by neglecting the j th SU’s sensing result in the i th sensing interval to find the impact of excluding this particular SU in the overall sensing result. The same process is performed for all the M SUs during each N th sensing interval to find the average of each SU in the FC, determined as
M = [ m 11 m 12 m 13 m 14 m 1 M m 21 m 2 , 2 m 23 m 24 m 2 M m 31 m 32 m 33 m 34 m 3 M m N 1 m N 2 m N 3 m N 4 m N M   ]       ,     M = [ m i j ] w h e r e     m i j = { ( j = 1 M z i , j ) z i j M 1 }
where M is the total number of SUs, N is the number of sensing intervals, m i j is the average value of the energy reports from all the other SUs in the i th sensing interval while ignoring the j th SU result. As the energy responses of both the OMU and ROMU are different from the rest, taking such outliers/MUs out of the average value calculation during each sensing interval by the FC generates a dissimilar result for the OMU and ROMU users compared with the normal SUs.
In order to estimate how much the individual sensing results of each SU, z i j , are behaving differently from the average value of other users’ results, m i j , we considered the following
Δ d i j = z i j m i j Δ d i j = [ Δ d 11 Δ d 12 Δ d 1 M Δ d 21 Δ d 22 Δ d 2 M Δ d N 1 Δ d N 2 Δ d N M ]     ,
where Δ d i j is the difference in the sensing results of the j th SU in the i th sensing interval, z i j is the individual sensing result of the j th SU in the i th sensing interval, and m i j is the average sensing result of the SUs other than the j th SU.

3.1.2. Step Two: SUs’ Correlation

The FC measures the difference value of each SU with the rest of the SUs as in Equation (8). Once the difference between the SUs was determined, we utilized the correlation tool defined in Equation (6) for all SUs, which is measured as
r r Δ d j Δ d k = r Δ d k Δ d j = i = 1 N ( Δ d i j Δ d j ¯ ) ( Δ d i k Δ d k ¯ ) i = 1 N ( Δ d i j Δ d j ¯ ) 2 i = 1 N ( Δ d i k Δ d k ¯ ) 2   ,
where Δ d i j and Δ d i k are elements of the j th and k th user sample in the i th sensing interval, and Δ d j ¯ and Δ d k ¯ are the mean values calculated for the j th and k th SU samples.
C = [ S U 1 S U M S U 1 r Δ d 1 Δ d 1 r Δ d 1 Δ d M S U M r Δ d M Δ d 1 r Δ d M Δ d 2 ] .
The data of the normal SUs are separated from those of the outliers or MUs by adding all the correlation differences in (10) for each SU as follows.
C i j =   [ i = 1 M r Δ d i Δ d 1   i = 1 M r Δ d i Δ d 2   i = 1 M r Δ d i Δ d 3   i = 1 M r Δ d i Δ d 4   i = 1 M r Δ d i Δ d M ]   .
Based on the results of Equation (10), the OMU had more negative values, followed by the ROMU, when compared with normal SUs. From Equation (10), the behaviors of all three categories of SUs, i.e., normal SUs, OMUs, and ROMUs, were identified. These behaviors identify the outliers in the network. These outlier values were further identified and classified in step three of the proposed scheme.

3.1.3. Step Three: Outlier Classification Using the Box-Whisker Plot

In the proposed scheme, we utilized the box-whisker plot to find both the OMU and the ROMU as outliers in the result of Equation (11). A box-whisker plot divides Equation (11) into four parts. First, the results are made in order form and they are divided into an upper and lower half by the median. The median of the lower half is named as the lower quartile, while the median of the upper half is stated as the upper quartile. The lower and upper extremes are marked as the least and greatest values of the results. All the SUs’ results of step two were arranged in ascending order from the lowest to the highest. The median value of the results can be calculated as M e d = m e d i a n ( C ) . The first quartile is denoted as Q 1 L o w e r , which implies the value at the 25th percentile of C. The third quartile is also calculated as Q 3 L o w e r , which implies the value at the 75th percentile of C, and thus, the inter-quartile value is determined by I Q R = Q 3 L o w e r Q 1 L o w e r . The upper and the lower limits of the box-whisker plot were measured and marked for detection of the outlier values as follows:
L o w e r   L i m i t = Q 1 L o w e r 1.5 I Q R .
U p p e r   L i m i t = Q 3 L o w e r + 1.5 I Q R .
Once the lower and the upper quartile limits were defined by the box-whisker plot by Equation (12) and Equation (13), an SU was declared as one of the outliers, i.e., OMU or ROMU, on the basis of the following criteria:
S U j = { M U ,   ; i f U p p e r   l i m i t   D a t a L o w e r   L i m i t N o r m a l   S U   ; O t h e r w i s e ,
Since the outliers have different responses in Equation (11) than the normal SUs, they are classified as outliers with Equation (14). The overall flow chart of the proposed scheme is shown in Figure 2.

4. Numerical Evaluation

In this section, we numerically evaluate the performance of the proposed scheme considering the parameters given in Table 1.
To verify the effectiveness of the proposed scheme, we considered three scenarios. In the first scenario, we considered the only existence of the OMU with the normal SUs in the network. The OMUs are very sensitive to the performance of the network. Figure 3 shows the simulation results when the outlier behaves as an OMU. It can be observed that the normal SUs lie in the range of the lower and the upper quartile limits defined by the box-whisker plot, whereas the OMU lies outside the limits. These lower and upper quartiles define the boundary of the normal SUs in the network. Table 2 presents the values of the SNRs, the quartile, IQR and the lower and the upper quartile limits of the SUs in the network.
In the second scenario, we considered only the existence of the ROMU and the normal SUs in the network. The ROMU behaves randomly with the probability p and appears as a normal SU with the probability 1-p. Figure 4 shows the simulation results in this scenario. The upper and lower quartile limits are defined in Table 3. It can be shown from Figure 4 that the box-whisker plot defines the limits of the lower and upper quartiles for the normal SUs and the proposed scheme can easily classify the normal SUs in this limit, whereas the ROMU response is different from the normal SUs, and easily identified in the system, which shows the effectiveness of the proposed scheme.
In the third scenario, we considered the existence of both the OMU and ROMU in the network. Table 4 defines the upper and the lower quartile limits for the normal SUs. Figure 5 shows the simulation results, when both the OMU and the ROMU are equally distributed. From Figure 5, we can observe that the normal SUs lie within the range of the upper and lower limits, whereas the OMU and ROMU are not in the range of the limits set by the box-whisker plot. Figure 5 shows that the detection results of the OMU were more negative compared to the ROMU. The ROMU behavior was closer to that of the normal SUs and more sensitive care was required for the detection of such outliers or of the MUs.
In Figure 6, we show the receiver operator characteristics (ROC) comparison of the proposed scheme with other existing schemes when the MU was present in the network, and when the MU did not exist in the network. Figure 6 demonstrates that when no scheme was applied, the probability of detection decreased and the probability of false alarm and probability of misdetection increased. Furthermore, when the proposed scheme was applied in the presence of MU, the performance was better than other existing schemes.
Tabular and graphical results show that the proposed scheme was effective in detecting the outliers or MUs in CSS environments. The proposed scheme had the ability to identify and classify both types of outliers, i.e., the OMU and the ROMU. By utilizing the box-whisker plot, an SU was classified as an outlier by the FC if its result lay above the upper quartile limit or below the lower quartile limit. Through the simulation results, we have shown that the proposed scheme can easily detect the outlier of OMU and ROMU in nature.

5. Conclusions

SSDF attacks severely degrade the performance of CRNs. In this paper, we proposed a correlation-based approach using the box-whisker plot for the detection of outliers in the networks. In the proposed scheme, we considered the hard decision of each SU, and the FC utilized correlation tools and calculated the correlation for finding the similarity of the sensing results of the SUs and outliers. By utilizing the correlation-based approach, we easily classified the outlier among the normal SUs. The outliers were further classified by using the box-whisker plot. The box-whisker plot defined the lower and upper quartile limits for the SUs. Finally, the normal user lay within the range, so the outliers were easily classified from the normal SUs. Through intensive simulation studies, we verified that the proposed scheme has the ability to classify the OMU and ROMU outliers in CRNs.

Author Contributions

All authors conceived and proposed the research idea. M.S.K. and M.F. designed the scenario; M.S.K. and S.A. performed the simulation results; M.S.-H. and S.M.K. analyzed the simulation results; M.S.K. and S.A. wrote the paper under the supervision of M.S.-H., S.M.K., and J.K. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported in part by the Ministry of Science and ICT (MIST), Korea, under the Information Technology Research Center (ITRC) support Program (IITP-2020-2018-0-01426) supervised by the IITP Institute for Information and Communication Technology Planning and Evaluation (IITP), and in part by the National Research Foundation (NRF), and funded by the Korea Government (MIT) (no.2019R1F1A1059125).

Data Availability Statement

The data used to support the finding of this study are included within article.

Acknowledgments

This work was supported in part by the Ministry of Science and ICT (MIST), Korea, under the Information Technology Research Center (ITRC) support Program (IITP-2020-2018-0-01426) supervised by the IITP Institute for Information and Communication Technology Planning and Evaluation (IITP), and in part by the National Research Foundation (NRF), and funded by the Korea Government (MIT) (no.2019R1F1A1059125).

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. FCC. Spectrum Policy Task Force (ET Docket no. 02-135); Federal Communications Commission: Washington DC, USA, 2002. [Google Scholar]
  2. Hayken, S. Cognitive Radio, Brain-Empowered Wireless Communications. IEEE J. Sel. Area Commun. 2005, 23, 201–220. [Google Scholar] [CrossRef]
  3. Ghasemi, A.; Sousa, E.S. Spectrum Sensing in Cognitive Radio Networks. IEEE Commun. Mag. 2008, 46, 32–39. [Google Scholar] [CrossRef]
  4. Simon Haykin, D.J.T.; Reed, J.H. Spectrum Sensing for Cognitive Radio. Proc. IEEE 2009, 97, 849–877. [Google Scholar]
  5. Sahal, A.; Hoven, N.; Tandra, R. Some Fundamental Limits in Cognitive Radio. In Proceedings of the Allerton Conference on Communication, Control, and Computing, Monticello, IL, USA, September 29–October 1 2004. [Google Scholar]
  6. Kaur, R.; Buttar, A.S.; Jayant, A. Methods of Hybrid Cognitive Radio Network: A Survey. In Proceedings of the Electronics, Communication and Aerospace Technology (ICECA), Coimbatore, India, 29–31 March 2018. [Google Scholar]
  7. Tandra, A.; Sahai, A. Fundamental Limits on Detection in Low SNR under Noise Uncertainty. In Proceedings of the Wireless Networks Communication and Mobile Computing, Maui, HI, USA, 13–16 June 2005. [Google Scholar]
  8. Cabric, D.; Mishra, S.M.; Brodersen, R.W. Implementation Issues in Spectrum Sensing for Cognitive Radios. In Proceedings of the 38th Asilomar Conference on Signals, Systems and Computers, Pacific Grove, CA, USA, 7–10 November 2004; pp. 772–776. [Google Scholar]
  9. Letaief, K.B.; Zhang, W. Cooperative Communications for Cognitive Radio Networks. Proc. IEEE 2009, 97, 878–893. [Google Scholar] [CrossRef] [Green Version]
  10. Mishra, S.M.; Sahai, A.; Bridersen, R.W. Cooperative Sensing Among Cognitive Radios. In Proceedings of the Conference CC’06, 2006 International Conference on Communications, Istanbul, Turkey, 11–15 June 2006; pp. 1658–1663. [Google Scholar]
  11. Peh, E.; Liang, Y.C. Optimization for Cooperative Sensing in Cognitive Radio Networks. In Proceedings of the Wireless Communication and Wireless Network, Hong Kong, China, 11–15 March 2007; pp. 27–32. [Google Scholar]
  12. Muhammad, S.K.; Noor, G.; Junsu, K.; Ijaz, M.Q.; Su Min, K. A Genetic Algorithm Based Soft Decision Fusion Scheme in Cognitive IoT Networks with Malicious Users. Wirel. Commun. Mob. Comput. 2020, 2020, 2509081. [Google Scholar]
  13. Marinho, J.; Granjal, J.; Monterio, E. A Survey on Security Attacks and Counter Measures with Primary User Detection in Cognitive Radio Networks. EURASIP J. Inf. Secur. 2015, 15, 4. [Google Scholar] [CrossRef] [Green Version]
  14. Muhammad, S.K.; Jibran, M.; Insoo, K.; Su Min, K.; Junsu, K. A Double Adaptive Approach to Tackle Malicious Users in Cognitive Radio Networks. Wirel. Commun. Mob. Comput. 2019, 2019, 2350694. [Google Scholar]
  15. Sarala, B.; Devi, S.R.; Suganthy, M.; Ida, S.J. A Novel Authentication Mechanism for Cognitive Radio Networks. Int. J. Recent Technol. Eng. 2019, 8, 713–718. [Google Scholar]
  16. Wan, R.; Ding, L.; Xiong, N.; Zhou, X. Mitigation Strategy against Spectrum Sensing Data Falsification Attack in Cognitive Radio Sensor Networks. Int. J. Distrib. Sens. Netw. 2019, 9, 1–12. [Google Scholar] [CrossRef]
  17. Farmani, F.; Jannatabad, M.A.; Berangi, R. Detection of SSDF Attack using SVDD Algorithm in Cognitive Radio Networks. In Proceedings of the 2011 Third International Conference on Computational Intelligence, Communication Systems and Networks, Bali, Indonesia, 26–28 July 2011. [Google Scholar]
  18. Liu, S.Q.; Hu, B.J. Analysis of Sensing Efficiency for Cooperative Spectrum Sensing with Malicious Users in Cognitive Radio Networks. IEEE Commun. Lett. 2014, 18, 1645–1648. [Google Scholar] [CrossRef]
  19. Lavanis, N. Improving Detection of Primary User in Cognitive Radio Networks with Malicious User. In Proceedings of the Wireless Communication, Signal Processing and Networking (WiSPNET), Chennai, India, 23–25 March 2016. [Google Scholar]
  20. Pei, Q.; Li, H.; Liu, X. Neighbor Detection-Based Spectrum Sensing Algorithm in Distributed Cognitive Radio Network. Chin. J. Electron. 2017, 26, 399–406. [Google Scholar] [CrossRef]
  21. Ngomane, I.; Velempini, M.; Dlamini, S.V. The Detection of Spectrum Sensing Data Falsification Attacks in Cognitive Radio Ad hoc Networks. In Proceedings of the Information Communication Technology and Society (ICTAS), Durban, South Africa, 8–9 March 2018. [Google Scholar]
  22. Ngomane, I.; Velempini, M.; Dlamini, S.V. Trust Based System to Defend Against the Spectrum Sensing Data Falsification Attack in Cognitive Radio Ad hoc Network. In Proceedings of the Advances in Big Data, Computing and Data Communication Systems (icABCD), Durban, South Africa, 6–7 August 2018. [Google Scholar]
  23. Ngomane, I.; Velempini, M.; Dlamini, S.V. The Design of a Defense Mechanism to Mitigate the Spectrum Sensing Data Falsification Attack in Cognitive Radio Ad hoc Network. In Proceedings of the Advances in Computing and Communication Engineering (ICACCE), Durban, South Africa, 8–29 November 2016. [Google Scholar]
  24. Nath, S.; Marchang, N.; Taggu, A. Mitigating SSDF Attack using K-Mediods Clustering in Cognitive Radio Networks. In Proceedings of the Wireless and Mobile Computing, Networking and Communication (WiMob), Abu Dhabi, United Arab Emirates, 19–21 October 2015. [Google Scholar]
  25. Sabuj, S.R.; Hamanura, M.; Kuwamura, S. Detection of Malicious User in Cognitive Radio Network by using Friend or Foe (FOF) Detection Technique. In Proceedings of the Telecommunication Network and Application Conference (ITNAC), Sydney, Australia, 18–20 November 2015. [Google Scholar]
  26. Aisha, A.U.; Qadir, J.; Baig, A. Mitigating the Effect of Malicious Users in Cognitive Radio Networks. In Proceedings of the 11th Frontier of Information Technology, Islamabad, Pakistan, 16–18 December 2013. [Google Scholar]
  27. Wu, H.; Sun, X.; Guo, C.; Ren, S. Malicious User Detection for Wide-Band Cognitive Radio Network. In Proceedings of the Asia Pacific Microwave Conference (APMC), New Delhi, India, 5–9 December 2016. [Google Scholar]
  28. Noor, G.; Muhammad, S.K.; Junsu, K.; Su Min, K. Robust Spectrum Sensing via Double Sided Neighbor Distance Based Genetic Algorithm in Cognitive Radio Networks. Mob. Inf. Syst. 2020, 2020, 8876824. [Google Scholar]
  29. Althunibat, S.; Denise, B.J.; Granelli, F. Identification and Punishment Policies for Spectrum Sensing Data Falsification Attacker Using Delivery-Based Assessment. Trans. Veh. Technol. 2016, 65, 7308–7321. [Google Scholar] [CrossRef]
  30. Arshad, A.; Muhammad, S.K.; Noor, G.; Irfan, U.; Su Min, K.; Junsu, K. A Comparative Analysis of Different Outlier Detection Techniques in Cognitive Radio Networks with Malicious Users. Wirel. Commun. Mob. Comput. 2020, 2020, 8832191. [Google Scholar]
  31. Kalamkar, S.S.; Singh, P.K.; Banerjee, A. Block Outlier Methods for Malicious User Detection in Cooperative Spectrum Sensing. In Proceedings of the 79th Vehicular Technology Conference (VTC Spring), Seoul, Korea, 18–21 May 2014. [Google Scholar]
  32. Zeng, K.; Pawelczak, P.; Cabric, D. Reputation Based Cooperative Spectrum Sensing with Trusted Node Assistance. Commun. Lett. 2008, 14, 226–228. [Google Scholar] [CrossRef]
  33. Vu Van Hiep, I.K. A Sequential Cooperative Spectrum Sensing Scheme Based on Cognitive User Reputation. Trans. Consum. Electron. 2012, 58, 1147–1152. [Google Scholar] [CrossRef]
  34. Sajjad, K.M.; Insoo, K. Mitigation Adverse Effect of Malicious User on Cooperative Spectrum Sensing by Using Hausdorff Distance in Cognitive Radio Networks. J. Inf. Commun. Converg. Eng. 2015, 13, 74–80. [Google Scholar]
  35. Penna, F.; Sun, Y.; Dolecek, L.; Cabric, D. Detecting and Couter-Acting Statistical Attacks in Cooperative Spectrum Sensing. Trans. Signal Process 2012, 60, 1806–1822. [Google Scholar] [CrossRef]
Figure 1. System model.
Figure 1. System model.
Applsci 11 02362 g001
Figure 2. Flow chart of the proposed scheme.
Figure 2. Flow chart of the proposed scheme.
Applsci 11 02362 g002
Figure 3. Correlation vs. signal-to-noise ratio (SNR), when an opposite malicious user (OMU) exists in the network.
Figure 3. Correlation vs. signal-to-noise ratio (SNR), when an opposite malicious user (OMU) exists in the network.
Applsci 11 02362 g003
Figure 4. Correlation vs. SNR, when a random opposite malicious user (ROMU) exists in the network.
Figure 4. Correlation vs. SNR, when a random opposite malicious user (ROMU) exists in the network.
Applsci 11 02362 g004
Figure 5. Correlation vs. SNR, when both the OMUs and ROMUs exist in the network.
Figure 5. Correlation vs. SNR, when both the OMUs and ROMUs exist in the network.
Applsci 11 02362 g005
Figure 6. ROC curve of the proposed in comparison with other schemes.
Figure 6. ROC curve of the proposed in comparison with other schemes.
Applsci 11 02362 g006
Table 1. Simulation parameters.
Table 1. Simulation parameters.
ParametersValues
Number of SUs10
Number of OMUs1
Number of ROMUs1
Signal-to-noise ratio (SNR) [dB]−30 to −20
Number of iteration10,000
Samples in each sensing interval270
Sensing time1 ms
Table 2. Box-whisker plot data of the correlation results under OMU users only.
Table 2. Box-whisker plot data of the correlation results under OMU users only.
SNR (dB)MinQ1MedianQ3MaxIQRLower LimitUpper Limit
−30−0.118720.0279230.0297330.0335750.0366730.0056520.0194450.042053
−28−0.113680.0244310.0290030.0326030.0386830.0081720.0121720.044861
−26−0.11430.0237460.0262740.0338840.0437670.0101390.0085380.049092
−24−0.135410.0284920.0358670.0407770.0412550.0122850.0100630.059205
−22−0.144290.033970.0400210.0425470.0454570.0085770.0211040.055413
−20−0.176510.041330.0486430.0525370.0619660.0112060.0245210.069346
Table 3. Box-whisker plot data of the correlation results under ROMU users only.
Table 3. Box-whisker plot data of the correlation results under ROMU users only.
SNR (dB)MinQ1MedianQ3MaxIQRLower LimitUpper Limit
−30−0.042040.0046870.007710.0132850.0201430.008598−0.008210.026181
−28−0.041860.0063070.0094280.0117560.0163410.005449−0.001870.019929
−26−0.050410.0039670.0109620.015450.0215640.011483−0.013260.032674
−24−0.04990.010260.011730.0137420.0185650.0034820.0050360.018966
−22−0.057220.0076030.0134480.0171240.0228180.009521−0.006680.031406
−20−0.067260.0095890.0175550.0196180.0214690.010028−0.005450.03466
Table 4. Box-whisker plot data of the correlation results under both OMU and ROMU users.
Table 4. Box-whisker plot data of the correlation results under both OMU and ROMU users.
SNR (dB)MinQ1MedianQ3MaxIQRLower LimitUpper Limit
−30−0.12330.015591830.020970.0238472490.0259818880.0082550.0032090.03623
−28−0.124180.015025660.020490.0229283770.033197150.0079030.0031720.034782
−26−0.129670.017672620.022250.02641050.0296085830.0087380.0045660.039517
−24−0.146050.024194450.025660.0305217570.0319952210.0063270.0147030.040013
−22−0.151550.016004660.027090.0316611850.0357775660.015657−0.007480.055146
−20−0.17680.03009240.032880.0333821780.0384341050.003290.0251580.038317
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Khan, M.S.; Faisal, M.; Kim, S.M.; Ahmed, S.; St-Hilaire, M.; Kim, J. A Correlation-Based Sensing Scheme for Outlier Detection in Cognitive Radio Networks. Appl. Sci. 2021, 11, 2362. https://doi.org/10.3390/app11052362

AMA Style

Khan MS, Faisal M, Kim SM, Ahmed S, St-Hilaire M, Kim J. A Correlation-Based Sensing Scheme for Outlier Detection in Cognitive Radio Networks. Applied Sciences. 2021; 11(5):2362. https://doi.org/10.3390/app11052362

Chicago/Turabian Style

Khan, Muhammad Sajjad, Mohammad Faisal, Su Min Kim, Saeed Ahmed, Marc St-Hilaire, and Junsu Kim. 2021. "A Correlation-Based Sensing Scheme for Outlier Detection in Cognitive Radio Networks" Applied Sciences 11, no. 5: 2362. https://doi.org/10.3390/app11052362

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