Efficient Asynchronous Channel Hopping Design for Cognitive Radio Networks

Chao, Chih–Min; Hsu, Chien-Yu; Ling, Yun-Ting

doi:10.1109/tvt.2015.2490722

Cited by 15 publications

(3 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Due to the limitations of a CCC for rendezvous, many researchers focus on CH rendezvous algorithms for establishing communication link in CRNs [7,13,[17][18][19][20][21][22][23][24][25][26][27][28][29][30]. The above studies have shown to be the solutions for rendezvous in CRN.…”

Section: Related Workmentioning

confidence: 99%

Quality of Service Aware Channel Hopping Rendezvous in Cognitive Radio Networks for Internet of Things

Asifuddola¹,

Chishti²

2021

IJCDS

View full text Add to dashboard Cite

Section: Related Workmentioning

confidence: 99%

Quality of Service Aware Channel Hopping Rendezvous in Cognitive Radio Networks for Internet of Things

Asifuddola¹,

Chishti²

2021

IJCDS

View full text Add to dashboard Cite

“…Unique IDentifications (IDs) of SUs are utilized to generate CH sequences for the ID-based CH algorithms [24]. Because IEEE 802.22 uses a 48-bit universal MAC address to identify SUs, the IDs of SUs are usually generated by exploiting these MAC addresses in the existing ID-based CH algorithms [4], [16]. The unique ID can be expressed as a binary string with equal length terms as ID string [9].…”

Section: Introductionmentioning

confidence: 99%

Multiple Radios for Fast Rendezvous in Heterogeneous Cognitive Radio Networks

Han

Ohtsuki

2019

IEEE Access

View full text Add to dashboard Cite

In cognitive radio networks (CRNs), if two unlicensed secondary users (SUs) want to communicate with each other, they need to rendezvous with each other on the same channel at the same time. Rendezvous is the first key step for SUs to be able to communicate with each other. Channel hopping (CH) is a representative technique to solve the rendezvous problem in CRNs. SUs equipped with multiple radios can significantly reduce the time-to-rendezvous (TTR) for several existing CH algorithms while the additional cost is low. However, several drawbacks exist in the existing CH algorithms based on multiple radios. One of the main drawbacks is that they cannot be well applied in heterogeneous CRNs. The reason is that the number of radios for different SUs is implicitly assumed same or must be more than one in the existing CH algorithms based on multiple radios, which is unrealistic for heterogeneous CRNs. In heterogeneous CRNs, SUs may be equipped with different numbers of radios including one radio. To mainly address the above issue, hybrid radios rendezvous (HRR) algorithm is proposed in this paper. Moreover, the upper bounds of maximum TTR (MTTR) for the HRR algorithm are derived by a theoretical analysis. Furthermore, extensive simulations are performed to evaluate the expected TTR (ETTR), the MTTR, and the channel qualities of the rendezvous channels for the HRR algorithm. Simulation results show that rendezvous can be guaranteed by the HRR algorithm in heterogenous CRNs. Besides, the qualities of the rendezvous channels can be improved by the HRR algorithm. In addition, our algorithms can achieve rendezvous faster than several existing algorithms.INDEX TERMS Cognitive radio networks, multiple radios, blind rendezvous, channel hopping.

show abstract

“…Recently, a number of sequence‐based CH rendezvous approaches (cf. [8–40]) have been developed to achieve bounded MTTR for any pair of rendezvous nodes. However, the rendezvous difficulty problem for the discovery of a common channel between two rendezvous nodes still remains because they cannot exchange any information regarding the asymmetric perceptions of channel availability.…”

Section: Introductionmentioning

confidence: 99%