scholarly journals Achievable Throughput Analysis and Channel Access in Energy Harvesting Cognitive Radio Sensor Network

IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 82277-82287 ◽  
Author(s):  
Jing Ren ◽  
Hang Zhang ◽  
Hang Hu ◽  
Fengyi Cheng ◽  
Yuan Qin
Keyword(s):  
Cognitive Radio ◽  
Energy Harvesting ◽  
Sensor Network ◽  
Channel Access ◽  
Throughput Analysis ◽  
Achievable Throughput ◽  
Cognitive Radio Sensor Network

scholarly journals Weighted-Directed-Hypergraph-Based Spectrum Access for Energy Harvesting Cognitive Radio Sensor Network

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 68570-68579
Author(s):  
Jing Ren ◽  
Hang Zhang ◽  
Zhiyong Du ◽  
Youming Sun ◽  
Hang Hu ◽  
...  
Keyword(s):  
Cognitive Radio ◽  
Energy Harvesting ◽  
Sensor Network ◽  
Spectrum Access ◽  
Cognitive Radio Sensor Network ◽  
Directed Hypergraph

scholarly journals Energy-Harvesting-Aided Spectrum Sensing and Data Transmission in Heterogeneous Cognitive Radio Sensor Network

2017 ◽  
Vol 66 (1) ◽  
pp. 831-843 ◽  
Author(s):  
Deyu Zhang ◽  
Zhigang Chen ◽  
Ju Ren ◽  
Ning Zhang ◽  
Mohamad Khattar Awad ◽  
...  
Keyword(s):  
Cognitive Radio ◽  
Energy Harvesting ◽  
Sensor Network ◽  
Spectrum Sensing ◽  
Data Transmission ◽  
Cognitive Radio Sensor Network

scholarly journals Multi-Radio Based Rendezvous Technique for Heterogeneous Cognitive Radio Sensor Network

Sensors ◽  
2021 ◽  
Vol 21 (9) ◽  
pp. 2997
Author(s):  
Md. Tahidul Islam ◽  
Sithamparanathan Kandeepan ◽  
Robin. J. Evans
Keyword(s):  
Cognitive Radio ◽  
Sensor Network ◽  
Dynamic Network ◽  
Optimal Number ◽  
Matlab Simulation ◽  
Cognitive Radio Sensor Network ◽  
Rendezvous Technique ◽  
Central Controller ◽  
Blind Rendezvous ◽  
Analytical Expressions

In a distributed cognitive radio (CR) sensor network, transmission and reception on vacant channels require cognitive radio nodes to achieve rendezvous. Because of the lack of adequate assistance from the network environment, such as the central controller and other nodes, assisted rendezvous for distributed CR is inefficient in a dynamic network. As a result, non-assisted blind rendezvous, which is unaware of its counterpart node, has recently led to a lot of interest in the research arena. In this paper, we study a channel rendezvous method based on prime number theory and propose a new multi-radio-based technique for non-assisted rendezvous with the blind and heterogeneous condition. The required time and the optimal number of radios for the guaranteed rendezvous are calculated using probability-based measurement. Analytical expressions for probabilistic guaranteed rendezvous conditions are derived and verified by Monte Carlo simulation. In addition, the maximum time to rendezvous (MTTR) is derived in closed form using statistical and probabilistic analysis. Under different channel conditions, our proposed solution leads to a substantial time reduction for guaranteed rendezvous. For the sake of over-performance of our proposed system, the simulation outcome is compared to a recently proposed heterogeneous and blind rendezvous method. The Matlab simulation results show that our proposed system’s MTTR gains range from 11% to over 95% for various parametric values of the system model.

Sign in / Sign up

Export Citation Format

Share Document