重传LPWA网络中信道选择的上置信度

Rémi Bonnefoi, Lilian Besson, Julio Manco-Vásquez, C. Moy
{"title":"重传LPWA网络中信道选择的上置信度","authors":"Rémi Bonnefoi, Lilian Besson, Julio Manco-Vásquez, C. Moy","doi":"10.1109/WCNCW.2019.8902891","DOIUrl":null,"url":null,"abstract":"In this paper, we propose and evaluate different learning strategies based on Multi-Arm Bandit (MAB) algorithms. They allow Internet of Things (IoT) devices to improve their access to the network and their autonomy, while taking into account the impact of encountered radio collisions. For that end, several heuristics employing Upper-Confident Bound (UCB) algorithms are examined, to explore the contextual information provided by the number of retransmissions. Our results show that approaches based on UCB obtain a significant improvement in terms of successful transmission probabilities. Furthermore, it also reveals that a pure UCB channel access is as efficient as more sophisticated learning strategies.","PeriodicalId":121352,"journal":{"name":"2019 IEEE Wireless Communications and Networking Conference Workshop (WCNCW)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Upper-Confidence Bound for Channel Selection in LPWA Networks with Retransmissions\",\"authors\":\"Rémi Bonnefoi, Lilian Besson, Julio Manco-Vásquez, C. Moy\",\"doi\":\"10.1109/WCNCW.2019.8902891\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose and evaluate different learning strategies based on Multi-Arm Bandit (MAB) algorithms. They allow Internet of Things (IoT) devices to improve their access to the network and their autonomy, while taking into account the impact of encountered radio collisions. For that end, several heuristics employing Upper-Confident Bound (UCB) algorithms are examined, to explore the contextual information provided by the number of retransmissions. Our results show that approaches based on UCB obtain a significant improvement in terms of successful transmission probabilities. Furthermore, it also reveals that a pure UCB channel access is as efficient as more sophisticated learning strategies.\",\"PeriodicalId\":121352,\"journal\":{\"name\":\"2019 IEEE Wireless Communications and Networking Conference Workshop (WCNCW)\",\"volume\":\"80 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-02-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE Wireless Communications and Networking Conference Workshop (WCNCW)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WCNCW.2019.8902891\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE Wireless Communications and Networking Conference Workshop (WCNCW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCNCW.2019.8902891","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

在本文中,我们提出并评估了基于多臂班迪(MAB)算法的不同学习策略。它们允许物联网(IoT)设备改善其对网络的访问和自主性,同时考虑到遇到的无线电碰撞的影响。为此,研究了几种采用上自信界(UCB)算法的启发式方法,以探索重传次数提供的上下文信息。我们的研究结果表明,基于UCB的方法在成功传输概率方面获得了显着改善。此外,它还揭示了纯粹的UCB通道访问与更复杂的学习策略一样有效。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Upper-Confidence Bound for Channel Selection in LPWA Networks with Retransmissions
In this paper, we propose and evaluate different learning strategies based on Multi-Arm Bandit (MAB) algorithms. They allow Internet of Things (IoT) devices to improve their access to the network and their autonomy, while taking into account the impact of encountered radio collisions. For that end, several heuristics employing Upper-Confident Bound (UCB) algorithms are examined, to explore the contextual information provided by the number of retransmissions. Our results show that approaches based on UCB obtain a significant improvement in terms of successful transmission probabilities. Furthermore, it also reveals that a pure UCB channel access is as efficient as more sophisticated learning strategies.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信