 Research
 Open Access
 Published:
A cooperative spectrum sensing method based on information geometry and fuzzy cmeans clustering algorithm
EURASIP Journal on Wireless Communications and Networking volume 2019, Article number: 17 (2019)
Abstract
To improve spectrum sensing performance, a cooperative spectrum sensing method based on information geometry and fuzzy cmeans clustering algorithm is proposed in this paper. In the process of signal feature extraction, a feature extraction method combining decomposition, recombination, and information geometry is proposed. First, to improve the spectrum sensing performance when the number of cooperative secondary users is small, the signals collected by the secondary users are split and reorganized, thereby logically increasing the number of cooperative secondary users. Then, in order to visually analyze the signal detection problem, the information geometry theory is used to map the split and recombine signals onto the manifold, thereby transforming the signal detection problem into a geometric problem. Further, use geometric tools to extract the corresponding statistical characteristics of the signal. Finally, according to the extracted features, the appropriate classifier is trained by the fuzzy cmeans clustering algorithm and used for spectrum sensing, thus avoiding complex threshold derivation. In the simulation results and performance analysis section, the experimental results were further analyzed, and the results show that the proposed method can effectively improve the spectrum sensing performance.
Introduction
With the development of wireless communication, spectrum resources have become increasingly scarce, but most of the existing spectrum resources have not been fully utilized. Cognitive radio (CR) technology allows secondary users (SUs) to access the spectrum when the authorized primary user (PU) is idle, thus effectively alleviating the spectrum scarcity problem [1]. In CR, spectrum sensing is a key step that is mainly used to sense the existence of the PU [2].
Related work
Classical spectrum sensing methods include energy detection, matched filter detection, and cyclic eigenvalue detection [3]. As the simplest spectrum sensing algorithm, energy detection has low computational complexity and does not require prior information from the PU. Therefore, this method has been widely used. However, the algorithm is susceptible to noise uncertainty, which will greatly reduce detection performance [4, 5]. Matching filter detection is the optimal signal detection algorithm when all the information of the PU is known. However, the disadvantages of this method are also very obvious, because it requires prior knowledge of the PU that include the packet format and sequence, and the modulation type [6, 7]. The calculation of cyclic eigenvalue detection is relatively complicated, so it cannot be detected in real time; therefore, rapid detection is not possible [8].
The application of random matrix theory to spectrum sensing has attracted the interest of many researchers [9, 10]. By acquiring the sensing data of multiple SUs and composing the sampling signal matrix, and then calculating the covariance matrix, the corresponding eigenvalue is finally calculated as the decision statistic. Nowadays, many cooperative spectrum sensing algorithms based on random matrices have been proposed. Liu et al. proposed a maximum to minimum eigenvalue (MME) spectrum sensing method. The modified method uses the extracted MME feature value as a statistical feature of the signal and compares with a preset threshold to determine whether the PU exists [11]. However, when the number of sampling points is insufficient, the detection performance is obviously degraded. Liu et al. proposed a spectrum sensing method for the difference between the maximum eigenvalue and the average energy (DMEAE). The method uses the DMEAE feature as a statistical feature of the signal and then compares it with a preset threshold to achieve spectrum sensing [12]. Tulino et al. proposed a spectrum sensing method based on the difference between the maximum eigenvalue and the minimum feature (DMM) [13]. Similar to the above method, the DMM feature is also used as a statistical feature, and spectrum sensing is implemented by comparing with a preset threshold. However, this method has poor perceived performance when the number of cooperative SUs is small and the signaltonoise ratio (SNR) is low. A statistical feature extraction method based on decomposition and recombination (DAR) is proposed. To logically increase the number of cooperative users, the method firstly splits and reorganizes the signal matrix, thereby effectively improving the spectrum sensing performance [14]. From the above analysis, it can be known that the traditional spectrum sensing based on random matrix needs to derive and calculate the threshold of the decision in advance. The whole process is complex, and there are problems such as inaccurate thresholds.
With the rapid development of information geometry theory, the concept of statistical manifolds is used to transform signal detection problems into geometric problems on manifolds, and then geometric tools can be used to visually analyze detection problems. Liu et al. used information geometry theory to detect radar signals. At the same time, a matrix constant false alarm rata (CFAR) and a distance detector based on geodesic were proposed [15]. Chen applied the information geometry method to spectrum sensing, increased the measurement of manifolds, and obtained the decision threshold through simulation [16]. Lu et al. used the matching method to obtain the closed expression of the decision threshold, which has higher computational complexity [17]. However, in spectrum sensing, the derivation of the threshold is not only complicated, but there is always some deviation in using the fixed decision threshold to determine whether the PU exists.
In recent years, machine learning has developed rapidly, which also provides a new idea for spectrum sensing. Spectrum sensing can be considered as a problem of two classifications that is whether the PU exists [18–20]. Kumar proposed a spectrum sensing method based on Kmeans clustering algorithm and energy feature. The method takes the energy value of the signal as the feature and then uses Kmeans clustering algorithm to classify these features [21]. Zhang et al. proposed a spectrum sensing method based on Kmeans and signal features that combines the feature extraction methods in the random matrix and selects MME, DMM, and DMEAE as the characteristics of training and classification [22]. Thilina et al. used Kmeans, Gaussian mixture model (GMM) in unsupervised learning, and neural network (NN) and support vector machine (SVM) in supervised learning to study spectrum perception [23]. Xue et al. proposed a cooperative spectrum sensing algorithm based on unsupervised learning. The dominant features and the maximum and minimum eigenvalues are used as features. Kmeans clustering and GMM are selected as the learning framework [24]. Compared with the traditional spectrum sensing method, spectrum sensing based on machine learning can effectively eliminate the cumbersome threshold calculation and has better adaptability. Similarly, the method does not need to know the priori information of the PU.
Contributions
Based on the above researches, this paper proposes a cooperative spectrum sensing method based on information geometry and fuzzy cmeans (FCM) clustering algorithm (IGFCM). In the feature extraction process, the orderDAR (ODAR) and intervalDAR (IDAR) are introduced to obtain two new matrices, then two covariance matrices of two new matrices are calculated separately, and then two covariance matrices are mapped to the manifold using information geometry theory. Then, use the geodesic distance to calculate the distance on the manifold and use it as a feature. Finally, the FCM clustering algorithm is used to implement spectrum sensing. The spectrum sensing method proposed in this paper does not require any prior information about the communication system, and the unmarked training data is more easily obtained. In the experiment, the spectrum sensing performance of IGFCM was further analyzed. The simulation results show that the method effectively improves the spectrum sensing performance.
Methods or experimental
The main structure and arrangement of this paper are as follows. Section 2 mainly introduces the system model of cooperative spectrum sensing. Section 3 is to improve the spectrum sensing performance in the case of a small number of cooperative users and to analyze the spectrum sensing problem more intuitively. A signal feature extraction method based on split recombination and information geometry is proposed. Section 4 uses FCM clustering algorithm to achieve spectrum sensing. Section 5 uses the amplitude modulation signal to verify the proposed method.
Cooperative spectrum sensing system model
According to the perception of PU by a single SU in a cognitive radio network (CRN), the following binary hypothesis [25] about PU can be obtained. H_{0} indicates that the PU signal does not exist, and H_{1} indicates that the PU signal exists.
where s(n) represents the signal transmitted by the PU and w(n) is the ambient noise. Since CR is primarily used for relatively fixed networks, the actual channel model is similar to additive white Gaussian noise (AWGN). The systems false alarm probability (P_{f}) and detection probability (P_{d}) can be defined as:
In CRN, spectrum sensing is often done in complex environments. Therefore, the SU needs to consider peripheral multipath fading, shadow effects, and hidden terminals in the process of sensing the PU [26, 27]. Cooperative spectrum sensing reduces the impact of environmental factors by increasing the diversity of SUs. Therefore, to improve the performance of the spectrum sensing system, the method of multiSU cooperative spectrum sensing is adopted. First, SUs collect information about the authorized channel and then transmits the information to a fusion center (FC) through the reporting channel; finally, the unified processing by the FC and the final decision is made. Cooperative spectrum sensing system model is shown in Fig. 1.
Assuming that there are M SUs in a CRN, the signals collected by the M SUs can form a signal vector matrix x_{i}=[x_{i}(1),x_{i}(2),…,x_{i}(N)], where X=[x_{1},x_{2},…,x_{M}]^{T} represents the signal sample value of the ith SU. Therefore, X is a matrix of M×N dimensions.
For ease of reference, the symbols and notations used in this paper are summarized in Table 1.
Feature extraction based on decomposition and recombination and information geometry
Feature extraction model
In the feature extraction process, the noise environment needs to be estimated first, and two covariance matrices are obtained by splitting and recombining the noise signal matrix in sequence and interval. The model of feature extraction based on decomposition and recombination and information geometry is shown in Fig. 2. In order to accurately estimate the noise environment, collect enough noise signal matrices and perform ODAR and IDAR and covariance transformation (as shown in the box in Fig. 2). Then, use the Riemann mean calculation method to solve the Riemann mean of these covariance matrices. Similarly, the signal matrix with the perception is also subjected to two kinds of split recombination, and the covariance matrix is transformed. Finally, the distance from the covariance matrix obtained from the environment to be perceived to the Riemann mean is calculated. Then, use this distance as a statistical feature of the signal.
Information geometry overview
According to the matrix X, the corresponding covariance matrix can be calculated as shown in Eq. 5.
From the theory of information geometry, we assume a set of probability density functions p(xθ), where x is an ndimensional sample belonging to the random variable Ω, x∈Ω∈C^{n}. θ is an mdimensional parameter vector, θ∈Θ⊆C^{m}. Therefore, the probability distribution space can be described by parameter set Θ. The probability distribution function family S is as shown in Eq. 6.
Under a certain topological structure, S can form a microscopic manifold, called a statistical manifold, and θ is the coordinate of the manifold. From the perspective of information geometry, the probability density function can be parameterized by the corresponding covariance matrix. Under the two hypotheses H_{0} and H_{1} of spectrum sensing, the signal can be mapped to a point that is R_{w} or R_{s}+R_{w}, on the manifold. R_{w} and R_{s}+R_{w} are respectively the covariance calculated from the noise matrix and the signal matrix. In particular, both R_{w} and R_{s}+R_{w} are Toeplitz Hermitian positive definite matrices [17]. Therefore, a symmetric positive definite (SPD) matrix space composed of a covariance matrix can be defined as an SPD manifold.
Decomposition and recombination
In this section, we first split and reorganize the signal matrix for SU to logically increase the number of cooperative SUs. The DAR is divided into ODAR and IDAR. At the same time, the ODAR and IDAR are used to process the signal vector perceived by the SU. The specific algorithm is as follows [14]:
In the process of ODAR, x_{i} will be sequentially split into subsignal vectors of q(q>0) segment s=N/q long. Then, the result of splitting x_{i} is as follows:
The signal vector in Eq. 4 is split according to Eq. 7, and then, the split subsignal vector is recombined to obtain a qM×s dimensional signal matrix Y_{O−DAR}.
In the process of IDAR, select sampling points in the sampled data every q−1 units and then recombine the signal matrix X. The sampled data is separated by q−1 units, the sample points are reselected, and the signal matrix is recombined. According to IDAR, the sampled data can be split into subsignal vectors of q(q>0) segment s=N/q long. Then, the result of splitting x_{i} is as follows:
The signal vector in Eq. 4 is split according to Eq. 9, and then, the split subsignal vector is recombined to obtain a qM×s dimensional signal matrix Y_{I−DAR}.
According to Y_{O−DAR} and Y_{I−DAR}, the corresponding covariance matrices R^{O} and R^{I} can be calculated.
Riemann mean
First, SUs collect P environmental noise matrices. These noise matrices are then processed using ODAR and IDAR, and the covariance matrix will be calculated. Thus, we can obtain \({\mathbf {R}}_{k}^{O}(k = 1,2,\ldots,P)\) and \({\mathbf {R}}_{k}^{I}(k = 1,2,\ldots,P)\) matrices. Their Riemann mean objective functions are shown in Eqs. 13 and 14, respectively.
\({\overline {\mathbf {R}}^{O}}\) and \({\overline {\mathbf {R}}^{I}}\) are the matrix when Φ(∙) takes the minimum value, where D(∙,∙) is the geodesic distance of two points on the manifold described below.
Assume that for the case where there are two points R_{1} and R_{2} on the matrix manifold, \(\overline {\mathbf {R}}\) is located at the midpoint of the geodesic line connecting the two points R_{1} and R_{2} on the manifold. Its expression is as shown in Eq. 17.
If P>2, the Riemann mean will be difficult to calculate. Literatures [28, 29] give a method of iteratively calculating \(\overline {\mathbf {R}}\) using the gradient descent algorithm, and finally obtain the Riemann mean calculation formula as shown in Eq. 18.
where τ is the step size of iteration and l indicates the number of iteration steps. Therefore, we use the gradient descent algorithm to calculate the Riemann matrix, and get \({\overline {\mathbf {R}}^{O}}\) and \({\overline {\mathbf {R}}^{I}}\).
Geodesic distance
The study of a geometric structure is mainly to study some properties such as distance, tangent, and curvature on the structure. There are many ways to measure the distance between two probability distributions on a statistical manifold. The most common is the geodesic distance.
Assuming θ is a point on the manifold, the metric on the statistical manifold can be defined by G(θ) of the following equation, called the Fisher information matrix.
Due to the nature of the manifold curvature, we determine the distance between the two points by defining the length of the curve connecting the two points on the manifold. Consider an arbitrary curve θ(t)(t_{1}≤t≤t_{2}) between two points θ_{1} and θ_{2} on an arbitrary manifold, where θ(t_{1})=θ_{1}, θ(t_{2})=θ_{2}. Then, the distance between θ_{1} and θ_{2} can be obtained along the curve θ(t) [30].
It can be seen that the distance between θ_{1} and θ_{2} depends on the selection of the curve θ(t). We call the curve that makes Eq. 20 have the smallest distance as the geodesic, and call the corresponding distance as the geodesic distance.
For any probability distribution, the calculation of geodesic distance is more complicated, which has some adverse effects on its application. For a multivariate Gaussian distribution family with the same mean but different covariance matrices, consider the two members of R_{1} and R_{2} in the covariance matrix. The geodesic distance between them is shown in the following Eq. 21 [31].
where η_{i} is the i eigenvalues of the matrix \({\mathbf {R}}_{1}^{ 1/2}{{\mathbf {R}}_{2}}{\mathbf {R}}_{1}^{ 1/2}\).
According to the feature extraction process and the above analysis, the signal matrix to be perceived is split and recombined in sequence and interval, and the covariance matrix is transformed to obtain R_{O} and R_{I}. Then, we use Eq. 21 to solve the corresponding geodesic distance.
According to the geodesic d_{1} and d_{1}, a twodimensional feature vector D=[d_{1},d_{2}] is used to represent the signal sensed by the SU. Finally, the feature vector D is used for spectrum sensing.
Cooperative spectrum sensing based on FCM clustering algorithm
The FCM clustering algorithm is based on the partitioning method to obtain the clustering result.The basic idea is to divide similar samples into the same class as much as possible. The FCM clustering algorithm is an improvement of the common Kmeans clustering algorithm. The common Kmeans clustering algorithm is hard to divide the data, and the FCM clustering algorithm is a flexible fuzzy partitioning [32].Compared with traditional spectrum sensing methods, cooperative spectrum sensing based on FCM clustering algorithm not only eliminates complex threshold derivation but also has adaptability. The overall flow of the IGFCM method described in this paper is shown in Fig. 3.
The method of IGFCM is divided into two parts. In the first part, the red box indicates the training process. In the second part, the spectrum sensing process is represented in the green box.
Training process based on FCM
Before training, we need to prepare a training set \(\overline {\mathrm {D}}\):
Among them, D_{j} is the feature vector extracted in the third section and J represents the number of training feature vectors. The clustering algorithm divides the unlabeled training feature vectors into C nonoverlapping clusters. Let Z_{c} denote the set of training feature vectors belonging to class c, where c=1,2,…,C, then
The class Z_{c} has a corresponding center Ψ_{c}, and each sample D_{j} belongs to Ψ_{c} with a membership degree of u_{cj} and 0<u_{cj}<1. The objective function Γ of the FCM clustering algorithm is shown in Eq. 26, and the constraint condition is shown in Eq. 27.
where ∥D_{j}−Ψ_{c}∥^{2} is an error metric and m is a weighted power exponent of the membership degree u_{cj}, which may also be referred to as a smoothness index or a fuzzy weighted index, and m>1.
Using Lagrange to collate the objective function Γ and constraints, the objective function shown in Eq. 28 is obtained.
Then, the membership degree u_{cj} and the cluster center Ψ_{c} are respectively derived, and the constraint condition is substituted [33, 34], thereby obtaining the calculation formulas of u_{cj} and Ψ_{c}, as shown in the Eqs. 29 and 30.
The training process based on the FCM clustering algorithm is as follows:
Step 1 Input training data set \(\overline {\mathrm {D}}\), number of clusters C, smoothing index m, initialization membership u_{cj}, and fault tolerance factor ε
Step 2 Calculate the class center Ψ_{c} by Eq. 30
Step 3 Calculate ν=∥D_{j}−Ψ_{c}∥^{2}, if ν<ε, the algorithm stops; otherwise, continue to step 4
Step 4 Recalculate the membership degree u_{cj} according to Eq. 29, return to step 2
Step 5 Output class center point Ψ_{c}
Spectrum sensing process based on FCM
After the training is successful, we can get a classifier for spectrum sensing, as shown in Eq. 31.
In Eq. 31, \({\overline {\overline {\mathbf {D}}}}\) denotes an unknown perceptual signal feature vector. If Eq. 31 is satisfied, it indicates that the PU signal exists and the channel is not available; otherwise, the PU signal does not exist and the channel can be used. The parameter ξ is used to control the probability of missed detection and false alarm probability in the sensing process [21].
Simulation results and performance analysis
The cooperative spectrum sensing algorithm based on fuzzy cmeans clustering algorithm is simulated and analyzed in this section. The simulation PU signal is the amplitude modulation (AM) signal, and the noise is Gaussian white noise. In order to ensure the accuracy of the experiment, according to the feature extraction method described in Section 4, 2000 signal feature vectors were extracted, of which 1000 are training samples and 1000 are used as test samples.
Firstly, we analyze the clustering effect of FCM clustering algorithm under this feature. Set the simulation parameters: cooperative SU M=2, sampling points N=1000, SNR=−11 dB. Figure 4 shows the signal and noise feature training samples obtained by the feature extraction method of split recombination combined with information geometry as the training input of the classifier.
Figure 5 shows the clustering data after using the fuzzy cmeans clustering algorithm. The blue dot in Fig. 5 represents the noise feature vector, and the red dot represents the signal feature vector. Black dots and black triangles represent the center of the noise class and the PU signal class, respectively.
Further, we compare and analyze the performance of IGFCM and other methods, which are respectively characterized by energy (ED), and the IQMME, IQDMM, IQDMEAE methods are proposed in literature [22]. Given the simulation parameters, the cooperative SU number M=2, the number of sampling points N=1000, and the simulation diagrams when the SNR=− 13 dB and SNR=− 11 dB respectively are shown in Figs. 6 and 7. Compared with other methods, the IGFCM has better spectrum sensing performance.
Given the number of sampling points N=1000, the SNR=− 15 dB. The simulation results obtained when the number of SUs is 2, 4, 6, 8, and 10 respectively are as shown in Fig. 8. As can be seen from Fig. 8, the number of cooperative SUs M has a great relationship with the detection probability of the algorithm. As M increases, the detection probabilities of several algorithms increase to varying degrees.
As the number of sampling points increases, the perceived signal information is more comprehensive, so the extracted features are more representative. In order to observe the spectral sensing performance of the IGFCM method under different sampling points, keep the simulation parameters M=2 and SNR=− 13 dB unchanged. The IGFCM algorithm simulation diagram obtained when the number of sampling points is 1000, 1400, 1800, 2200, or 2600 respectively. As can be seen from Fig. 9, the spectrum sensing performance increases as the number of sampling points increases.
Conclusion
In this paper, a spectrum sensing method based on information geometry and FCM clustering is proposed. In the feature extraction process, a feature extraction method combining split recombination and information geometry is proposed to transform complex signal detection problems into manifolds. Geometric problems on the indirect analysis of signal detection problems using geometric tools. Finally, the FCM clustering algorithm is used to train the extracted features to obtain a classifier for spectrum sensing to realize spectrum sensing. The perceptual performance of the method described in this paper is further analyzed in the experimental part. The experimental results show that the method improves the spectrum sensing performance to some extent. In the future work, we will continue to study the application of clustering algorithms in spectrum sensing, such as kernel fuzzy cmeans clustering (KFCM) and the scope of possibilistic fuzzy cmeans (PFCM). It is hoped that the spectrum sensing performance can be further effectively improved.
Abbreviations
 AWGN:

Additive white Gaussian noise
 CFAR:

Constant false alarm rata
 CR:

Cognitive radio
 DAR:

Decomposition and recombination
 DMEAE:

Difference between the maximum eigenvalue and the average energy
 DMM:

Difference between the maximum eigenvalue and the minimum feature
 FCM:

Fuzzy cmeans
 GMM:

Gaussian mixture model
 IDAR:

Interval decomposition and recombination
 IGFCM:

A cooperative spectrum sensing method based on information geometry and fuzzy cmeans clustering algorithm
 KFCM:

Kernel fuzzy cmeans
 MME:

Maximum to minimum eigenvalue
 NN:

Neural network
 ODAR:

Order decomposition and recombination
 PFCM:

The scope of possibilistic fuzzy cmeans
 PU:

Primary user
 SNR:

Signaltonoise ratio
 SPD:

Symmetric positive definite
 SU:

Secondary user
 SVM:

Support vector machine
References
 1
A. A. Khan, M. H. Rehmani, M. Reisslein, Cognitive radio for smart grids: survey of architectures, spectrum sensing mechanisms, and networking protocols. IEEE Commun. Surv. Tutor. 18:, 860–898 (2016).
 2
L. Xiao, in IEEE Global Communications Conference: 2014; Austin. Prospect theoretic analysis of antijamming communications in cognitive radio networks (IEEEAustin, 1996), pp. 746–751.
 3
K. Cichon, A. Kliks, H. Bogucka, Energyefficient cooperative spectrum sensing: a survey. IEEE Commun. Surv. Tutor. 18:, 1861–1886 (2016).
 4
N. S. Kim, J. M. Rabaey, A dualresolution waveletbased energy detection spectrum sensing for UWBbased cognitive radios. IEEE Trans. Circ. Syst. I Regular Papers. PP:, 1–14 (2017).
 5
E. Chatziantoniou, B. Allen, V. Velisavljevic, P. Karadimas, J. Coon, Energy detection based spectrum sensing over twowave with diffuse power fading channels. IEEE Trans. Veh. Technol. 66:, 868–874 (2017).
 6
X Zhang, R Chai, F Gao, in IEEE Global Conference on Signal and Information Processing: 09 February 2015; Atlanta. Matched filter based spectrum sensing and power level detection for cognitive radio network (IEEEAtlanta, 2015), pp. 1267–1270.
 7
A Surampudi, in India International Conference on Information Processing: 2016. An adaptive decision threshold scheme for the matched filter method of spectrum sensing in cognitive radio using artificial neural networks (IEEEDoha, 2016), pp. 1–5.
 8
R Mahapatra, in IEEE International Symposium on Wireless Communication Systems: 2016;Reykjavik. Cyclostationary detection for cognitive radio with multiple receivers (IEEEReykjavik, 2008), pp. 493–497.
 9
W. Zhang, G. Abreu, M. Inamori, Y. Sanada, Spectrum sensing algorithms via finite random matrices. IEEE Trans. Commun. 60:, 164–175 (2012).
 10
Y. Zeng, Y. C. Liang, Eigenvaluebased spectrum sensing algorithms for cognitive radio. IEEE Trans. Commun. 57:, 1784–1793 (2009).
 11
C. Liu, in 7th International Conference on Wireless Communications, Networking and Mobile Computing: 2011;Wuhan. A distanceweighed algorithm based on maximumminimum eigenvalues for cooperative spectrum sensing (IEEEWuhan, 2011), pp. 1–4.
 12
N. Liu, H. S. Shi, B. Yang, D. P. Yuan, Spectrum sensing method based on MESED. Meas. Control. Technol. 35:, 125–128 (2016).
 13
M. T. Antonia, V. Sergio, Random matrix theory and wireless communications. Commun. Inf. Theory. 1:, 1–182 (2004).
 14
W. Hu, in International Conference on Wireless Communications, Networking and Mobile Computing: 2628 September 2014;Beijing. Cooperative spectrum sensing algorithm based on bistable stochastic resonance (IETBeijing, 2014), pp. 126–130.
 15
J. K. Liu, X. S. Wang, W. Tao, Q. U. LongHai, Application of information geometry to target detection for pulsedDoppler radar. J. Natl Univ. Defense Technol. 33:, 77–80 (2011).
 16
Q. Chen, in International Conference on Cloud Computing and Security: 1618 June 2017;Nanjing. Research on cognitive radio spectrum sensing method based on information geometry (IEEENanjing, 2017), pp. 554–564.
 17
Q. Lu, S. Yang, F. Liu, Wideband spectrum sensing based on Riemannian distance for cognitive radio networks. Sensors. 17:, 661 (2017).
 18
L. Xiao, Y. Li, G. Han, W. Zhuang, PHYlayer spoofing detection with reinforcement learning in wireless networks. IEEE Trans. Veh. Technol. 65:, 10037–10047 (2016).
 19
S. P. Maity, S. Chatterjee, T. Acharya, On optimal fuzzy cmeans clustering for energy efficient cooperative spectrum sensing in cognitive radio networks. Dig. Signal Proc. 49:, 104–115 (2016).
 20
A Paul, SP Maity, Kernel fuzzy cmeans clustering on energy detection based cooperative spectrum sensing. Dig. Commun. Netw. 4:, 196–205 (2016).
 21
V. Kumar, in Twenty Second National Conference on Communication: 46 March 2016;Guwahati. Kmean clustering based cooperative spectrum sensing in generalized ku fading channels (IEEEGuwahati, 2016), pp. 1–5.
 22
Y. Zhang, P. Wan, S. Zhang, Y. Wang, N. Li, A spectrum sensing method based on signal feature and clustering algorithm in cognitive wireless multimedia sensor networks. Adv. Multimedia. 2017:, 1–10 (2017).
 23
K. M. Thilina, K. W. Choi, N. Saquib, E. Hossain, Machine learning techniques for cooperative spectrum sensing in cognitive radio networks. IEEE J. Sel. Areas Commun. 31:, 2209–2221 (2013).
 24
G. C. Sobabe, in International Congress on Image and Signal Processing, Biomedical Engineering and Informatics. A machine learning based spectrumsensing algorithm using sample covariance matrix (IEEEShanghai, 2018), pp. 1–6.
 25
S. Chatterjee, A. Banerjee, T. Acharya, S. P. Maity, Fuzzy cmeans clustering in energy detection for cooperative spectrum sensing in cognitive radio system. Proc. Mult. Access Commun. 8715:, 84–95 (2014).
 26
A. S. Kannan, in International Conference on Control Communication and Computing: 1315 December 2013; Thiruvananthapuram. Performance analysis of blind spectrum sensing in cooperative environment (IEEEThiruvananthapuram, 2013), pp. 277–280.
 27
L. Xiao, J. Liu, Q. Li, N. B. Mandayam, H. V. Poor, Usercentric view of jamming games in cognitive radio networks. IEEE Trans. Inf. Forensics Secur. 10:, 2578–2590 (2015).
 28
C. Lenglet, M. Rousson, R. Deriche, O. Faugeras, Statistics on the manifold of multivariate normal distributions: theory and application to diffusion tensor MRI processing. J. Math. Imaging Vis. 25:, 423–444 (2006).
 29
M. Menendez, A differential geometric approach to the geometric mean of symmetric positivedefinite matrices. Siam J. Matrix Anal. Appl. 26:, 735–747 (2008).
 30
M. Menendez, D. Morales, L. Pardo, M. Salicru, Statistical tests based on geodesic distances. Appl. Math. Lett. 8:, 65–69 (1995).
 31
M. Calvo, J. M. Oller, A distance between multivariate normal distributions based in an embedding into the Siegel group. J. Multivar. Anal. 35:, 223–242 (1991).
 32
M. N. Ahmed, S. M. Yamany, N. Mohamed, A. A. Farag, T. Moriarty, A modified fuzzy cmeans algorithm for bias field estimation and segmentation of MRI data. IEEE Trans. Med. Imaging. 21:, 193–199 (2002).
 33
D. M. S. Bhatti, in International Conference on Information and Communication Technology Convergence: 1820 October 2017; Jeju. Fuzzy cmeans and spatial correlation based clustering for cooperative spectrum sensing (IEEEJeju, 2017), pp. 486–491.
 34
D. M. S. Bhatti, N. Saeed, H. Nam, Fuzzy cmeans clustering and energy efficient cluster head selection for cooperative sensor network. Sensors. 16:, 1459–1476 (2016).
Acknowledgements
The author wants to thank the author’s organization because they have provided us with many conveniences.
Funding
This work was supported in part by special funds from the central finance to support the development of local universities under No. 400170044, the project supported by the State Key Laboratory of Management and Control for Complex Systems, Institute of Automation, Chinese Academy of Sciences under grant No.20180106, the degree and graduate education reform project of Guangdong Province under grant No.2016JGXM_MS_26, the foundation of key laboratory of machine intelligence and advanced computing of the Ministry of Education under grant No.MSC201706A and the higher education quality projects of Guangdong Province and Guangdong University of Technology.
Availability of data and materials
The materials are mainly from different journals and conferences, as shown in the references. In the simulation results and performance analysis section, mainly use MATLAB tools to simulate.
Author information
Affiliations
Contributions
SZ provided this idea and wrote the manuscript. YW demonstrated the idea. JL and YZ designed the experiment and conducted the experimental verification. PW and NL give constructive suggestions for the structure of the paper. All authors read and approved the final manuscript.
Corresponding author
Correspondence to Yonghua Wang.
Ethics declarations
Competing interests
The authors declare that they have no competing interests.
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Additional information
Authors’ information
Shunchao Zhang received his B.S. degree in Hunan Institute of Engineering in 2016. He is currently pursuing the M.S. degree in Guangdong University of Technology, Guangdong, China. His research interests include spectrum sensing in cognitive radio.
Yonghua Wang received his B.S. degree in Electrical Engineering and Automation from Hebei University of Technology in 2001, the M.S. degree in Control Theory and Control Engineering from Guangdong University of Technology in 2006, and Ph.D. degree in Communication and Information System from SUNYAN SEN University in 2009. He now with School of Automation in Guangdong University of Technology.
Jiangfan Li received his B.S. degree in Foshan University in 2016. He is currently pursuing the M.S. degree in Guangdong University of Technology, Guangdong, China. His research interests include spectrum sensing in cognitive radio.
Pin Wan received his B.S. degree in Electronic Engineering from Southeast University in 1984, the M.S. degree in Circuit and System from Southeast University in 1990, and Ph.D. degree in Control Theory and Control Engineering from Guangdong University of Technology in 2011. He currently is a professor in School of Automation in Guangdong University of Technology.
Yongwei Zhang received his B.S. degree in Jiaying University in 2016. He is currently pursuing the M.S. degree in Guangdong University of Technology, Guangdong, China. His research interests include spectrum sensing in cognitive radio.
Nan Li is currently pursuing the B.S. degree in Guangdong University of Technology, Guangdong, China. Her research interests include spectrum sensing in cognitive radio.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Zhang, S., Wang, Y., Li, J. et al. A cooperative spectrum sensing method based on information geometry and fuzzy cmeans clustering algorithm. J Wireless Com Network 2019, 17 (2019) doi:10.1186/s136380191338z
Received
Accepted
Published
DOI
Keywords
 Cooperative spectrum sensing
 Information geometry
 Decomposition and recombination
 Fuzzy cmeans clustering algorithm