Abstract
The primary objective of the cognitive radio network (CRN) is to improve the spectrum utilization and achieve significant packet delivery ratio (PDR). However, CRN is high failure prone due to the node mobility and primary user (PU) interference. This article presents a robust routing protocol to handle failure during data transmission in CRN. In this protocol, each node maintains a list of candidates for next hop and orders them based on common channels. Most of the existing routing protocols trigger the rerouting on detection of the link failure, while our protocol uses the alternate link (forwarding node) to transmit data rather than rerouting. Thus, it achieves significant PDR with a controlled end to end delay. Finally, the performance of protocol has been evaluated through extensive simulation experiments. The simulation results conform that our protocol is robust and guarantee higher data delivery despite PU interference as compared to existing protocols.
Similar content being viewed by others
References
Akyildiz, I. F., Lee, W.-Y., Vuran, M. C., & Mohanty, S. (2006). NeXt generation/dynamic spectrum access/cognitive radio wireless networks: A survey. Computer Networks, 50, 2127–2159.
Li, C., Liu, W., Li, J., Liu, Q., & Li, C. (2013). Aggregation based spectrum allocation in cognitive radio networks. In 2013 IEEE/CIC international conference on communications in China-workshops (CIC/ICCC), pp. 50–54.
Nekovee, M. (2009). Quantifying the availability of TV white spaces for cognitive radio operation in the UK. In IEEE international conference on communications workshops, 2009. ICC workshops 2009, pp. 1–5.
Kamruzzaman, S. M., Jeong, D. G. (2010). Routing protocols for cognitive radio networks: A survey. Journal of Information Industrial Engineering, 16, 153–169.
Marina, M. K., & Das, S. R. (2001). Ad hoc on-demand multipath distance vector (AOMDV) routing. In Proceedings of ICNP.
Rath, M., Pattanayak, B. K., & Pati, B. (2016). Energy efficient MANET protocol using cross layer design for military applications. Defence Science Journal, 66, 146–150.
Ding, L., Melodia, T., Batalama, S. N., Matyjas, J. D., & Medley, M. J. (2010). Cross-layer routing and dynamic spectrum allocation in cognitive radio ad hoc networks. IEEE Transactions on Vehicular Technology, 59, 1969–1979.
Wang, J., Yue, H., Hai, L., & Fang, Y. (2017). Spectrum-aware anypath routing in multi-hop cognitive radio networks. IEEE Transactions on Mobile Computing, 16, 1176–1187.
Caleffi, M., Akyildiz, I. F., & Paura, L. (2012). OPERA: Optimal routing metric for cognitive radio ad hoc networks. IEEE Transactions on Wireless Communications, 11, 2884–2894.
Liu, Y., Cai, L. X., & Shen, X. S. (2012). Spectrum-aware opportunistic routing in multi-hop cognitive radio networks. IEEE Journal on Selected Areas in Communications, 30, 1958–1968.
Tang, F., Tang, C., Yang, Y., Yang, L. T., Zhou, T., Li, J., et al. (2017). Delay-minimized routing in mobile cognitive networks for time-critical automation applications. IEEE Transactions on Industrial Informatics, 13(3), 1398–1409.
Jin, X., Zhang, R., Sun, J., & Zhang, Y. (2014). TIGHT: A geographic routing protocol for cognitive radio mobile ad hoc networks. IEEE Transactions on Wireless Communications, 13, 4670–4681.
Kamruzzaman, S., Kim, E., Jeong, D. G., & Jeon, W. S. (2012). Energy-aware routing protocol for cognitive radio ad hoc networks. IET Communications, 6, 2159–2168.
Zareei, M., Mohamed, E. M., Anisi, M. H., Rosales, C. V., Tsukamoto, K., & Khan, M. K. (2016). On-demand hybrid routing for cognitive radio ad-hoc network. IEEE Access, 4, 8294–8302.
Chen, Y.-W., Liao, P.-Y., & Wang, Y.-C. (2016). A channel-hopping scheme for continuous rendezvous and data delivery in cognitive radio network. Peer-to-Peer Networking and Applications, 9, 16–27.
Barve, S. S., & Kulkarni, P. (2014). Multi-agent reinforcement learning based opportunistic routing and channel assignment for mobile cognitive radio ad hoc network. Mobile Networks and Applications, 19, 720–730.
Ping, S., Aijaz, A., Holland, O., & Aghvami, A. (2015). SACRP: A spectrum aggregation-based cooperative routing protocol for cognitive radio ad-hoc networks. IEEE Transactions on Communications, 63(6), 2015–2030.
Chowdhury, K. R., & Akyildiz, I. F. (2011). CRP: A routing protocol for cognitive radio ad hoc networks. IEEE Journal on Selected Areas in Communications, 29, 794–804.
Basak, S., & Acharya, T. (2015). Joint power allocation and routing in outage constrained cognitive radio ad hoc networks. Mobile Networks and Applications, 20, 636–648.
Liu, X., Li, B., & Liu, G. (2018). Simultaneous cooperative spectrum sensing and energy harvesting in multi-antenna cognitive radio. Mobile Networks and Applications, 23(2), 263–271.
Hu, H., Zhang, H., & Yu, H. (2014). Efficient spectrum sensing with minimum transmission delay in cognitive radio networks. Mobile Networks and Applications, 19, 487–501.
Xing, X., Jing, T., Cheng, W., Huo, Y., Cheng, X., & Znati, T. (2014). Cooperative spectrum prediction in multi-PU multi-SU cognitive radio networks. Mobile Networks and Applications, 19, 502–511.
Liu, X., Chen, K., Yan, J., & Na, Z. (2016). Optimal energy harvesting-based weighed cooperative spectrum sensing in cognitive radio network. Mobile Networks and Applications, 21, 908–919.
Supraja, P., & Pitchai, R. (2017). Spectrum prediction in cognitive radio with hybrid optimized neural network. Mobile Networks and Applications. https://doi.org/10.1007/s11036-017-0909-7.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendix
Appendix
Theorem
The protocol guarantees loop freedom.
Proof
We prove it by contradiction. Say, there exists a path that contains a loop. Thus, we may infer that some packet pi visited a node ni more than once. As per our protocol, each packet maintains a dynamic list (PT) of visited nodes and next hop node is selected from the nodes excluding the elements of PT. Since pi visited ni more than once, ni was selected by pi as next hop node just before the subsequent visit to ni despite node ni being present in PT. It is a contradiction. Therefore, the initial assumption is infeasible, and theorem holds.
Rights and permissions
About this article
Cite this article
Kumar, S., Singh, A.K. Fault Tolerant Routing Protocol in Cognitive Radio Networks. Wireless Pers Commun 107, 679–694 (2019). https://doi.org/10.1007/s11277-019-06296-z
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11277-019-06296-z