Abstract
Recent years have witnessed significant growth in the area of Internet of things (IoT) and is further expected to increase manifolds in the foreseeable future. Such a massive usage of IoT comes with spectrum scarcity issues. In the last few years, Cognitive Radio Network (CRN) has been widely researched because of its potential to be an effective solution to the problem of spectrum scarcity. The unlicensed users in CRN need to rendezvous on a commonly available channel for the purpose of necessary information exchange. Channel hopping (CH) is one of the representative technique to achieve rendezvous in CRNs in which users hop among available channels according to a pre-defined sequence. Providing guaranteed rendezvous which is fair and having full rendezvous diversity in minimum possible time is a challenging issue in CRN. In this paper, we propose an asymmetric asynchronous CH algorithm that provides guaranteed, fair and full rendezvous diversity among the users. The idea is to construct sender and receiver matrices to generate CH sequences based on the number of available channels of sender and receiver. Analytical and simulation results verify that the proposed algorithm outperform some existing state of the art rendezvous algorithms in terms of maximum time to rendezvous (MTTR), provide full rendezvous diversity and rendezvous fairness among the users.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Akhtar F, Rehmani MH, Reisslein M (2016) White space: definitional perspectives and their role in exploiting spectrum opportunities. Telecommun Policy 40(4):319–331. https://doi.org/10.1016/j.telpol.2016.01.003
Akyildiz IF, Lee W-Y, Vuran MC, Mohanty S (2006) NeXt generation/dynamic spectrum access/cognitive radio wireless networks: a survey. Comput Netw 50(13):2127–2159. https://doi.org/10.1016/j.comnet.2006.05.001
Aslam S, Ejaz W, Ibnkahla M (2018) Energy and spectral efficient cognitive radio sensor networks for internet of things. IEEE Internet Things J 5(4):3220–3233. https://doi.org/10.1109/jiot.2018.2837354
Bian K, Jung-Min P (2013) Maximizing rendezvous diversity in rendezvous protocols for decentralized cognitive radio networks. IEEE Trans Mob Comput 12(7):1294–1307. https://doi.org/10.1109/tmc.2012.103
Bukhari SHR, Rehmani MH, Siraj S (2016) A survey of channel bonding for wireless networks and guidelines of channel bonding for futuristic cognitive radio sensor networks. IEEE Commun Surv Tutor 18(2):924–948. https://doi.org/10.1109/comst.2015.2504408
Chang G-Y, Teng W-H, Chen H-Y, Sheu J-P (2014) Novel channel-hopping schemes for cognitive radio networks. IEEE Trans Mob Comput 13(2):407–421. https://doi.org/10.1109/tmc.2012.260
Chang C-S, Yang G-C, Chiang M-H, Kwong WC (2017a) Construction of synchronous-symmetric channel-hopping sequences over galois extension field for cognitive radio networks. IEEE Commun Lett 21(6):1425–1428. https://doi.org/10.1109/lcomm.2017.2680438
Chang G-Y, Wang S-Y, Liu Y-X (2017b) A jamming-resistant channel hopping scheme for cognitive radio networks. IEEE Trans Wirel Commun 16(10):6712–6725. https://doi.org/10.1109/twc.2017.2728659
Chang Y-C, Chang C-S, Sheu J-P (2018) An enhanced fast multi-radio rendezvous algorithm in heterogeneous cognitive radio networks. IEEE Trans Cogn Commun Netw 4(4):847–859. https://doi.org/10.1109/tccn.2018.2871208
Cordeiro C, Challapali K, Birru D, Shankar S (2005) IEEE 802.22: the first worldwide wireless standard based on cognitive radios. First IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks, 2005. DySPAN 2005:328–337. https://doi.org/10.1109/dyspan.2005.1542649
Dos Santos PMR, Kalil MA, Artemenko O, Lavrenko A, Mitschele-Thiel A (2013) Self-organized common control channel design for Cognitive Radio Ad Hoc Networks. In: 2013 IEEE 24th annual international symposium on personal, indoor, and mobile radio communications (PIMRC), 2419–2423. Doi: https://doi.org/10.1109/pimrc.2013.6666551
Ghasemi A, Sousa ES (2008) Spectrum sensing in cognitive radio networks: requirements, challenges and design trade-offs. IEEE Commun Mag 46(4):32–39. https://doi.org/10.1109/mcom.2008.4481338
Li J, Zhao H, Wei J, Ma D, Zhou L (2018) Sender-jump receiver-wait: a simple blind rendezvous algorithm for distributed cognitive radio networks. IEEE Trans Mob Comput 17(1):183–196. https://doi.org/10.1109/tmc.2017.2703166
Lin Z, Liu H, Chu X, Leung Y-W (2013) Enhanced Jump-stay rendezvous algorithm for cognitive radio networks. IEEE Commun Lett 17(9):1742–1745. https://doi.org/10.1109/lcomm.2013.071013.131029
Liu H, Lin Z, Chu X, Leung Y-W (2010) Ring-walk based channel-hopping algorithms with guaranteed rendezvous for cognitive radio networks. In: 2010 IEEE/ACM Int’l conference on green computing and communications & int’l conference on cyber, physical and social computing, pp 755–760. https://doi.org/10.1109/greencom-cpscom.2010.30
Liu H, Lin Z, Chu X, Leung Y-W (2012a) Jump-stay rendezvous algorithm for cognitive radio networks. IEEE Trans Parallel Distrib Syst 23(10):1867–1881. https://doi.org/10.1109/tpds.2012.22
Liu H, Lin Z, Chu X, Leung Y-W (2012) Taxonomy and challenges of rendezvous algorithms in cognitive radio networks. In: 2012 International conference on computing, networking and communications (ICNC), pp 645–649. Doi: https://doi.org/10.1109/iccnc.2012.6167502
Paul R, Choi Y-J (2016) Adaptive rendezvous for heterogeneous channel environments in cognitive radio networks. IEEE Trans Wirel Commun 15(11):7753–7765. https://doi.org/10.1109/twc.2016.2607170
Sahoo PK, Sahoo D (2016) Sequence-based channel hopping algorithms for dynamic spectrum sharing in cognitive radio networks. IEEE J Sel Areas Commun 34(11):2814–2828. https://doi.org/10.1109/jsac.2016.2615258
Sheu J-P, Lin J-J (2018) A multi-radio rendezvous algorithm based on chinese remainder theorem in heterogeneous cognitive radio networks. IEEE Trans Mob Comput 17(9):1980–1990. https://doi.org/10.1109/tmc.2018.2790408
Sheu J-P, Su C-W, Chang G-Y (2016) Asynchronous quorum-based blind rendezvous schemes for cognitive radio networks. IEEE Trans Commun 64(3):918–930. https://doi.org/10.1109/tcomm.2015.2508803
Federal Communications Commission (2002) Spectrum policy task force report (FCC Document ET Docket No. 02-155)
Stevenson C, Chouinard G, Lei Z, Wendong Hu, Shellhammer S, Caldwell W (2009) IEEE 802.22: the first cognitive radio wireless regional area network standard. IEEE Commun Mag 47(1):130–138. https://doi.org/10.1109/mcom.2009.4752688
Xin CS, Ullah S, Song M, Wu Z, Gu Q, Cui H (2018) Throughput oriented lightweight near-optimal rendezvous algorithm for cognitive radio networks. Comput Netw 137:49–60. https://doi.org/10.1016/j.comnet.2018.03.009
Yu L, Liu H, Leung Y-W, Chu X, Lin Z (2015) Multiple radios for fast rendezvous in cognitive radio networks. IEEE Trans Mob Comput 14(9):1917–1931. https://doi.org/10.1109/tmc.2014.2366746
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Asifuddola, M., Chishti, M.A. A novel fast and fair asynchronous channel hopping rendezvous scheme in cognitive radio networks for internet of things. J Ambient Intell Human Comput 14, 6123–6135 (2023). https://doi.org/10.1007/s12652-021-03019-w
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12652-021-03019-w