pith. sign in

arxiv: 1904.00665 · v1 · pith:ZSVTT33Znew · submitted 2019-04-01 · 💻 cs.NI

Learn2MAC: Online Learning Multiple Access for URLLC Applications

classification 💻 cs.NI
keywords accessperformancerandomonlineprobabilityproposedprotocolscheme
0
0 comments X
read the original abstract

This paper addresses a fundamental limitation of previous random access protocols, their lack of latency performance guarantees. We consider $K$ IoT transmitters competing for uplink resources and we design a fully distributed protocol for deciding how they access the medium. Specifically, each transmitter restricts decisions to a locally-generated dictionary of transmission patterns. At the beginning of a frame, pattern $i$ is chosen with probability $p^i$, and an online exponentiated gradient algorithm is used to adjust this probability distribution. The performance of the proposed scheme is showcased in simulations, where it is compared with a baseline random access protocol. Simulation results show that (a) the proposed scheme achieves good latent throughput performance and low energy consumption, while (b) it outperforms by a big margin random transmissions.

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.