Computer Science – Distributed – Parallel – and Cluster Computing
Scientific paper
2011-02-23
Computer Science
Distributed, Parallel, and Cluster Computing
Scientific paper
We propose a dynamic spectrum access scheme where secondary users recommend "good" channels to each other and access accordingly. We formulate the problem as an average reward based Markov decision process. We show the existence of the optimal stationary spectrum access policy, and explore its structure properties in two asymptotic cases. Since the action space of the Markov decision process is continuous, it is difficult to find the optimal policy by simply discretizing the action space and use the policy iteration, value iteration, or Q-learning methods. Instead, we propose a new algorithm based on the Model Reference Adaptive Search method, and prove its convergence to the optimal policy. Numerical results show that the proposed algorithms achieve up to 18% and 100% performance improvement than the static channel recommendation scheme in homogeneous and heterogeneous channel environments, respectively, and is more robust to channel dynamics.
Chen Xu
Huang Jianwei
Li Husheng
No associations
LandOfFree
Adaptive Channel Recommendation For Opportunistic Spectrum Access does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Adaptive Channel Recommendation For Opportunistic Spectrum Access, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Adaptive Channel Recommendation For Opportunistic Spectrum Access will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-174664