Contention Access Game Method in Wireless Ad-Hoc Networks

We models the contention access as an N-person non- cooperative game firstly, then the game is transformed into a constrained optimization problem, each node in the network chooses the optimal probability to maximize its utility function, finally an algorithm is presented for solving the Nash equilibrium. Through simulation and comparison, the contention access game method can reduce the collision probability and improve the system throughput.

[1]  Ratan K. Guha,et al.  Fair bandwidth sharing in distributed systems: a game-theoretic approach , 2005, IEEE Transactions on Computers.

[2]  Voon Chin Phua,et al.  Wireless lan medium access control (mac) and physical layer (phy) specifications , 1999 .

[3]  J. Goodman.  Note on Existence and Uniqueness of Equilibrium Points for Concave N-Person Games , 1965 .

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

[5]  Thierry Turletti,et al.  Modeling and analysis of slow CW decrease IEEE 802.11 WLAN , 2003, 14th IEEE Proceedings on Personal, Indoor and Mobile Radio Communications, 2003. PIMRC 2003..

[6]  Gang Feng,et al.  Random Access in Wireless Ad Hoc Networks for Throughput Maximization , 2006, 2006 9th International Conference on Control, Automation, Robotics and Vision.

[7]  Frank Kelly,et al.  Charging and rate control for elastic traffic , 1997, Eur. Trans. Telecommun..

[8]  Lijun Chen,et al.  Random Access Game and Medium Access Control Design , 2010, IEEE/ACM Transactions on Networking.