Modelling IEEE 802.11 DCF in wireless LANs as a dynamic game with incompletely information

In this paper, a novel game theoretic MAC scheme is proposed to improve the performance of IEEE 802.11 DCF in wireless LANs. The channel contention process between the nodes is modelled as a dynamic game with incompletely information. According to the Nash equilibrium of the game, a novel MAC scheme, called G-DCF, is proposed. Using the G-DCF, each node adjusts its local contention parameters for data transmission to the current game state (i.e. the number of competing nodes), and thereafter updates the game state through the transmission feedbacks. This process is finitely repeated to get the optimal performance. Additionally, to help the idle nodes estimate the game state accurately, a virtual frame scheduling mechanism, called VFS, is developed. The VFS is incorporated into the G-DCF, so an idle node can obtain his equilibrium strategy when he gets ready to transmit real frames. Simulation results show G-DCF can increase the system throughput, decrease the delay bound and frame-loss- rate.