2017
DOI: 10.1109/tvt.2017.2726352
|View full text |Cite
|
Sign up to set email alerts
|

Symmetric Channel Hopping for Blind Rendezvous in Cognitive Radio Networks Based on Union of Disjoint Difference Sets

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
11
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 32 publications
(11 citation statements)
references
References 32 publications
0
11
0
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%
“…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%
“…Non-assisted rendezvous, on the other hand, is one that operates without the assistance of a central controller (or another node) and does not have a CCC. There are many approaches for non-assisted rendezvous techniques presented in the conventional references [ 12 , 13 , 14 , 15 , 16 , 17 , 18 , 19 , 20 , 21 , 22 , 23 , 24 , 25 , 26 , 27 ]. The general terminologies used for our articles related to rendezvous are summarized as follows: Channel Symmetricity : For the symmetric channel, the cognitive radio transmitter (CR-Tx) and cognitive radio receiver (CR-Rx) have the same available channels.…”
Section: Introductionmentioning
confidence: 99%
“…Many recent papers on rendezvous presume two conditions of the channel—symmetric and asymmetric. In the literature below [ 14 , 15 ], rendezvous for homogeneous conditions such as symmetric channels is noted. Rendezvous techniques based on the union of disjoint differential sets were proposed in [ 14 ] and performance was shown in average time and efficiency.…”
Section: Introductionmentioning
confidence: 99%
“…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%