Competitive Markov decision processes
Competitive Markov decision processes
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Introduction to Stochastic Search and Optimization
Introduction to Stochastic Search and Optimization
Cognitive Wireless Communication Networks
Cognitive Wireless Communication Networks
Optimal adaptive modulation and coding with switching costs
IEEE Transactions on Communications
Monotonicity of constrained optimal transmission policies in correlated fading channels with ARQ
IEEE Transactions on Signal Processing
IEEE Transactions on Signal Processing
Opportunistic scheduling for streaming multimedia users in high-speed downlink packet access (HSDPA)
IEEE Transactions on Multimedia
Cognitive radio: brain-empowered wireless communications
IEEE Journal on Selected Areas in Communications
Layered multicast rate control based on Lagrangian relaxation and dynamic programming
IEEE Journal on Selected Areas in Communications
Decentralized cognitive MAC for opportunistic spectrum access in ad hoc networks: A POMDP framework
IEEE Journal on Selected Areas in Communications
Convergence rate control for distributed multi-hop wireless mesh networks
Computers and Electrical Engineering
Hi-index | 0.00 |
This paper considers an uplink time division multiple access (TDMA) cognitive radio network where multiple cognitive radios (secondary users) attempt to access a spectrum hole. We assume that each secondary user can access the channel according to a decentralized predefined access rule based on the channel quality and the transmission delay of each secondary user. By modeling secondary user block fading channel qualities as a finite state Markov chain, we formulate the transmission rate adaptation problem of each secondary user as a general-sum Markovian dynamic game with a delay constraint. Conditions are given so that the Nash equilibrium transmission policy of each secondary user is a randomized mixture of pure threshold policies. Such threshold policies can be easily implemented. We then present a stochastic approximation algorithm that can adaptively estimate the Nash equilibrium policies and track such policies for non-stationary problems where the statistics of the channel and user parameters evolve with time.