Sequential 0/1 for Cooperative Spectrum Sensing in the Presence of Strategic Byzantine Attack

Abstract

Cooperative spectrum sensing (CSS) is regarded as a promising approach to identify the available spectrum. However, it not only requires the large communication resource-consuming, but also exposes a high vulnerability to Byzantine attack. In this letter, starting with sequential voting rule, we propose a low-complexity sequential 0/1 (S0/1) for CSS in the presence of strategic Byzantine attack, which neither requires strong assumptions and any prior knowledge nor depends on careful threshold selection. Compared with existing approaches, simulation results show that S0/1 reduces the sample size in support of the higher correct sensing ratio, even in the blind scenario.