A Non-Cooperative Multiple Access Game for Timely Updates
Preprint
Abstract
We consider a network of selfish nodes that would like to minimize the age of their updates at the other nodes. The nodes send their updates over a shared spectrum using a CSMA/CA based access mechanism. We model the resulting competition as a non-cooperative one-shot multiple access game and investigate equilibrium strategies for two distinct medium access settings (a) collisions are shorter than successful transmissions and (b) collisions are longer. We investigate competition in a CSMA/CA slot, where a node may choose to transmit or stay idle. We find that medium access settings exert strong incentive effects on the nodes. We show that when collisions are shorter, transmit is a weakly dominant strategy. This leads to all nodes transmitting in the CSMA/CA slot, therefore guaranteeing a collision. In contrast, when collisions are longer, no weakly dominant strategy exists and under certain conditions on the ages at the beginning of the slot, we derive the mixed strategy Nash equilibrium.Keywords
All Related Versions
This publication has 9 references indexed in Scilit:
- Age of Information in Random Access ChannelsIEEE Transactions on Information Theory, 2022
- On the Global Optimality of Whittle’s Index Policy for Minimizing the Age of InformationIEEE Transactions on Information Theory, 2021
- Fundamental bounds on the age of information in multi-hop global status update networksJournal of Communications and Networks, 2019
- Age of information performance of multiaccess strategies with packet managementJournal of Communications and Networks, 2019
- A dynamic jamming game for real-time status updates2018
- Status updates over unreliable multiaccess channels2017
- Random Access Game and Medium Access Control DesignIEEE/ACM Transactions on Networking, 2010
- Equilibria of a noncooperative game for heterogeneous users of an ALOHA networkIEEE Communications Letters, 2002
- Performance analysis of the IEEE 802.11 distributed coordination functionIEEE Journal on Selected Areas in Communications, 2000