On multiple access random medium access control
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Random access protocols for WLANs based on mechanism design
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Dynamic conjectures in random access networks using bio-inspired learning
IEEE Journal on Selected Areas in Communications
Optimal SINR-based random access
INFOCOM'10 Proceedings of the 29th conference on Information communications
An adaptive tit-for-tat strategy for IEEE 802.11 CSMA/CA protocol
International Journal of Security and Networks
| Hi-index | 0.07 |
In this paper, we generalize the random access game model, and show that it provides a general game- theoretic framework for designing contention based medium access control. We extend the random access game model to the network with multiple contention measure signals, study the design of random access games, and analyze different distributed algorithms achieving their equilibria. As examples, a series of utility functions is proposed for games achieving the maximum throughput in a network of homogeneous nodes. In a network with n traffic classes, an N-signal game model is proposed which achieves the maximum throughput under the fairness constraint among different traffic classes. In addition, the convergence of different dynamic algorithms such as best response, gradient play and Jacobi play under propagation delay and estimation error is established. Simulation results show that game model based protocols can achieve superior performance over the standard IEEE 802.11 DCF, and comparable performance as existing protocols with the best performance in literature.