Skip to Main content Skip to Navigation
Conference papers

Optimal Admission Control of Secondary Users in Preemptive Cognitive Radio Networks

Abstract : We study optimal admission control of secondary users (SUs) in cognitive radio (CR) networks in presence of preemption. In this model, when a primary user (PU) arrives to the system and finds all the channels busy, it preempts an SU unless all the users in the system are PUs. We apply admission control on the SUs only. Using dynamic programming (DP), we find the optimal admission control policy that maximizes the long- run average profit. As our main contribution, we show that the optimal admission control of the SUs depends only on the total number of users in the system (i.e. it does not depend on the number of PUs and SUs in the system individually) and is of threshold type. Therefore, although the system is modeled as a two-dimensional Markov chain, our findings allow simple and efficient computa- tion of the optimal control policy.
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s Connect in order to contact the contributor
Submitted on : Monday, December 10, 2012 - 5:04:06 PM
Last modification on : Wednesday, December 12, 2012 - 10:25:55 AM
Long-term archiving on: : Monday, March 11, 2013 - 12:51:41 PM


Explicit agreement for this submission


  • HAL Id : hal-00763408, version 1



Aylin Turhan, Murat Alanyali, David Starobinski. Optimal Admission Control of Secondary Users in Preemptive Cognitive Radio Networks. WiOpt'12: Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, May 2012, Paderborn, Germany. pp.138-144. ⟨hal-00763408⟩



Record views


Files downloads