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 ◽  
...  
2018 ◽  
Vol 19 (2) ◽  
pp. 118-133
Author(s):  
Sayyed Majid Mazinani ◽  
Sara Moshtaghi

ABSTRACT: Cognitive radio sensor network (CRSN) is a new generation of communication systems that wants to solve the overcrowded spectrum utilization of the unlicensed bands. It has combined sensor networks and cognitive radio technology, so it has the challenges of energy restriction of sensors and also dynamic spectrum access of the cognitive radio network. On the other hand, considering both of these challenges in the routing protocol plays a basic role in network performance and we can’t apply the routing protocols that have been proposed for wireless sensor networks and cognitive radio networks, separately, in the CRSN. Therefore, this article has tried to provide a new spectrum and energy-aware routing protocol in which the source is able to choose the most stable route in the aspect of node residual energy or spectrum access probability. Not only can considering the nodal residual energy and spectrum access in the route discovery process avoid repetitive link failure, but it also can increase the network lifetime. This protocol has been compared with ESAC, SCR, ERP, and SER. The result of this comparison has shown that our protocol reduces end-to-end delay, control overhead, throughput, and lifetime in comparison to other protocols, especially in small-scale networks. ABSTRAK: Rangkaian sensor radio kognitif (CRSN) adalah generasi baru sistem telekomunikasi bagi menyelesaikan masalah kesesakan pada pemakaian band spektrum tidak berlesen. Ianya adalah kombinasi rangkaian sensor dan teknologi radio kognitif. Oleh itu, ia mempunyai cabaran sekatan tenaga pada sensor dan kemasukan spektrum secara dinamik pada rangkaian radio kognitif. Pada masa sama, dengan mengambil kira kedua-dua cabaran pada protokol rangkaian ini telah memainkan peranan asas pada prestasi rangkaian dan kami tidak boleh mengguna pakai protokol rangkaian yang telah diguna pakai pada rangkaian sensor tanpa wayar dan rangkaian radio kognitif secara asing dalam CRSN. Oleh itu, artikel ini cuba menyediakan spektrum baru dan pengawasan tenaga pada protokol rangkaian, di mana sumber boleh memilih laluan rangkaian yang stabil dengan mengambil kira pada aspek baki tenaga  nod atau kebarangkalian akses spektrum. Selain itu, ianya dapat mengelakkan kegagalan laluan berulang juga menambahkan jangka hayat rangkaian. Protokol ini telah dibandingkan dengan ESAC, SCR, ERP dan SER. Perbandingan keputusan menunjukkan protokol ini mengurangkan kelewatan hujung-ke-hujung, mengawal kesesakan, mambaiki jumlah penghantaran dan menambah tempoh hayat berbanding protokol lain, khususnya pada rangkaian skala kecil.


2017 ◽  
Vol 66 (1) ◽  
pp. 831-843 ◽  
Author(s):  
Deyu Zhang ◽  
Zhigang Chen ◽  
Ju Ren ◽  
Ning Zhang ◽  
Mohamad Khattar Awad ◽  
...  

Sensors ◽  
2021 ◽  
Vol 21 (9) ◽  
pp. 2997
Author(s):  
Md. Tahidul Islam ◽  
Sithamparanathan Kandeepan ◽  
Robin. J. Evans

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