.png){kind=icon}
.png){kind=icon}
Return
Guaranteed Rendezvous Algorithms for Cognitive Radio Networks
.png){kind=icon}
PRE
AI
L
X
C
M
DOI：10.1109/CC.2018.8387991.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Rendezvous is a blind process establishing a communication link on a common channel between a pair of nodes in cognitive radio networks. We propose two guaranteed rendezvous algorithms for cognitive radio networks under both single-radio and multi-radio scenarios with an asynchronous setting. For single-radio scenario, each cycle length is a prime number associated with a channel hopping sequence. The rendezvous can be guaranteed as long as the IDs of the two nodes are different. For multi-radio scenario, we propose a cycle length and rotation based rendezvous algorithm. Each node generates a channel hopping sequence with only one cycle length. Then these radios of each nodes rotate on the generated sequence with different rotation numbers at each hopping cycle. The rendezvous between two nodes is guaranteed as long as they have different cycle lengths or the same cycle length with different number of rotations. We conduct simulations on three metrics and the results show that the proposed algorithms outperform the existing ones.
Keywords:
cognitive radio networks
blind rendezvous
channel hopping
cycle length
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.1
Papers:
1.8K
Citations:
5.0K
Organization
Cited Papers