Power allocation in cognitive radio networks by the reinforcement learning scheme with the help of shapley value of games

2Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we present an algorithm based on the reinforcement learning scheme with the help of Shapley value of game for power allocation in the cognitive radio networks. The goal is to optimize the achievable transmission rates for secondary users and simultaneously to maximize their usefulness in the coalition. A performance measure is formed as a weighted linear function of the probability of the idle channel amongst N cooperating secondary users. Then, the problem is formulated as a semi-Markov decision process with an average cost criterion and reinforcement learning algorithm is developed to an approximate optimal control policy. The proposed scheme is driven by an estimated dynamic model of cognitive radio network learning simultaneously with the use of the Shapley value of games, to form the best coalition. The simulations are provided to compare the effectiveness of the proposed method against other methods under a variety of traffic conditions with some well-known policies. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Martyna, J. (2012). Power allocation in cognitive radio networks by the reinforcement learning scheme with the help of shapley value of games. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7469 LNCS, pp. 316–327). https://doi.org/10.1007/978-3-642-32686-8_29

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free