scholarly journals Adaptive Clustering Algorithm for Cooperative Spectrum Sensing in Mobile Environments

Author(s):  
Jesus Perez ◽  
Ignacio Santamaria
IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 5777-5786
Author(s):  
Shunchao Zhang ◽  
Yonghua Wang ◽  
Pin Wan ◽  
Jiawei Zhuang ◽  
Yongwei Zhang ◽  
...  

2020 ◽  
pp. 1-10
Author(s):  
Shunchao Zhang ◽  
Yonghua Wang ◽  
Yongwei Zhang ◽  
Pin Wan ◽  
Jiawei Zhuang

Complexity ◽  
2019 ◽  
Vol 2019 ◽  
pp. 1-13 ◽  
Author(s):  
Yonghua Wang ◽  
Shunchao Zhang ◽  
Yongwei Zhang ◽  
Pin Wan ◽  
Jiangfan Li ◽  
...  

In a complex electromagnetic environment, there are cases where the noise is uncertain and difficult to estimate, which poses a great challenge to spectrum sensing systems. This paper proposes a cooperative spectrum sensing method based on empirical mode decomposition and information geometry. The method mainly includes two modules, a signal feature extraction module and a spectrum sensing module based on K-medoids. In the signal feature extraction module, firstly, the empirical modal decomposition algorithm is used to denoise the signals collected by the secondary users, so as to reduce the influence of the noise on the subsequent spectrum sensing process. Further, the spectrum sensing problem is considered as a signal detection problem. To analyze the problem more intuitively and simply, the signal after empirical mode decomposition is mapped into the statistical manifold by using the information geometry theory, so that the signal detection problem is transformed into geometric problems. Then, the corresponding geometric tools are used to extract signal features as statistical features. In the spectrum sensing module, the K-medoids clustering algorithm is used for training. A classifier can be obtained after a successful training, thereby avoiding the complex threshold derivation in traditional spectrum sensing methods. In the experimental part, we verified the proposed method and analyzed the experimental results, which show that the proposed method can improve the spectrum sensing performance.


2021 ◽  
pp. 1-11
Author(s):  
Shunchao Zhang ◽  
Yonghua Wang ◽  
Yongwei Zhang ◽  
Pin Wan ◽  
Jiawei Zhuang

2019 ◽  
Vol 2019 ◽  
pp. 1-11 ◽  
Author(s):  
Feng Zhao ◽  
Shaoping Li ◽  
Jingyu Feng

Cooperative spectrum sensing (CSS) has been recognized as a forceful approach to promote the utilization of spectrum bands. Nevertheless, all secondary users (SU) are assumed as honest in CSS, thus giving opportunities for attackers to launch the spectrum sensing data falsification (SSDF) attack. To defend against such attack, many efforts have been made to trust mechanism. In this paper, we argue that securing CSS with only trust mechanism is not enough and report the description of dynamic-collusive SSDF attack (DC-SSDF attack). To escape the detection of trust mechanism, DC-SSDF attackers can maintain high trust by submitting true sensing data dynamically and then fake sensing data in the collaborative manner to increase their attack strength. Noting that the resonance phenomenon may appear in the trust value curve of DC-SSDF attackers, a defense scheme called TFCA is proposed from the design idea of trust fluctuation clustering analysis to suppress DC-SSDF attack. In the TFCA scheme, the decreasing property of trust value in the resonance phenomenon is adopted to measure the similarity distance between two attackers. Based on the similarity distance computation, the binary clustering algorithm is designed by electing initial binary samples to identify DC-SSDF attackers. Finally, trust mechanism can be perfected by TFCA to correct DC-SSDF attackers’ trust value. Simulation results show that our TFCA scheme can improve the accuracy of trust value calculation, thus reducing the strength of DC-SSDF attack successfully.


Sign in / Sign up

Export Citation Format

Share Document