Abstract

In order to enhance the Quality of Service (QoS) for the secondary users (SUs) in Cognitive Radio (CR) networks reasonably, in this paper, we propose an adjustable admission control scheme considering an access threshold under a centralized architecture. We assume that a buffer is set for all the SUs. On the arrival instant of an SU packet, if the number of SU packets already in the buffer is equal to or greater than the access threshold that is set in advance, this SU packet will be admitted to join the system with an adjustable access probability, which is inversely proportional to the total number of packets in the system. Based on the adjustable admission control scheme proposed in this paper, considering the priority of the primary users (PUs) in CR networks, we build a preemptive priority queueing model. Aiming to comply with the digital nature of modern networks, we establish a two-dimensional discrete-time Markov chain (DTMC) and construct the transition probability matrix of the Markov chain. Accordingly, we provide the formulas for several performance measures, such as the blocking rate, the throughput and the average latency of the SU packets. With numerical results, we show the influence of the access threshold on different performance measures for the SU packets. Finally, taking into account the trade-off between different performance measures, we build a net benefit function to find the optimal access threshold with an optimization algorithm.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.