.png){kind=icon}
.png){kind=icon}
Return
Difference-Set-Based Channel Hopping for Minimum-Delay Blind Rendezvous in Multi-Radio Cognitive Radio Networks
.png){kind=icon}
PRE
AI
X
J
元
DOI：10.1109/TVT.2019.2906455.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Rendezvous in the blind fashion is known as one of the most robust and effective ways for cognitive users (CUs) to exchange control information under the dynamic interference of primary users (PUs). Earlier, no existing scheme could guarantee CUs to rendezvous blindly in each timeslot, which makes them experience relatively long exchange delay. Based on the mathematical concept of relaxed cyclic difference set (DS), this paper proposes two novel channel hopping (CH) schemes for multi-radio CUs with and without a synchronized time clock to rendezvous blindly in every timeslot. This achievement of minimum rendezvous delay is especially useful for such delay-sensitive applications as real-time voice and emergency communications. Moreover, based on a special class of DS, the proposed two schemes can closely approach the theoretical lower bound on the number of radio transceivers for CUs to rendezvous blindly in every timeslot and, hence, minimizes their required hardware complexity to exchange control information at the minimum rendezvous delay. Numerical simulation shows that, under dynamic PU interference, the proposed schemes outperform the existing ones in terms of the average throughput and delay of CUs.
Keywords:
Channel hopping
rendezvous
cognitive radio network
delay
difference set
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.1
Papers:
1.7W
Citations:
6.6W
Organization
No organization information available
Cited Papers