A Fast Multi-Radio Rendezvous Algorithm in Heterogeneous Cognitive Radio Networks

Chang, Cheng-Shang; Chang, Yeh-Cheng; Sheu, Jang‐Ping

doi:10.1109/icc.2018.8422845

Cited by 6 publications

(2 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For enhanced MTTR, multi-radio-based rendezvous for the homogeneous condition was recommended in [ 30 ]. Multiple-radio-based rendezvous with upper bound was illustrated in [ 31 ]. The average time for rendezvous was reduced significantly with different combinations 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

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

show abstract

“…A number of works have been conducted on how to design channel hopping (CH) sequences for this fundamental problem in CRNs [2]. Existing works can be categorized from different perspectives as follows: (1) According to whether users can adopt the same CH strategy, they are divided into Asymmetric role [3][4][5] and Symmetric role [6]; (2) According to the status of available channels, they can be divided into Homogeneous channels [7], Heterogeneous channels [8], Channel invariant [9], and Channel variable [10]; (3) According to whether users start CH at the same time, they can be divided into Asynchronous clock [11,12] and Synchronous clock [13]; (4) According to one or more users receiving information, they can be divided into Pairwise destination (Unicast) [14] and Multiple destination (Multicast) [15]. The ideal CH algorithms are expected to give good performance in terms of the maximum time-to-rendezvous (MTTR) (i.e.…”

mentioning

confidence: 99%

An efficient coprime integer sets based rendezvous algorithm for distributed cognitive radio networks

Wei,

Liu,

Lin

et al. 2023

Electronics Letters

View full text Add to dashboard Cite

Multichannel blind rendezvous problem is a fundamental problem in cognitive radio networks (CRNs). It refers to how to ensure that any two secondary users can meet on a common available channel at the same time. In this paper, an efficient channel hopping algorithm, called CISR (Coprime Integer Sets based Rendezvous), is designed for asymmetric role model (i.e. users can be divided into two types of roles, say, sender/leader and receiver/follower) in distributed CRNs. CISR can guarantee the rendezvous of the leader and follower and lowers the upper bound of both the maximum time to rendezvous and expected time to rendezvous by carefully constructing two coprime integer sets. The simulation results show that CISR has the near‐optimal performance.

show abstract

An Enhanced Fast Multi-Radio Rendezvous Algorithm in Heterogeneous Cognitive Radio Networks

Chang

Sheu

2018

IEEE Trans. Cogn. Commun. Netw.

View full text Add to dashboard Cite

A Fast Multi-Radio Rendezvous Algorithm in Heterogeneous Cognitive Radio Networks

Cited by 6 publications

References 7 publications

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

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

An efficient coprime integer sets based rendezvous algorithm for distributed cognitive radio networks

An Enhanced Fast Multi-Radio Rendezvous Algorithm in Heterogeneous Cognitive Radio Networks

Contact Info

Product

Resources

About