Sequence-Based Rendezvous for Dynamic Spectrum Access

In the context of dynamic spectrum access (DSA), rendezvous refers to the ability of two or more radios to meet and establish a link on a common channel. In decentralized networks, this is often accomplished by each radio visiting potential channels in random fashion, in a process that we call blind random rendezvous. In this work, we propose the use of sequences that determine the order with which radios visit potentially available channels. Through sequence-based rendezvous, it is possible to: (i) establish an upper bound to the time to rendezvous (TTR); (ii) establish a priority order for channels in which rendezvous occurs; (Hi) reduce the expected TTR as compared to random rendezvous. We provide an example of a family of sequences and derive the expected time-to- rendezvous using this method. We also describe how the method can be adopted when one or more primary users are detected in the channels of interest.

[1]  D. V. Sarwate,et al.  Optimum PN sequences for CDMA systems , 1994, Proceedings of IEEE 3rd International Symposium on Spread Spectrum Techniques and Applications (ISSSTA'94).

[2]  Milind M. Buddhikot,et al.  DIMSUMnet: new directions in wireless networking using coordinated dynamic spectrum , 2005, Sixth IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks.

[3]  Allen B. MacKenzie,et al.  Smart radio: spectrum access for first responders , 2008, SPIE Defense + Commercial Sensing.

[4]  D. Turgut,et al.  Link Rendezvous Protocol for Cognitive Radio Networks , 2007, 2007 2nd IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks.

[5]  Linda Doyle,et al.  Cyclostationary Signatures in Practical Cognitive Radio Applications , 2008, IEEE Journal on Selected Areas in Communications.