.png){kind=icon}
Return
A game-theoretic framework for medium access control
.png){kind=icon}
OA
AI
DOI：10.1109/JSAC.2008.080909.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
medium access control
random access game
Nash equilibrium
distributed strategy update mechanism
wireless LANs
Journal
IF:
17.2
Papers:
6.4K
Citations:
3.1W
Organization
Cited Papers
The sub‐zero temperature chromatographic isolation of transient intermediates of a multi‐step cycle: Purification of the substrate‐bound oxy‐ferrous cytochrome P450.png)
FEBS Letters
OAAI
FEBS LettersIF0
OAAIShareSaveShareSaveThe extrapolation of the Drucker–Prager/Cap material parameters to low and high relative densities
PREAI
ShareSaveShareSave
View more