Robust cooperative spectrum sensing in dense cognitive vehicular networks

Author(s):  
Xia Liu ◽  
Zhimin Zeng ◽  
Caili Guo
2018 ◽  
Vol 2018 ◽  
pp. 1-14
Author(s):  
Xia Liu ◽  
Zhimin Zeng ◽  
Caili Guo

In cognitive vehicular networks (CVNs), many envisioned applications related to safety require highly reliable connectivity. This paper investigates the issue of robust and efficient cooperative spectrum sensing in CVNs. We propose robust cooperative spectrum sensing via low-rank matrix recovery (LRMR-RCSS) in cognitive vehicular networks to address the uncertainty of the quality of potentially corrupted sensing data by utilizing the real spectrum occupancy matrix and corrupted data matrix, which have a simultaneously low-rank and joint-sparse structure. Considering that the sensing data from crowd cognitive vehicles would be vast, we extend our robust cooperative spectrum sensing algorithm to dense cognitive vehicular networks via weighted low-rank matrix recovery (WLRMR-RCSS) to reduce the complexity of cooperative spectrum sensing. In the WLRMR-RCSS algorithm, we propose a correlation-aware selection and weight assignment scheme to take advantage of secondary user (SU) diversity and reduce the cooperation overhead. Extensive simulation results demonstrate that the proposed LRMR-RCSS and WLRMR-RCSS algorithms have good performance in resisting malicious SU behavior. Moreover, the simulations demonstrate that the proposed WLRMR-RCSS algorithm could be successfully applied to a dense traffic environment.


Author(s):  
Shreyansh Shah ◽  
Dhaval K. Patel ◽  
Brijesh Soni ◽  
Miguel Lopez-Benitez ◽  
Sagar Kavaiya

2020 ◽  
Vol 2020 ◽  
pp. 1-9 ◽  
Author(s):  
S. Tephillah ◽  
J. Martin Leo Manickam

Security is a pending challenge in cooperative spectrum sensing (CSS) as it employs a common channel and a controller. Spectrum sensing data falsification (SSDF) attacks are challenging as different types of attackers use them. To address this issue, the sifting and evaluation trust management algorithm (SETM) is proposed. The necessity of computing the trust for all the secondary users (SUs) is eliminated based on the use of the first phase of the algorithm. The second phase is executed to differentiate the random attacker and the genuine SUs. This reduces the computation and overhead costs. Simulations and complexity analyses have been performed to prove the efficiency and appropriateness of the proposed algorithm for combating SSDF attacks.


Sign in / Sign up

Export Citation Format

Share Document