Multiple Radios for Fast Rendezvous in Heterogeneous Cognitive Radio Networks

Li, Aohan; Han, Guangjie; Ohtsuki, Tomoaki

doi:10.1109/access.2019.2904942

Cited by 10 publications

(3 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Mathematical construction of sunflower sets is exploited to develop the SSS rendezvous algorithm In [28], the authors presented two novel CH schemes for multi-radio cognitive users with and without a synchronized time clock to rendezvous blindly in every time slot. In [29], the Hybrid Radios Rendezvous (HRR) algorithm is proposed to address users equipped with different numbers of radios. In [30], the authors proposed a homogeneous multi-radio channel-hopping (CH) rendezvous algorithm which achieves improved (exact) maximum-TTR and is a linear function of a number of available channels instead of quadratic functions in heterogeneous multi-radio algorithms.…”

Section: B Multiple Radiosmentioning

confidence: 99%

On Cooperative Channel Rendezvous in Cognitive Radio Networks

et al. 2019

View full text Add to dashboard Cite

In cognitive radio (CR) networks, establishing communication sessions requires the communicating pairs to meet each other on a common channel via a ''rendezvous'' process. Designing distributed rendezvous protocols without common control channels is a challenging problem due to the dynamic and opportunistic spectrum access paradigm. The existing protocols, mainly based on channel hopping, suffer from the rendezvous difficulty due to asymmetric channel perceptions and significant rendezvous delay when the system scales. In this paper, we exploit a long-neglected opportunity for enabling rendezvous in CR networks-the cooperation among cognitive users. We develop a novel cooperative rendezvous mechanism by introducing the cooperative cognitive nodes serving as ''bridges'' between communicating pairs to facilitate their rendezvous process. We establish a mathematics framework to study the rendezvous delay and robustness and derive the performance limit in asymptotic scenarios. Our analytical results are further confirmed by the simulation results showing the performance improvement of the developed cooperative rendezvous protocol with only small overhead. INDEX TERMS Cognitive radio (CR), cooperative communication, research problems.The associate editor coordinating the review of this manuscript and approving it for publication was Yan Zhang.

show abstract

Section: B Multiple Radiosmentioning

confidence: 99%

On Cooperative Channel Rendezvous in Cognitive Radio Networks

et al. 2019

View full text Add to dashboard Cite

show abstract

“…Efficient rendezvous based on the matrix was proposed in [ 32 ], where the process was based on a local channel set. Different scenarios were suggested in [ 33 , 34 , 35 ], where authors achieved quick rendezvous with the presence of multiple radios for different heterogeneous conditions. The contributions of the most notable recent article [ 34 ] having blind and heterogeneous environment are as follows, (i) it proposed blind rendezvous strategies in the presence of distributed heterogeneous cognitive radio network (CRN); (ii) it achieved quick rendezvous with concepts such as single-radio, multi-radio and hybrid radio; (iii) for effective rendezvous, distinct rendezvous strategies for different combinations of radios were presented; (iv) the authors calculated TTR’s potential upper limit as well as the optimum number of radios.…”

Section: Introductionmentioning

confidence: 99%

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

Islam

Kandeepan

Evans

2021

Sensors

View full text Add to dashboard Cite

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.

show abstract

“…In general, the current CSS research including the hard decision fusion rule and soft decision rule, assume that the received average SNRs are approximately the same at each of the SU. This assumption simplifies the calculation of the final sensing performance, including the probability of detection and probability of false alarm . On the other hand, when considering the channel shadowing effect, it cannot handle the practical inhomogeneous situations, where the average SNR varies among cooperative users.…”

Section: Introductionmentioning

confidence: 99%

Efficient evidence‐based decision fusion scheme for cooperative spectrum sensing in cognitive radio networks

Simpson

Sun

2020

Trans Emerging Tel Tech

View full text Add to dashboard Cite

In this article, an evidence based decision fusion cooperative spectrum sensing (CSS) schemes has been considered for overcoming the hidden terminal problem, improving reliability, and increasing SU agility. Under practical conditions, the combination of conflicting evidences with the classical Dempster-Shafer theory (DS theory) rule may produce counter-intuitive results when combining the secondary users (SUs) sensing data evidence leading to poor CSS performance. In order to overcome and minimize the effect of conflicting data, and to enhance performance of the CSS system, a novel efficient evidence-based decision fusion scheme CSS is proposed. The approach is based on the credibility of evidence from the SUs sensing decision, which represents the similarity or the relation among the different SUs sensing data evidence, and a dissociability degree measure that indicates the quality or clarity of the SUs sensing data evidence. Furthermore, a weighted averaging factor determined by the credibility and dissociability of the SU sensing data evidence is proposed. Simulation results presented show that under practical conditions the proposed scheme enhances the performance of the CSS system when compared to traditional fusion rules that do not take into account the difference in local sensing reliability between the SUs.

show abstract

Multiple Radios for Fast Rendezvous in Heterogeneous Cognitive Radio Networks

Cited by 10 publications

References 30 publications

On Cooperative Channel Rendezvous in Cognitive Radio Networks

On Cooperative Channel Rendezvous in Cognitive Radio Networks

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

Efficient evidence‐based decision fusion scheme for cooperative spectrum sensing in cognitive radio networks

Contact Info

Product

Resources

About