当前位置: X-MOL 学术arXiv.cs.GT › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A Non-Cooperative Multiple Access Game for Timely Updates
arXiv - CS - Computer Science and Game Theory Pub Date : 2020-01-23 , DOI: arxiv-2001.08850
Sneihil Gopal, Sanjit K. Kaul, Rakesh Chaturvedi, Sumit Roy

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.

中文翻译:

用于及时更新的非合作多路访问博弈

我们考虑一个自私节点网络,该网络希望最小化其他节点的更新时间。节点使用基于 CSMA/CA 的访问机制通过共享频谱发送它们的更新。我们将由此产生的竞争建模为非合作的一次性多路访问博弈,并研究两种不同介质访问设置的均衡策略(a)冲突比成功传输短,(b)冲突更长。我们调查了 CSMA/CA 时隙中的竞争,其中节点可以选择传输或保持空闲。我们发现中等访问设置对节点产生强烈的激励作用。我们表明,当冲突较短时,传输是一种弱优势策略。这导致所有节点在 CSMA/CA 时隙中进行传输,因此保证了冲突。相反,当碰撞时间较长时,
更新日期:2020-01-27
down
wechat
bug