Abstract
In cognitive radio networks (CRNs), second users (SUs) exploit spectrum holes by accessing multiple channels opportunistically. In such a dynamic-spectrum-access network, the SUs equipped with cognitive radios have to establish rendezvous on a common channel before they are able to communicate with each other. Due to the intermittent appearance of primary users’ signals, SUs have to access the channels opportunistically, which makes the rendezvous problem challenging. This paper focuses on blind rendezvous where neither any central controller nor common control channel is available. Under an opportunistic framework, we propose the concept of channel availability to measure the dynamic feature of channels, and we study the pairwise effective rendezvous problem systematically, for which a simple yet efficient and flexible opportunistic method is proposed. We further extend our method to the many-to-one rendezvous problem for fairness consideration. The performances of our solutions are evaluated via both theoretical analysis and extensive simulations.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Akyildiz, I.F., Lee, W., Vuran, M.C., Mohanty, S.: NeXt generation dynamic spectrum access cognitive radio wireless networks: A survey. Computer Networks Journal 50(13), 2127–2159 (2006)
Kim, H., Shin, K.G.: Efficient Discovery of Spectrum Opportunities with MAC-Layer Sensing in Cognitive Radio Networks. IEEE Transactions on Mobile Computing 7(5), 533–545 (2008)
Cordeiro, C., Challapali, K., Birru, D., Sai, N.S.: IEEE 802.22: the first worldwide wireless standard based on cognitive radios. In: DySPAN, pp.328–337 (2005)
Jia, J., Zhang, Q., Shen, X.: HC-MAC: A Hardware-Constrained Cognitive MAC for Efficient Spectrum Management. IEEE Journal on Selected Areas in Communications 26(1), 106–117 (2008)
Lin, Z., Liu, H., Chu, X., Leung, Y.: Jump-stay based channel-hopping algorithm with guaranteed rendezvous for cognitive radio networks. In: INFOCOM, pp. 2444–2452 (2011)
Zhang, Y., Li, Q., Yu, G., Wang, B.: ETCH: Efficient Channel Hopping for communication rendezvous in dynamic spectrum access networks. In: INFOCOM, pp. 2471–2479 (2011)
Bian, K., Park, J.M.: Asynchronous channel hopping for establishing rendezvous in cognitive radio networks. In: INFOCOM, pp. 236–240 (2011)
Bian, K., Park, J.M., Chen, R.: A quorum-based framework for establishing control channels in dynamic spectrum access networks. In: MOBICOM, pp. 25–36 (2009)
Brent, H., Damla, T.: Link Rendezvous Protocol for Cognitive Radio Networks. In: DySPAN, pp. 444–447 (2007)
Liang, Q., Liu, M., Yuan, D.: Channel Estimation for Opportunistic Spectrum Access: Uniform and Random Sensing. Accepted by IEEE Transactions on Mobile Computing
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Duan, Y., Liu, G., Cai, Z. (2012). Opportunistic Channel-Hopping Based Effective Rendezvous Establishment in Cognitive Radio Networks. In: Wang, X., Zheng, R., Jing, T., Xing, K. (eds) Wireless Algorithms, Systems, and Applications. WASA 2012. Lecture Notes in Computer Science, vol 7405. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31869-6_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-31869-6_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31868-9
Online ISBN: 978-3-642-31869-6
eBook Packages: Computer ScienceComputer Science (R0)