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

Fully Distributed Channel-Hopping Algorithms for Rendezvous Setup in Cognitive Multiradio Networks

Abstract: Abstract-Channel rendezvous is a vital step to form a cognitive radio network (CRN). It is intractable to guarantee rendezvous for secondary users (SUs) within a short finite time in asynchronous, heterogeneous, and anonymous CRNs. However, most previous heterogeneous algorithms rely on explicit SUs' identifiers (IDs) to guide rendezvous, which is not fully distributed. In this paper, we exploit the mathematical construction of sunflower sets to develop a single-radio sunflower set (SSS)-based pairwise rendezv… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
22
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 36 publications
(22 citation statements)
references
References 33 publications
0
22
0
Order By: Relevance
“…However, establishing rendezvous under the asymmetric model is more difficult due to the fewer common channels.Heterogeneous sensing capabilities: Most of the existing CH schemes are homogeneous where they assume that all SUs can sense and access the whole global channel set (GCS). However, due to the inherent limitation and heterogeneity of CR-sensing capabilities, SUs can only sense and detect fractions of the GCS which are usually heterogeneous among SUs [21,22]. Accordingly, CH schemes which design their CH sequence for heterogeneous CRs are more practical.…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations
“…However, establishing rendezvous under the asymmetric model is more difficult due to the fewer common channels.Heterogeneous sensing capabilities: Most of the existing CH schemes are homogeneous where they assume that all SUs can sense and access the whole global channel set (GCS). However, due to the inherent limitation and heterogeneity of CR-sensing capabilities, SUs can only sense and detect fractions of the GCS which are usually heterogeneous among SUs [21,22]. Accordingly, CH schemes which design their CH sequence for heterogeneous CRs are more practical.…”
Section: Introductionmentioning
confidence: 99%
“…On the other hand, each of the above categories can be classified according to the channel information utilized to generate the CH sequence into two classes: Global-Channel-based (GC) and Local-Channel-based (LC) schemes [21,22]. The GC schemes utilize the whole GCS to generate their CH sequences where SUs keep hopping on the available and unavailable channels for attempting rendezvous.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Therefore, channel hopping (CH) has been proposed as an alternative approach for rendezvous without the need for any predefined CCC. The existing CH-based rendezvous schemes were designed with omnidirectional antenna according to different mathematical structures (e.g., [9][10][11][12][13][14][15][16][17][18]) in order to provide a successful channel rendezvous between a pair of single-hop SUs. In the CH approach, each SU generates its CH sequence 2 Wireless Communications and Mobile Computing based on the available channels that are sensed to be idle from any PU activities within its omnidirectional range.…”
Section: Introductionmentioning
confidence: 99%
“…Current algorithms suitable for multi-rendezvous utilize concepts of traditional, user-to-user rendezvous and either add or adapt features to scale the solution [7,15,2]. Most rendezvous algorithms rely on a channel hopping scheme where users "hop" onto different frequencies in a specified sequence or pattern in order to achieve rendezvous [13,4,12]. Some classic blind rendezvous algorithms that use channel hopping sequences are the Generated Orthogonal Sequence, Modular Clock, and Modified Modular Clock algorithms, etc.…”
Section: Related Workmentioning
confidence: 99%