WiFi基础设施网络的MAC设计：博弈论方法
MAC design for WiFi infrastructure networks: a game-theoretic approach
摘要：
在WiFi网络中，移动节点通过称为分布式协调功能（DCF）的随机接入协议来竞争接入共享信道。虽然这个协议原则上是公平的，因为所有的站都有相同的概率在信道上传输，它已被证明，不公平的行为可能会出现在实际的网络场景中，因为非标准配置的节点。由于扩散的开源驱动程序和可编程卡，使一个简单的定制的通道访问策略，我们提出了一个博弈论分析的随机访问方案。假设每个节点是合理的，并实现了最佳响应策略，我们表明，有效的均衡条件，可以达到当站都有兴趣在上传和下载流量。更有趣的是，当所有的站点都采用相同的策略时，这些均衡就会达到，从而保证了公平的资源共享。当站点只对上传流量感兴趣时，我们还提出了一种机制设计，基于人工丢弃第2层的分段，以强制实现所需的平衡。最后，我们提出并评估了一些简单的DCF扩展实际实现我们的理论研究结果。
英文摘要：
In WiFi networks, mobile nodes compete for accessing a shared channel by means of a random access protocol called Distributed Coordination Function (DCF). Although this protocol is in principle fair, since all the stations have the same probability to transmit on the channel, it has been shown that unfair behaviors may emerge in actual networking scenarios because of non-standard configurations of the nodes. Due to the proliferation of open source drivers and programmable cards, enabling an easy customization of the channel access policies, we propose a game-theoretic analysis of random access schemes. Assuming that each node is rational and implements a best response strategy, we show that efficient equilibria conditions can be reached when stations are interested in both uploading and downloading traffic. More interesting, these equilibria are reached when all the stations play the same strategy, thus guaranteeing a fair resource sharing. When stations are interested in upload traffic only, we also propose a mechanism design, based on an artificial dropping of layer-2 acknowledgments, to force desired equilibria. Finally, we propose and evaluate some simple DCF extensions for practically implementing our theoretical findings.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
