Dynamic programming: deterministic and stochastic models
Dynamic programming: deterministic and stochastic models
Neuro-Dynamic Programming
Handbook of Learning and Approximate Dynamic Programming (IEEE Press Series on Computational Intelligence)
Fundamental design tradeoffs in cognitive radio systems
TAPAS '06 Proceedings of the first international workshop on Technology and policy for accessing spectrum
Approximate Dynamic Programming: Solving the Curses of Dimensionality (Wiley Series in Probability and Statistics)
Optimal selection of channel sensing order in cognitive radio
IEEE Transactions on Wireless Communications
Optimality of myopic sensing in multichannel opportunistic access
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
On myopic sensing for multi-channel opportunistic access: structure, optimality, and performance
IEEE Transactions on Wireless Communications - Part 2
Decentralized quickest change detection
IEEE Transactions on Information Theory
Decentralized cognitive MAC for opportunistic spectrum access in ad hoc networks: A POMDP framework
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Selective quickest spectrum sensing, which monitors the spectrum activity in multiple channels, is studied for multichannel cognitive radio systems with nonnegligible channel switching time (blind period). The spectrum sensor needs to detect the emergence of primary users as quickly as possible. Due to hardware limitation, it is assumed that only a subset of frequency channels can be monitored simultaneously. The problem of controlling the monitoring procedure is studied in the frameworks of dynamic programming (DP). System states and cost functions are defined. Cost-to-go functions for DP are derived, simplified, and approximated, based on which control policies are derived. Numerical results are provided to demonstrate the proposed algorithms.