A Game-Theoretic Model for Medium Access Control

In this paper, a game-theoretic model for contention based medium access control (contention control) is proposed. We define a general game-theoretic model, called random access game, to capture the distributed nature of contention control and the interaction among wireless nodes with contention-based medium access. We study the design of random access games, characterize their equilibria, study their dynamics, and propose distributed algorithms to achieve the equilibria. This provides a unique perspective to understand existing MAC protocols and a general framework to guide the design of new ones to improve the system performance. As examples, a series of utility functions is proposed for games achieving the maximum throughput in a network of homogeneous nodes. The convergence of different variants (e.g., asynchronous and stochastic algorithms) of different dynamic algorithms such as gradient play are obtained. An equilibrium selection algorithm is also proposed to guarantee that the dynamic algorithms can actually achieve the desired operating point. 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.

[1]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[2]  R. Srikant,et al.  End-to-end congestion control schemes: utility functions, random losses and ECN marks , 2003, TNET.

[3]  R. Srikant,et al.  End-to-end congestion control schemes: utility functions, random losses and ECN marks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[4]  Jennifer C. Hou,et al.  A Novel Approach to Contention Control in IEEE 802.11e-Operated WLANs , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[5]  D. M. Topkis.  Equilibrium Points in Nonzero-Sum n-Person Submodular Games , 1979 .

[6]  A. M. Abdullah,et al.  Wireless lan medium access control (mac) and physical layer (phy) specifications , 1997 .

[7]  A. Robert Calderbank,et al.  Reverse-Engineering MAC: A Non-Cooperative Game Model , 2007, IEEE Journal on Selected Areas in Communications.

[8]  Sjur Didrik Fl m.  Equilibrium, evolutionary stability and gradient dynamics , 2002 .

[9]  Andrzej Duda,et al.  Idle sense: an optimal access method for high throughput and fairness in rate diverse wireless LANs , 2005, SIGCOMM '05.

[10]  Kim C. Border,et al.  Fixed point theorems with applications to economics and game theory: Fixed point theorems for correspondences , 1985 .

[11]  George Kesidis,et al.  Equilibria of a noncooperative game for heterogeneous users of an ALOHA network , 2002, IEEE Communications Letters.

[12]  Raj Jain,et al.  A Quantitative Measure Of Fairness And Discrimination For Resource Allocation In Shared Computer Systems , 1998, ArXiv.

[13]  Saurabh Ganeriwal,et al.  On selfish behavior in CSMA/CA networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[14]  Sjur Didrik Flåm,et al.  Equilibrium, Evolutionary stability and Gradient Dynamics , 2002, IGTR.

[15]  Stephen B. Wicker,et al.  Stability of multipacket slotted Aloha with selfish users and perfect information , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[16]  Lijun Chen,et al.  A Game-Theoretic Framework for Medium Access Control , 2008, IEEE Journal on Selected Areas in Communications.

[17]  A. Girotra,et al.  Performance Analysis of the IEEE 802 . 11 Distributed Coordination Function , 2005 .

[18]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[19]  Richard J. La,et al.  Utility-based rate control in the Internet for elastic traffic , 2002, TNET.