pith. sign in

arxiv: 1902.10615 · v1 · pith:MBIN2JI2new · submitted 2019-02-27 · 💻 cs.NI

Upper-Confidence Bound for Channel Selection in LPWA Networks with Retransmissions

classification 💻 cs.NI
keywords accessalgorithmsboundchannellearningretransmissionsstrategiesaccount
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.