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

Supporting Fast Rendezvous Guarantee by Randomized Quorum and Latin Square for Cognitive Radio Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
2
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 15 publications
(3 citation statements)
references
References 32 publications
0
2
0
Order By: Relevance
“…Due to the unique mathematical properties of Latin square arrays, they are widely used in the field of communication [21,22]. They can also be applied in key negotiations.…”
Section: Related Workmentioning
confidence: 99%
“…Due to the unique mathematical properties of Latin square arrays, they are widely used in the field of communication [21,22]. They can also be applied in key negotiations.…”
Section: Related Workmentioning
confidence: 99%
“…The Quorum and Latin square Channel Hopping (QLCH) protocol is proposed in [15], where the time slots for secondary users are divided into default and switching slots. In [16], an efficient channel hopping protocol called randomized QLCH protocol (RQL) is proposed. Nodes running RQL may change their original channel hopping sequences dynamically according to their intended receivers.…”
Section: Related Work and New Approachmentioning
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%