Issue No. 02 - February (2011 vol. 10)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TMC.2010.60
Nick C. Theis , Air Force Institute of Technology, Wright-Patterson AFB
Ryan W. Thomas , Air Force Institute of Technology, Wright-Patterson AFB
Luiz A. DaSilva , Virginia Tech, Arlington and Trinity University, Dublin
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.
Dynamic spectrum access, cognitive radio, cognitive network, spectrum sensing, rendezvous.
N. C. Theis, R. W. Thomas and L. A. DaSilva, "Rendezvous for Cognitive Radios," in IEEE Transactions on Mobile Computing, vol. 10, no. , pp. 216-227, 2010.