A Game-Theoretic Perspective for Efficient Modern Random Access
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916435519864832 |
|---|---|
| author | Hansen, Andreas Peter Juhl Münster, Jeppe Roden Villadsen, Rasmus Erik Segaard, Simon Bock Rasmussen, Søren Pilegaard Biscio, Christophe Leyva-Mayorga, Israel |
| author_facet | Hansen, Andreas Peter Juhl Münster, Jeppe Roden Villadsen, Rasmus Erik Segaard, Simon Bock Rasmussen, Søren Pilegaard Biscio, Christophe Leyva-Mayorga, Israel |
| contents | Modern random access mechanisms combine packet repetitions with multi-user detection mechanisms at the receiver to maximize the throughput and reliability in massive Internet of Things (IoT) scenarios. However, optimizing the access policy, which selects the number of repetitions, is a complicated problem, and failing to do so can lead to an inefficient use of resources and, potentially, to an increased congestion. In this paper, we follow a game-theoretic approach for optimizing the access policies of selfish users in modern random access mechanisms. Our goal is to find adequate values for the rewards given after a success to achieve a Nash equilibrium (NE) that optimizes the throughput of the system while considering the cost of transmission. Our results show that a mixed strategy, where repetitions are selected according to the irregular repetition slotted ALOHA (IRSA) protocol, attains a NE that maximizes the throughput in the special case with two users. In this scenario, our method increases the throughput by 30% when compared to framed ALOHA. Furthermore, we present three methods to attain a NE with near-optimal throughput for general modern random access scenarios, which exceed the throughput of framed ALOHA by up to 34%. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_09588 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A Game-Theoretic Perspective for Efficient Modern Random Access Hansen, Andreas Peter Juhl Münster, Jeppe Roden Villadsen, Rasmus Erik Segaard, Simon Bock Rasmussen, Søren Pilegaard Biscio, Christophe Leyva-Mayorga, Israel Information Theory Computer Science and Game Theory Modern random access mechanisms combine packet repetitions with multi-user detection mechanisms at the receiver to maximize the throughput and reliability in massive Internet of Things (IoT) scenarios. However, optimizing the access policy, which selects the number of repetitions, is a complicated problem, and failing to do so can lead to an inefficient use of resources and, potentially, to an increased congestion. In this paper, we follow a game-theoretic approach for optimizing the access policies of selfish users in modern random access mechanisms. Our goal is to find adequate values for the rewards given after a success to achieve a Nash equilibrium (NE) that optimizes the throughput of the system while considering the cost of transmission. Our results show that a mixed strategy, where repetitions are selected according to the irregular repetition slotted ALOHA (IRSA) protocol, attains a NE that maximizes the throughput in the special case with two users. In this scenario, our method increases the throughput by 30% when compared to framed ALOHA. Furthermore, we present three methods to attain a NE with near-optimal throughput for general modern random access scenarios, which exceed the throughput of framed ALOHA by up to 34%. |
| title | A Game-Theoretic Perspective for Efficient Modern Random Access |
| topic | Information Theory Computer Science and Game Theory |
| url | https://arxiv.org/abs/2410.09588 |