EURASIP Journal on Wireless Communications and Networking | Vol.2010, Issue.1 | 2017-05-29 | Pages
Multiagent -Learning for Aloha-Like Spectrum Access in Cognitive Radio Systems
An Aloha-like spectrum access scheme without negotiation is considered for multiuser and multichannel cognitive radio systems. To avoid collisions incurred by the lack of coordination, each secondary user learns how to select channels according to its experience. Multiagent reinforcement leaning (MARL) is applied for the secondary users to learn good strategies of channel selection. Specifically, the framework of -learning is extended from single user case to multiagent case by considering other secondary users as a part of the environment. The dynamics of the -learning are illustrated using a Metrick-Polak plot, which shows the traces of -values in the two-user case. For both complete and partial observation cases, rigorous proofs of the convergence of multiagent -learning without communications, under certain conditions, are provided using the Robins-Monro algorithm and contraction mapping, respectively. The learning performance (speed and gain in utility) is evaluated by numerical simulations.
Original Text (This is the original text for your reference.)
Multiagent -Learning for Aloha-Like Spectrum Access in Cognitive Radio Systems
An Aloha-like spectrum access scheme without negotiation is considered for multiuser and multichannel cognitive radio systems. To avoid collisions incurred by the lack of coordination, each secondary user learns how to select channels according to its experience. Multiagent reinforcement leaning (MARL) is applied for the secondary users to learn good strategies of channel selection. Specifically, the framework of -learning is extended from single user case to multiagent case by considering other secondary users as a part of the environment. The dynamics of the -learning are illustrated using a Metrick-Polak plot, which shows the traces of -values in the two-user case. For both complete and partial observation cases, rigorous proofs of the convergence of multiagent -learning without communications, under certain conditions, are provided using the Robins-Monro algorithm and contraction mapping, respectively. The learning performance (speed and gain in utility) is evaluated by numerical simulations.
+More
reinforcement leaning marl robinsmonro algorithm negotiation channel selection spectrum access scheme metrickpolak plot complete communications multiagent learning contraction mapping twouser case of values partial observation user multiuser and multichannel cognitive radio systems
APA
MLA
Chicago
Li Husheng,.Multiagent -Learning for Aloha-Like Spectrum Access in Cognitive Radio Systems. 2010 (1),.
Select your report category*
Reason*
New sign-in location:
Last sign-in location:
Last sign-in date: