2012 Spring Congress on Engineering and Technology 2012
DOI: 10.1109/scet.2012.6342033
|View full text |Cite
|
Sign up to set email alerts
|

A Repeated Group Sequence Rendezvous Scheme for Cognitive Radio Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2014
2014
2014
2014

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 5 publications
0
2
0
Order By: Relevance
“…The sequence is used by each node to decide the order in which the available channels are to be visited. This sequence should guarantee a successful rendezvous, even when each node has joined the CR network at different times [14]. In the HS-GRSP, each node uses a rendezvous sequence to visit the available channels to search for each other, when each node starts to look for another node at different times.…”
Section: Hopping Sequence Guaranteeing Rendezvous Within a Single Periodmentioning
confidence: 99%
“…The sequence is used by each node to decide the order in which the available channels are to be visited. This sequence should guarantee a successful rendezvous, even when each node has joined the CR network at different times [14]. In the HS-GRSP, each node uses a rendezvous sequence to visit the available channels to search for each other, when each node starts to look for another node at different times.…”
Section: Hopping Sequence Guaranteeing Rendezvous Within a Single Periodmentioning
confidence: 99%
“…Kim et al [30,31] proposed an asynchronous channel-hopping mechanism called a hopping sequence guaranteeing rendezvous within a single period (HS-GRSP). It generates two sequences, a group sequence and a guard sequence.…”
Section: Hopping Sequence Guaranteeing Rendezvous Within a Single Periodmentioning
confidence: 99%