Ke Yang, Shengxiang Zhu, Zhenlei Dan, Xiaolan Tang, Xiaohuan Wu, J. Ouyang
{"title":"Relay Selection for Wireless Cooperative Networks using Adaptive Q-learning Approach","authors":"Ke Yang, Shengxiang Zhu, Zhenlei Dan, Xiaolan Tang, Xiaohuan Wu, J. Ouyang","doi":"10.1109/CSQRWC.2019.8799213","DOIUrl":null,"url":null,"abstract":"Relay selection is an effective method to improve the system performance of co-operative communication, and thus has received significant attention. In this paper, by assuming that the instantaneous channel state information (CSI) is unknown at the source and relays, we propose a Q-learning (QL) based on relay se-lection method, which can select the relays with maximum cumulative reward to obtain the maximum throughput of the cooperative networks. Besides, Boltzmann learning rule is adopted to achieve well counterpoise between action exploration and exploitation. Simulation results show that the proposed QL algorithm can select the optimal relay adaptively and improve the system performance significantly in comparison with random selection algorithm. Furthermore, it can be found that as the number of relay nodes increases, the QL algorithm can still adaptively select the optimal relay without increasing the computational load.","PeriodicalId":254491,"journal":{"name":"2019 Cross Strait Quad-Regional Radio Science and Wireless Technology Conference (CSQRWC)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 Cross Strait Quad-Regional Radio Science and Wireless Technology Conference (CSQRWC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSQRWC.2019.8799213","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
Relay selection is an effective method to improve the system performance of co-operative communication, and thus has received significant attention. In this paper, by assuming that the instantaneous channel state information (CSI) is unknown at the source and relays, we propose a Q-learning (QL) based on relay se-lection method, which can select the relays with maximum cumulative reward to obtain the maximum throughput of the cooperative networks. Besides, Boltzmann learning rule is adopted to achieve well counterpoise between action exploration and exploitation. Simulation results show that the proposed QL algorithm can select the optimal relay adaptively and improve the system performance significantly in comparison with random selection algorithm. Furthermore, it can be found that as the number of relay nodes increases, the QL algorithm can still adaptively select the optimal relay without increasing the computational load.