Abstract
Establishment of wireless communication links among the cognitive radio (CR) users via rendezvous on commonly available channels is the crucial process in cognitive radio ad hoc networks. Extant rendezvous methods utilize the channel hopping (CH) technique (also referred as blind rendezvous) and generate the CH sequence on the top of potential licensed channels and employ random replace operation to contrive the CH sequence for individual CR user. However, incorporation of random replace operation may exhibit poorer performance with the increase in the number of available channels owing to the severe decrease in the probability of replacing an unavailable channel with the same available channel by two or more CR users. In this paper, we present a channel-ranking rendezvous procedure that ranks available channels based on the received SINR and constructs the CH sequence by replacing the unavailable channels with higher ranked available channels. We verify the superiority of channel-ranking procedure through extensive simulation, and the simulation results confirm that utilization of channel-ranking mechanism severely maximizes the rendezvous occurrence probability as compared with the random replace operation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Akyildiz IF, Lee WY, Vuran MC, Mohanty S (2006) Next generation/dynamic spectrum access/cognitive radio wireless networks: a survey. Comput. Netw. 50(13):2127–2159
Akyildiz IF, Lee WY, Chowdhury KR (2009) CRAHNs: cognitive radio ad hoc networks. Ad Hoc Netw. 7(5):810–836
Chawla M, Ukey ASA, Reshma P (2017) Comprehensive asynchronous symmetric rendezvous algorithm in cognitive radio networks. Sadhana 42(11):1825–1834
Liu H, Lin Z, Chu X, Leung YW (2012) Taxonomy and challenges of rendezvous algorithms in cognitive radio networks. In: 2012 international conference on computing, networking and communications (ICNC). IEEE Press, Maui, USA, pp 645–649
Joshi GP, Nam SY, Kim SW (2014) Rendezvous issues in ad hoc cognitive radio networks. KSII Trans. Internet Inform. Syst. 8(11):3655–3673
Htike Z, Hong CS, Lee S (2013) The life cycle of the rendezvous problem of cognitive radio ad hoc networks: a survey. J. Comput. Sci. Eng. 7(2):81–88
Ukey ASA, Chawla M (2018) Rendezvous in cognitive radio ad hoc networks: a survey. Int. J. Ad Hoc Ubiquitous Comput. 29(4):233–254
Liu H, Lin Z, Chu X, Leung YW (2012) Jump-stay rendezvous algorithm for cognitive radio networks. IEEE Trans. Parallel Distrib. Syst. 23(10):1867–1881
Lin Z, Liu H, Chu X, Leung YW (2013) Enhanced jump-stay rendezvous algorithm for cognitive radio networks. IEEE Commun. Lett. 17(9):1742–1745
Gandhi R, Wang CC, Hu YC (2012) Fast rendezvous for multiple clients for cognitive radios using coordinated channel hopping. In: 9th annual IEEE communications society conference on sensor, mesh and ad hoc communications and networks. IEEE Press, Seoul, South Korea, pp 434–442
Gu Z, Hua QS, Wang Y, Lau FC (2013) Nearly optimal asynchronous blind rendezvous algorithm for cognitive radio networks. IN: 2013 international conference on sensing, communications and networking (SECON). IEEE Press, New Orleans, LA, pp 371–379
Chuang I, Wu HY, Lee KR, Kuo YH (2013) Alternate hop-and-wait channel rendezvous method for cognitive radio networks. In: Proceedings IEEE INFOCOM’13. IEEE Press, Seoul, South Korea, pp 746–754
Chuang IH, Wu HY, Kuo YH (2014) A fast blind rendezvous method by alternate hop-and-wait channel hopping in cognitive radio networks. IEEE Trans. Mobile Comput. 13(10):2171–2184
Yang B, Zheng M, Liang W (2016) A time-efficient rendezvous algorithm with a full rendezvous degree for heterogeneous cognitive radio networks. In: 35th annual IEEE international conference on computer communications. IEEE Press, San Francisco, CA, pp. 1–9
Qi X, Gao R, Liu L, Yang W (2017) ADFC-CH: adjusted disjoint finite cover rendezvous algorithms for cognitive radio networks. Wirel. Netw. 24(7):2621–2630
Ohize H, Dlodlo M (2016) Ant colony system based control channel selection scheme for guaranteed rendezvous in cognitive radio ad-hoc network. In: 27th annual international symposium on personal, indoor, and mobile radio communications (PIMRC). IEEE Press, Valencia, Spain, pp 1–7
Stevenson CR, Chouinard G, Lei Z, Hu W, Shellhammer SJ, Caldwell W (2009) IEEE 802.22: the first cognitive radio wireless regional area network standard. IEEE Commun. Mag. 47(1):130–138
Huang XL, Zhai YB, Wu J, Xu Y, Wu X, Wu X (2014) Channel quality ranking in cognitive radio networks. In: 10th international conference on wireless communications, networking and mobile computing. IEEE Press, Beijing, China, pp 191–194
Elderini T, Kaabouch N, Reyes H (2017) Channel quality estimation metrics in cognitive radio networks: a survey. IET Commun. 11(8):1173–1179
Ohize H, Dlodlo M (2017) A channel hopping algorithm for guaranteed rendezvous in cognitive radio ad hoc networks using swarm intelligence. Wirel. Pers. Commun. 96(1):879–893
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Ukey, A.S.A., Chawla, M. (2020). On Maximizing Blind Rendezvous Probability in Cognitive Radio Ad Hoc Networks. In: Janyani, V., Singh, G., Tiwari, M., d’Alessandro, A. (eds) Optical and Wireless Technologies . Lecture Notes in Electrical Engineering, vol 546. Springer, Singapore. https://doi.org/10.1007/978-981-13-6159-3_17
Download citation
DOI: https://doi.org/10.1007/978-981-13-6159-3_17
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-6158-6
Online ISBN: 978-981-13-6159-3
eBook Packages: EngineeringEngineering (R0)