This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Rendezvous for Cognitive Radios
February 2011 (vol. 10 no. 2)
pp. 216-227
ASCII Text
x 
 
Nick C. Theis, Ryan W. Thomas, Luiz A. DaSilva, "Rendezvous for Cognitive Radios," IEEE Transactions on Mobile Computing, vol. 10, no. 2, pp. 216-227, February, 2011.
 
 
BibTex
x
 
@article{ 10.1109/TMC.2010.60,
author = {Nick C. Theis and Ryan W. Thomas and Luiz A. DaSilva},
title = {Rendezvous for Cognitive Radios},
journal ={IEEE Transactions on Mobile Computing},
volume = {10},
number = {2},
issn = {1536-1233},
year = {2011},
pages = {216-227},
doi = {http://doi.ieeecomputersociety.org/10.1109/TMC.2010.60},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Mobile Computing
TI - Rendezvous for Cognitive Radios
IS - 2
SN - 1536-1233
SP216
EP227
EPD - 216-227
A1 - Nick C. Theis,
A1 - Ryan W. Thomas,
A1 - Luiz A. DaSilva,
PY - 2011
KW - Dynamic spectrum access
KW - cognitive radio
KW - cognitive network
KW - spectrum sensing
KW - rendezvous.
VL - 10
JA - IEEE Transactions on Mobile Computing
ER -
 
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.

[1] K. Balachandran and J. Kang, "Neighbor Discovery with Dynamic Spectrum Access in Adhoc Networks," Proc. IEEE Vehicular Technology Conf. (VTC '06), vol. 2, pp. 512-517, May 2006.
[2] M.M. Buddhikot, P. Kolodzy, S. Miller, K. Ryan, and J. Evans, "DIMSUMNet: New Directions in Wireless Networking Using Coordinated Dynamic Spectrum Access," Proc. Sixth IEEE Int'l Symp. World of Wireless Mobile and Multimedia Networks (WOWMOM '05), pp. 78-85, 2005.
[3] Y. Xiao and F. Hu, Cognitive Radio Networks. CRC Press, 2008.
[4] J. Mo, H.-S.W. So, and J. Warland, "Comparison of Multichannel MAC Protocols," IEEE Trans. Mobile Computing, vol. 7, no. 1, pp. 50-65, June 2008.
[5] P. Sutton, K. Nolan, and L. Doyle, "Cyclostationary Signatures for Rendezvous in OFDM-Based Dynamic Spectrum Access Networks," Proc. IEEE Int'l Symp. New Frontiers in Dynamic Spectrum Access Networks (DySPAN '07), pp. 220-231, Apr. 2007.
[6] L. Cao and H. Zheng, "Distributed Spectrum Allocation Via Local Bargaining," Proc. Second Ann. IEEE Comm. Soc. Conf. Sensor and Ad Hoc Comm. and Networks (SECON '05), pp. 475-486, Sept. 2005.
[7] B. Horine and D. Turgut, "Link Rendezvous Protocol for Cognitive Radio Networks," Proc. IEEE Int'l Symp. New Frontiers in Dynamic Spectrum Access Networks (DySPAN '07), pp. 444-447, Apr. 2007.
[8] B. Horine and D. Turgut, "Performance Analysis of Link Rendezvous Protocol for Cognitive Radio Networks," Proc. Second IEEE Int'l Conf. Cognitive Radio Oriented Wireless Nerworks and Comm. (CROWNCOM '07), pp. 503-507, Aug. 2007.
[9] P. Sutton, K. Nolan, and L. Doyle, "Cyclostationary Signatures in Practical Cognitive Radio Applications," IEEE J. Selected Areas in Comm., vol. 26, no. 1, pp. 13-24, Jan. 2008.
[10] C. Arachchige, S. Venkatesan, and N. Mittal, "An Asynchronous Neighbor Discovery Algorithm for Cognitive Radio Networks," Proc. IEEE Int'l Symp. New Frontiers in Dynamic Spectrum Access Networks (DySPAN '08), pp. 1-5, Oct. 2008.
[11] M.D. Silvius, F. Ge, A. Young, A.B. MacKenzie, and C.W. Bostian, "Smart Radio: Spectrum Access for First Responders," Proc. SPIE, 2008.
[12] S. Alpern and S. Gal, The Theory of Search Game and Rendezvous. Springer, 2003.
[13] Bluetooth SIG, "How Bluetooth Works—Communications," 2008.
[14] E. Anderson and R. Weber, "The Rendezvous Problem on Discrete Locations," J. Applied Probability and Statistics, vol. 28, pp. 839-851, 1990.
[15] L. Ma and C.-C. Shen, "Security-Enhanced Virtual Channel Rendezvous Algorithm for Dynamic Spectrum Access Wireless Networks," Proc. IEEE Int'l Symp. New Frontiers in Dynamic Spectrum Access Networks (DySPAN '08), pp. 1-9, Oct. 2008.
[16] L. DaSilva and I. Guerreiro, "Sequence Based Rendezvous for Dynamic Spectrum Access," Proc. IEEE Int'l Symp. New Frontiers in Dynamic Spectrum Access Networks (DySPAN '08), pp. 1-7, Oct. 2008.
[17] D. Sarwate, "Optimum PN Sequences for CDMA Sequences," Proc. IEEE Symp. Spread Spectrum Techniques and Applications, pp. 27-35, 1994.
[18] D.R. Stinson, Cryptography: Theory and Practice. CRC Press, 1995.

Index Terms:
Dynamic spectrum access, cognitive radio, cognitive network, spectrum sensing, rendezvous.
Citation:
Nick C. Theis, Ryan W. Thomas, Luiz A. DaSilva, "Rendezvous for Cognitive Radios," IEEE Transactions on Mobile Computing, vol. 10, no. 2, pp. 216-227, Feb. 2011, doi:10.1109/TMC.2010.60
Usage of this product signifies your acceptance of the Terms of Use.