Please use this identifier to cite or link to this item: https://doi.org/10.1109/icc.2011.5962447
DC FieldValue
dc.titleOpportunistic spectrum access for cognitive radio in the presence of reactive primary users
dc.contributor.authorChe, Y.L.
dc.contributor.authorZhang, R.
dc.contributor.authorGong, Y.
dc.date.accessioned2014-06-19T03:21:45Z
dc.date.available2014-06-19T03:21:45Z
dc.date.issued2011
dc.identifier.citationChe, Y.L., Zhang, R., Gong, Y. (2011). Opportunistic spectrum access for cognitive radio in the presence of reactive primary users. IEEE International Conference on Communications : -. ScholarBank@NUS Repository. https://doi.org/10.1109/icc.2011.5962447
dc.identifier.isbn9781612842332
dc.identifier.issn05361486
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/71266
dc.description.abstractOpportunistic spectrum access (OSA) is a key technique for the secondary user (SU) in a Cognitive Radio network to transmit over the "spectrum holes" unoccupied by the primary user (PU). Most existing work on the design of OSA has assumed a non-reactive (NR) PU model, i.e., the PU transmission on-off status is independent of the SU access policy, which may not be practical. In this paper, we propose a new Reactive Primary User (RPU) model for the study of OSA, where the PU's access probability over a particular channel is related to the SU's past access history. We model the channel occupancy of the RPU as a 4-state memoryless Markov chain, as opposed to the conventional 2-state (on/off) counterpart, where the expanded state space and state transition probabilities are used to model the reactions of the PU subject to the SU transmit collision. Under this model, we formulate the optimal OSA design for the SU's throughput maximization as a finite-horizon partially observable Markov decision process (POMDP) problem, subject to a conditional collision probability constraint for protecting the PU. Because of the high complexity of the proposed problem, we further propose a separation principle to obtain the optimal policy for the SU with implementable complexity. Numerical results show the new tradeoff between the SU's and the PU's throughput under the RPU model, as compared to the conventional NRPU model. © 2011 IEEE.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/icc.2011.5962447
dc.sourceScopus
dc.typeConference Paper
dc.contributor.departmentELECTRICAL & COMPUTER ENGINEERING
dc.description.doi10.1109/icc.2011.5962447
dc.description.sourcetitleIEEE International Conference on Communications
dc.description.page-
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.