A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Fully Distributed Channel-Hopping Algorithms for Rendezvous Setup in Cognitive Multiradio Networks
2016
IEEE Transactions on Vehicular Technology
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-Sets-based (SSS) pairwise
doi:10.1109/tvt.2015.2510359
fatcat:y4hu7w3l2zay7bns7dsjxqfs2y