Dynamic Programming and Optimal Control
Dynamic Programming and Optimal Control
SCHEDULING IN A QUEUING SYSTEM WITH ASYNCHRONOUSLY VARYING SERVICE RATES
Probability in the Engineering and Informational Sciences
In-band spectrum sensing in cognitive radio networks: energy detection or feature detection?
Proceedings of the 14th ACM international conference on Mobile computing and networking
Eigenvalue-based spectrum sensing algorithms for cognitive radio
IEEE Transactions on Communications
Opportunistic spectrum access for energy-constrained cognitive radios
IEEE Transactions on Wireless Communications
Opportunistic Spectrum Access via Periodic Channel Sensing
IEEE Transactions on Signal Processing
Sensing-Throughput Tradeoff for Cognitive Radio Networks
IEEE Transactions on Wireless Communications
IEEE Transactions on Information Theory
Adaptive sensing scheduling for cognitive radio systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
Wireless Personal Communications: An International Journal
Power Control and Allocation for MIMO Broadcast Channels in Cognitive Radio Networks
Wireless Personal Communications: An International Journal
Hi-index | 0.00 |
We consider a cognitive radio (CR) network that makes opportunistic use of a set of channels licensed to a primary network. During operation, the CR network is required to carry out spectrum sensing to detect active primary users, thereby avoiding interfering with them. However, spectrum sensing may cause negative effect on the performance of the CR network, as all CR communications has to be postponed during channel sensing. This paper focuses on adaptively scheduling spectrum sensing and data transmission so that negative impacts to the performance of the CR network are minimized. We first consider the case when CR nodes always have data to transmit and experience time-varying channels. Based on knowledge of channel conditions, the sensing periods are adaptively scheduled to maximize the spectrum efficiency of the CR operation. We show how optimal sensing/transmission scheduling policies can be obtained and prove some important structural properties of such optimal policies. We then consider the case when CR nodes experience both stochastic data arrival and time-varying channels. By treating each sensing period as a 'virtual sensing packet', we convert the problem of joint spectrum-sensing/data-transmission scheduling into a standard queueing model. Based on that, an efficient scheduling algorithm that takes into account channel and queue conditions of the CR network is proposed.