Please use this identifier to cite or link to this item:
|Title:||On design of opportunistic spectrum access in the presence of reactive primary users||Authors:||Che, Y.L.
Opportunistic spectrum access
Partially observable Markov decision process (POMDP)
Reactive primary user
|Issue Date:||2013||Citation:||Che, Y.L., Zhang, R., Gong, Y. (2013). On design of opportunistic spectrum access in the presence of reactive primary users. IEEE Transactions on Communications 61 (7) : 2678-2691. ScholarBank@NUS Repository. https://doi.org/10.1109/TCOMM.2013.050813.120877||Abstract:||Opportunistic spectrum access (OSA) is a key technique enabling the secondary users (SUs) in a cognitive radio (CR) network to transmit over the «spectrum holes» unoccupied by the primary users (PUs). In this paper, we focus on the OSA design in the presence of reactive PUs, where PU's access probability in a given channel is related to SU's past access decisions. We model the channel occupancy of the reactive PU as a 4-state discrete-time Markov chain. We formulate the optimal OSA design for SU throughput maximization as a constrained finite-horizon partially observable Markov decision process (POMDP) problem. We solve this problem by first considering the conventional short-term conditional collision probability (SCCP) constraint. We then adopt a long-term PU throughput (LPUT) constraint to effectively protect the reactive PU transmission. We derive the structure of the optimal OSA policy under the LPUT constraint and propose a suboptimal policy with lower complexity. Numerical results are provided to validate the proposed studies, which reveal some interesting new tradeoffs between SU throughput maximization and PU transmission protection in a practical interaction scenario. © 1972-2012 IEEE.||Source Title:||IEEE Transactions on Communications||URI:||http://scholarbank.nus.edu.sg/handle/10635/82808||ISSN:||00906778||DOI:||10.1109/TCOMM.2013.050813.120877|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.