Quality of Service Provisioning for Heterogeneous Services in Cognitive Radio-enabled Internet of Things

Ali, A, Feng, L, Bashir, AK ORCID: https://orcid.org/0000-0001-7595-2522, Shaker, SH, Ahmed, SH, Iqbal, M and Raja, G (2020) Quality of Service Provisioning for Heterogeneous Services in Cognitive Radio-enabled Internet of Things. IEEE Transactions on Network Science and Engineering, 7 (1). pp. 328-342.

Preview

Accepted Version Available under License In Copyright. Download (1MB) | Preview

Abstract

IEEE The Internet of Things (IoT) is a network of interconnected objects, in which every object in the world seeks to communicate and exchange information actively. This exponential growth of interconnected objects increases the demand for wireless spectrum. However, providing wireless channel access to every communicating object while ensuring its guaranteed quality of service (QoS) requirements is challenging and has not yet been explored, especially for IoT-enabled mission-critical applications and services. Meanwhile, Cognitive Radio-enabled Internet of Things (CR-IoT) is an emerging field that is considered the future of IoT. The combination of CR technology and IoT can better handle the increasing demands of various applications such as manufacturing, logistics, retail, environment, public safety, healthcare, food, and drugs. However, due to the limited and dynamic resource availability, CR-IoT cannot accommodate all types of users. In this paper, we first examine the availability of a licensed channel on the basis of its primary users' activities (e.g., traffic patterns). Second, we propose a priority-based secondary user (SU) call admission and channel allocation scheme, which is further based on a priority-based dynamic channel reservation scheme. The objective of our study is to reduce the blocking probability of higher-priority SU calls while maintaining a sufficient level of channel utilization. The arrival rates of SU calls of all priority classes are estimated using a Markov chain model, and further channels for each priority class are reserved based on this analysis. We compare the performance of the proposed scheme with the greedy non-priority and fair proportion schemes in terms of the SU call-blocking probability, SU call-dropping probability, channel utilization, and throughput. Numerical results show that the proposed priority scheme outperforms the greedy non-priority and fair proportion schemes.