NeXt generation/dynamic spectrum access/cognitive radio wireless networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Dynamic spectrum access in WLAN channels: empirical model and its stochastic analysis
TAPAS '06 Proceedings of the first international workshop on Technology and policy for accessing spectrum
Opportunistic Spectrum Access via Periodic Channel Sensing
IEEE Transactions on Signal Processing
A Decision-Theoretic Framework for Opportunistic Spectrum Access
IEEE Wireless Communications
On myopic sensing for multi-channel opportunistic access: structure, optimality, and performance
IEEE Transactions on Wireless Communications - Part 2
Decentralized cognitive MAC for opportunistic spectrum access in ad hoc networks: A POMDP framework
IEEE Journal on Selected Areas in Communications
Cognitive Medium Access: Constraining Interference Based on Experimental Models
IEEE Journal on Selected Areas in Communications
Optimal sensing strategy for opportunistic secondary users in a cognitive radio network
Proceedings of the 13th ACM international conference on Modeling, analysis, and simulation of wireless and mobile systems
| Hi-index | 0.00 |
The problem of cognitive access of parallel channels occupied by primary users is considered. The transmissions of primary users are modeled as independent continuous-time Markov processes. A secondary cognitive user employs a slotted transmission format and a periodic sensing strategy such that it decides if and where to transmit according to its sensing outcomes. The objective of the cognitive user is to maximize its throughput while satisfying collision constrains imposed by the primary users. Three access policies are analyzed. The optimal access policy is obtained based on a formulation of constrained Markov decision processes. A simple suboptimal memoryless policy is obtained by the use of instantaneous sensing outcome. As an upper bound of the optimal policy, a memoryless policy assuming the access of full channel states is also considered. For a symmetric system, we show that the simple memoryless policy is asymptotically optimal when the collision constraint is tight by proving that the performances of all three policies converge to the same value.