Adjustable admission control with threshold in centralized CR networks: Analysis and optimization

6Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

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 in uence 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.

Cite

CITATION STYLE

APA

Zhao, Y., Jin, S., & Yue, W. (2015). Adjustable admission control with threshold in centralized CR networks: Analysis and optimization. Journal of Industrial and Management Optimization, 11(4), 1393–1408. https://doi.org/10.3934/jimo.2015.11.1393

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free