Modelling Analysis of Channel Assembling in CRNs Based on Priority Scheduling Strategy with Reserved Queue

Abstract

In cognitive radio networks, channel assembling allows secondary users (SUs) to expand network capacity and improve spectrum utilization. Scheduling strategies only based on heterogeneous service classification cannot guarantee the delivery priority of vital elastic services in special scenarios such as emergency rescue. Therefore, a priority scheduling strategy with reserved queue (Ps-rq) is proposed in this work. A static factor is defined to classify SUs into elastic services and real-time services based on message type, while a dynamic factor is defined to differentiate high-priority elastic services based on information validity, message correlation and message size. The high-priority users in the interrupted elastic services are placed in the reserved queue to ensure its services. Accordingly, the scheduling algorithm and the dynamic channel access process is presented. A continuous-time Markov chain analysis is conducted and all possible transition states, trigger events, transition rates and transition conditions of the system starting from a general state are derived. Furthermore, evaluation indexes of system performance are obtained. Study cases and simulation results prove that the proposed strategy can enhance network capacity, reduce blocking probability and forced termination probability for secondary users, and notably enhance the performance of high-priority elastic services. In addition, we analyze the characteristics of Ps-rq through a comprehensive comparison with four other schemes. The experiment proves that the Ps-rq strategy can effectively improve the service quality of the vital elastic services on the basis of providing fair scheduling.