{"title":"Full Echo Q-routing with adaptive learning rates: A reinforcement learning approach to network routing","authors":"Y. Shilova, Maksim Kavalerov, I. Bezukladnikov","doi":"10.1109/EICONRUSNW.2016.7448188","DOIUrl":null,"url":null,"abstract":"Dynamically changing networks, such as mobile wireless sensor networks, Internet of Things networks, vehicular ad hoc networks etc., require efficient routing techniques. We present a routing algorithm, Adaptive Q-routing Full Echo, that is an extension of `full echo' modification of Q-routing algorithm and uses adaptive learning rates to improve exploration behaviour. The performance of the proposed algorithm is evaluated empirically in comparison to Q-routing and Dual Q-routing algorithms. The preliminary results suggest that the proposed algorithm represents a promising way of achieving good routing performance in dynamically changing networks.","PeriodicalId":262452,"journal":{"name":"2016 IEEE NW Russia Young Researchers in Electrical and Electronic Engineering Conference (EIConRusNW)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"23","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE NW Russia Young Researchers in Electrical and Electronic Engineering Conference (EIConRusNW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EICONRUSNW.2016.7448188","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 23
Abstract
Dynamically changing networks, such as mobile wireless sensor networks, Internet of Things networks, vehicular ad hoc networks etc., require efficient routing techniques. We present a routing algorithm, Adaptive Q-routing Full Echo, that is an extension of `full echo' modification of Q-routing algorithm and uses adaptive learning rates to improve exploration behaviour. The performance of the proposed algorithm is evaluated empirically in comparison to Q-routing and Dual Q-routing algorithms. The preliminary results suggest that the proposed algorithm represents a promising way of achieving good routing performance in dynamically changing networks.