Multi-Radio Channel Detecting Jamming Attack Against Enhanced Jump-Stay Based Rendezvous in Cognitive Radio Networks

Cognitive radio networks are a new technology based on which unlicensed users are allowed access to licensed spectrum under the condition that the interference perceived by licensed users is minimal. That means unlicensed users need to learn from environmental changes and to make appropriate decisions regarding the access to the radio channel. This is a process that can be done by unlicensed users in a cooperative or non-cooperative way. Whereas the non-cooperative algorithms are risky with regard to performance, the cooperative algorithms have the capability to provide better performance. This chapter shows a new fuzzy logic-based decision-making algorithm for channel selection. The underlying decision criterion considers statistics of licensed user channel occupancy as well as information about the competition level of unlicensed users. The theoretical studies indicate that the unlicensed users can obtain an efficient sharing of the available channels. Simulation results are reported to demonstrate the performance and effectiveness of the suggested algorithm.

Download Full-text

Multi-radio channel rendezvous in cognitive radio networks

IET Communications ◽

10.1049/iet-com.2018.5956 ◽

2019 ◽

Vol 13 (10) ◽

pp. 1433-1442

Author(s):

Lin Chen ◽

Kaigui Bian ◽

Xiaohu Ge ◽

Wei Chen ◽

Qingsong Ai ◽

...

Keyword(s):

Cognitive Radio ◽

Cognitive Radio Networks ◽

Radio Channel ◽

Radio Networks

Download Full-text

The Defense Against Jamming Attack in Cognitive Radio Networks: Energy Efficiency Management Perspective

Microprocessors and Microsystems ◽

10.1016/j.micpro.2020.103816 ◽

2021 ◽

Vol 82 ◽

pp. 103816

Author(s):

Bhuvana Suganthi D ◽

R. Jaichandran ◽

P. Shyamala Bharathi ◽

B. Meenakshi ◽

A. Anushya ◽

...

Keyword(s):

Energy Efficiency ◽

Cognitive Radio ◽

Cognitive Radio Networks ◽

Radio Networks ◽

Jamming Attack ◽

Management Perspective

Download Full-text

Defence against responsive and non-responsive jamming attack in cognitive radio networks: an evolutionary game theoretical approach

The Journal of Engineering ◽

10.1049/joe.2017.0285 ◽

2018 ◽

Vol 2018 (2) ◽

pp. 68-75 ◽

Cited By ~ 3

Author(s):

Shyamala Bharathi ◽

Dhananjay Kumar ◽

Deepak Ram

Keyword(s):

Cognitive Radio ◽

Cognitive Radio Networks ◽

Theoretical Approach ◽

Evolutionary Game ◽

Radio Networks ◽

Jamming Attack ◽

Game Theoretical Approach

Download Full-text

Improving performance of CSS cognitive radio networks under jamming attack

2017 2nd International Conference on Communication Systems, Computing and IT Applications (CSCITA) ◽

10.1109/cscita.2017.8066556 ◽

2017 ◽

Author(s):

Rajesh D. Kadu ◽

Pravin P. Karde

Keyword(s):

Cognitive Radio ◽

Cognitive Radio Networks ◽

Radio Networks ◽

Jamming Attack

Download Full-text

Fast and Robust Asynchronous Rendezvous Scheme for Cognitive Radio Networks

Applied Sciences ◽

10.3390/app9122481 ◽

2019 ◽

Vol 9 (12) ◽

pp. 2481

Author(s):

Yongchul Kim

Keyword(s):

Cognitive Radio ◽

Cognitive Radio Networks ◽

Relative Position ◽

Upper Bound ◽

State Of The Art ◽

Radio Networks ◽

Jamming Attacks ◽

Jamming Attack ◽

Asynchronous Environments ◽

Better Than

The rendezvous process is considered a key operation that allows a secondary user (SU) to access an unused authorized spectrum in cognitive radio networks (CRNs). Most existing works focused on fast guaranteed rendezvous without considering a sophisticated jamming attack environment. In this paper, I propose a fast and robust asynchronous rendezvous scheme that can improve robustness against jamming attacks under symmetric asynchronous environments in which all SUs have the same available channels. Unfortunately, in CRNs, each SU can have a different number of available channels due to their relative position to primary nodes (PUs). Therefore, I extend my fast and robust asynchronous rendezvous scheme (FRARS) to a general asymmetric scenario while preserving robustness against jamming attacks. I derive the maximum rendezvous time (MTTR) of my new algorithm and the upper bound of the expected TTR (ETTR) and compare it with the state-of-the-art algorithms such as jump-stay (JS) and Enhanced jump-stay (EJS). My numerical results show that the performance of the proposed technique is better than that of JS and EJS in terms of MTTR and ETTR. Also, the performance will be more significant when there are security concerns about a sophisticated jamming attack.

Download Full-text