By Topic

Rendezvous for Cognitive Radios

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Theis, N.C. ; Dept. of Electr. & Comput. Eng., Air Force Inst. of Technol., Wright-Patterson AFB, OH, USA ; Thomas, R.W. ; DaSilva, L.A.

Cognitive radios have been touted as a solution to communicating in a Dynamic Spectrum Access environment. This paper examines how cognitive radios initially find one another among the expanse of ever-changing open spectrum, termed the rendezvous problem. Specifically, it addresses the problem of rendezvous under varying levels of system capabilities, spectrum policies, and environmental conditions. The focus is on rendezvous when there are are no control channels or centralized controllers, which we term the blind rendezvous problem. Under these conditions, a sequence-based and modular clock blind rendezvous algorithms are proposed, and it is shown that the performance of these algorithms compares favorably to that of a random blind rendezvous algorithm. Specifically, the sequence-based algorithm provides a bounded Time To Rendezvous (TTR) and the ability to prioritize channels where rendezvous is more likely to occur; the modular clock algorithm reduces the expected TTR, requires little precoordination among radios attempting to rendezvous, and is robust to radios sensing different sets of available channels.

Published in:

Mobile Computing, IEEE Transactions on  (Volume:10 ,  Issue: 2 )