A Game Theoretic Approach to Irregular Repetition Slotted Aloha
Open Access
- 5 January 2022
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 4600-4614
Abstract
Many technological enhancements are being developed worldwide to enable the “Internet of Things” (IoT). IoT networks largely rely on distributed access of billions of devices, but are still lagging in terms of combined reliability and low latency. To mend that shortcoming, it is paramount to adapt existing random access methods for the IoT setting. In this article, we shed light on one of the modern candidates for random access protocols fitted for IoT: the “Irregular Repetition Slotted ALOHA” (IRSA). As self-managing solutions are needed to overcome the challenges of IoT, we study the IRSA random access scheme in a distributed setting where groups of users, with fixed traffic loads, are competing for ALOHA-type channel access. To that aim, we adopt a distributed game-theoretic approach where two classes of IoT devices learn autonomously their optimal IRSA protocol parameters to optimize selfishly their own effective throughput. Through extensive simulations, we assess the notable efficiency of the game based distributed approach. We also show that our IRSA game attains the Nash equilibrium (NE) via the “better reply” strategy, and we quantify the price of anarchy in comparison with a centralized approach. Our results imply that user competition does not fundamentally impact the performance of the IRSA protocol.Keywords
Funding Information
- INRIA—Nokia Bell Labs Common Labs under Research action “Network Information Theory.”
This publication has 25 references indexed in Scilit:
- Irregular repetition slotted ALOHA over the Rayleigh block fading channel with capture2017
- Modern Random Access ProtocolsFoundations and Trends® in Networking, 2016
- Coded Slotted ALOHA: A Graph-Based Method for Uncoordinated Multiple AccessIEEE Transactions on Information Theory, 2015
- Game Theoretic Approaches for Multiple Access in Wireless Networks: A SurveyIEEE Communications Surveys & Tutorials, 2011
- Methodologies for analyzing equilibria in wireless gamesIEEE Signal Processing Magazine, 2009
- The Analysis of Nash Equilibria of the One-Shot Random-Access Game for Wireless Networks and the Behavior of Selfish NodesIEEE/ACM Transactions on Networking, 2008
- Density evolution method and threshold decision for irregular LDPC codes2004
- Selfish users in Aloha: a game-theoretic approach2002
- Learning in Games by Random SamplingJournal of Economic Theory, 2001
- Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous SpacesJournal of Global Optimization, 1997