• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.2
• /
• pp.253-263
• /
• 2015

Lately, spectrum sensing performance has been improved by using cooperate spectrum sensing which each results of sensing of several secondary users are reported to the fusion center. Using Cognitive Radio, secondary user is able to share a bandwidth allocated to primary user. In this paper, we propose a new decentralized cooperative spectrum sensing scheme which compensates the performance degradation of existing decentralized cooperative spectrum sensing considering the error probability of the channel which sensed result of the secondary user is delivered to the fusion center in decentralized cooperative spectrum sensing. In addition, a sensing threshold optimization of minimizing the error probability of decentralized cooperative spectrum sensing is introduced by deriving the equation and the optimal sensing threshold has been confirmed to maximize the decentralized cooperative spectrum sensing performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.11
• /
• pp.2561-2576
• /
• 2013

The ship ad-hoc network (SANET) extends the coverage of the high data-rate terrestrial communications to the ships with the reduced cost in maritime communications. Cognitive radio (CR) has the ability of sensing the radio environment and dynamically reconfiguring the operating parameters, which can make SANET utilize the spectrum efficiently. However, due to the dynamic topology nature and no central entity for data fusion in SANET, the interference brought into the primary network caused by the hidden primary user requires to be carefully managed by a sort of decentralized cooperative spectrum sensing schemes. In this paper, we propose a self-weighted decentralized cooperative spectrum sensing (SWDCSS) scheme to solve such a problem. The analytical and simulation results show that the proposed SWDCSS scheme is reliable to detect the primary user in SANET. As a result, secondary network can efficiently utilize the spectrum band of primary network with little interference to primary network. Referring the complementary receiver operating characteristic (ROC) curves, we observe that with a given false alarm probability, our proposed algorithm reduces the missing probability by 27% than the traditional embedded spectrally agile radio protocol for evacuation (ESCAPE) algorithm in the best condition.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.6
• /
• pp.1042-1062
• /
• 2010

Cooperative spectrum sensing (CSS) is an effective technology for alleviating the unreliability of local spectrum sensing due to fading/shadowing effects. Unlike most existing solutions, this paper considers the use of CSS technology in decentralized networks where a fusion center is not available. In such a decentralized network, some attackers may sneak into the ranks of cooperative users. On the basis of recent advances in bio-inspired consensus algorithms, an attack-proof, decentralized CSS scheme is proposed in which all secondary users can maintain cooperative sensing by exchanging information locally instead of requiring centralized control or data fusion. Users no longer need any prior knowledge of the network. To counter three potential categories of spectrum sensing data falsification (SSDF) attacks, some anti-attack strategies are applied to the iterative process of information exchange. This enables most authentic users to exclude potentially malicious users from their neighborhood. As represented by simulation results, the proposed scheme can generally ensure that most authentic users reach a consensus within the given number of iterations, and it also demonstrates much better robustness against different SSDF attacks than several existing schemes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.9
• /
• pp.765-774
• /
• 2013

In this paper, we present a cooperative compressed spectrum sensing scheme for correlated signals in decentralized wideband cognitive radio networks. Compressed sensing is a signal processing technique that can recover signals which are sampled below the Nyquist rate with high probability, and can solve the necessity of high-speed analog-to-digital converter problem for wideband spectrum sensing. In compressed sensing, one of the main issues is to design recovery algorithms which accurately recover original signals from compressed signals. In this paper, in order to achieve high recovery performance, we consider the multiple measurement vector model which has a sequence of compressed signals, and propose a cooperative sparse Bayesian recovery algorithm which models the temporal correlation of the input signals.