A Non-Cooperative Multiple Access Game for Timely Updates

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 invest...

Full description

Saved in:
Bibliographic Details
Published inIEEE INFOCOM 2020 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) pp. 924 - 929
Main Authors Gopal, Sneihil, Kaul, Sanjit K., Chaturvedi, Rakesh, Roy, Sumit
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.07.2020
Subjects
Collision avoidance
Games
Nash equilibrium
Probability distribution
Silicon
Throughput
Wireless communication
Online AccessGet full text

Cover

More Information
Summary: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.
DOI:10.1109/INFOCOMWKSHPS50562.2020.9162886